Research map / Learning theory and algorithms / Matrix and tensor methods
Solving L1-regularized SVMs and Related Linear Programs: Revisiting the Effectiveness of Column and Constraint Generation
Antoine Dedieu, Rahul Mazumder, Haoyue Wang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use column and constraint generation instead of the PSM method when n is large and p small | L1-SVM · n about 10^4, p about 100 | run time and memory: PSM can take hours and large memory, while the proposed methods take a few seconds | Improved |
Closest papers by meaning
- Sparse SVM with Hard-Margin Loss: a Newton-Augmented Lagrangian Method in Reduced Dimensions (JMLR 2025 · similarity 0.91)
- Faster Algorithms for Structured Linear and Kernel Support Vector Machines (ICLR 2025 · similarity 0.91)
- On lp-Support Vector Machines and Multidimensional Kernels (JMLR 2020 · similarity 0.90)
- Support Vector Machine Classifier via Soft-Margin Loss (TPAMI 2021 · similarity 0.90)
- An Error Bound for L1-norm Support Vector Machine Coefficients in Ultra-high Dimension (JMLR 2016 · similarity 0.90)
- Approximation Vector Machines for Large-scale Online Learning (JMLR 2017 · similarity 0.90)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
