Research map / Learning theory and algorithms / Optimal transport
On Regularized Square-root Regression Problems: Distributionally Robust Interpretation and Fast Computations
Hong T.M. Chu, Kim-Chuan Toh, Yangjing Zhang
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 PPDNA instead of pADMM | square-root sparse group Lasso solver · Example 3 (4000,6000), w=(0,1) | running time (mm:ss): 30:00 -> 05 | Improved |
| use PPDNA instead of dADMM | square-root sparse group Lasso solver · Example 3 (4000,6000), w=(0,1) | running time (mm:ss): 16:50 -> 05 | Improved |
| use PPDNA instead of S-TISP | square-root group Lasso solver · Example 3 (4000,6000), w=(0,1) | running time (mm:ss): 12:51 -> 05 | Improved |
| use PPDNA instead of S-TISP | square-root group Lasso solver · Example 1 (1000,6000), w=(0,1) | running time (mm:ss): 04 -> 00 | Hurt |
| use PPDNA instead of pADMM | square-root sparse group Lasso solver · Example 2 (10000,480), w=(0.5,0.5) | running time (mm:ss): 05:29 -> 10 | Improved |
| use PPDNA instead of dADMM | square-root sparse group Lasso solver · Example 4b (4000,6000), w=(0,1) | running time (mm:ss): 03:11 -> 01:33 | Improved |
| use PPDNA instead of pADMM | square-root fused Lasso solver · UCI housing, lambda=1 | running time (mm:ss): 25:01 -> 05 | Improved |
| use square-root loss instead of least squares loss | tuning parameter lambda · Example 3 simulation, N=100, n=150, varying sigma | running time (mm:ss) | Improved |
Closest papers by meaning
- Sharp Oracle Inequalities for Square Root Regularization (JMLR 2017 · similarity 0.90)
- A Unified Semismooth Newton Approach to Multitask and Multivariate Square-Root Lasso Problems (NeurIPS 2026 · similarity 0.89)
- A Robust Learning Approach for Regression Models Based on Distributionally Robust Optimization (JMLR 2018 · similarity 0.86)
- Robust Sparse Regression with Non-Isotropic Designs (NeurIPS 2024 · similarity 0.86)
- A Sparse Semismooth Newton Based Proximal Majorization-Minimization Algorithm for Nonconvex Square-Root-Loss Regression Problems (JMLR 2020 · similarity 0.86)
- Drago: Primal-Dual Coupled Variance Reduction for Faster Distributionally Robust Optimization (NeurIPS 2024 · similarity 0.85)
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.
