AI Paper Atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Deciphering Lasso-based Classification Through a Large Dimensional Analysis of the Iterative Soft-Thresholding Algorithm

ICML 2022 · Learning theory and algorithms › Prediction and decision losses · approach: Distributionally robust optimization

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 changedWhereMeasuredEffect
Lasso sparsity penalty (lambda > 0) vs ridge-less case (lambda = 0) on sparse-mean Gaussian mixture (ablation)Lasso-based classification (ISTA) · Synthetic Gaussian mixture, p=100, sparsity alpha=0.9relative accuracy gain over ridge-less classifierMixed
Adding sparsity (Lasso penalty) with appropriately chosen lambda (ablation)Lasso-based classification on sparse-mean data · Synthetic Gaussian mixture, high sparsity alpha=0.9 vs ridge-lessclassification accuracyHelped
Choosing lambda by grid search on theoretical classification error instead of cross-validationLasso-based classification hyperparameter selection · MNIST, Amazon review, CIFAR-10 (PCA/tf*idf)classification errorNo clear effect
Using the theoretical ISTA iteration (Algorithm 1) instead of empirical ISTA for computing the solutionLasso classification solver · Empirical comparison (appendix)convergence speed (iterations and running time)Helped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy