Algorithms for Sparse Support Vector Machines

DOI10.1080/10618600.2022.2146697arXiv2110.07691MaRDI QIDQ6180740

Unnamed Author, Kenneth L. Lange

Publication date: 22 January 2024

Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.07691

zbMATH Keywords

Juliadiscriminant analysisunsupervised learningsparsity

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SVM-Maj: a majorization approach to linear support vector machines with different hinge errors
• Distance majorization and its applications
• Multicategory vertex discriminant analysis for high-dimensional data
• Support-vector networks
• Some results on Tchebycheffian spline functions and stochastic processes
• An algorithmic approach to nonlinear analysis and optimization
• MM Optimization Algorithms
• 10.1162/15324430152748218
• Safe Feature Elimination in Sparse Supervised Learning
• Proximal Distance Algorithms: Theory and Examples
• Strong Rules for Discarding Predictors in Lasso-Type Problems
• Variational methods for the solution of problems of equilibrium and vibrations
• Computational learning theory. 14th annual conference, COLT 2001, and 5th European conference, EuroCOLT 2001, Amsterdam, Netherlands, July 16--19, 2001. Proceedings
• Training invariant support vector machines

This page was built for publication: Algorithms for Sparse Support Vector Machines