Research map / Learning theory and algorithms / Matrix and tensor methods
A Sparse Semismooth Newton Based Proximal Majorization-Minimization Algorithm for Nonconvex Square-Root-Loss Regression Problems
Peipei Tang, Chengjing Wang, Defeng Sun, Kim-Chuan Toh
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 |
|---|---|---|---|
| replace Flare's pADMM (unit step length) with the authors' pADMM implementation with dynamic parameter updates | srLasso solver · synthetic exmp4 (m=8000, n=4000), lambda_c=0.1 | computation time: 3:11:27 -> 5:12 | Improved |
| replace Flare with the authors' pADMM | srLasso solver · synthetic exmp1 (m=8000, n=800), lambda_c=0.1 | primal objective value: 1.0487+3 -> 5.8738+2 | Improved |
| use the authors' pADMM where Flare fails on memory | srLasso solver · UCI abalone.scale.expanded7 (m=4177, n=6435) | solvability: -- -> 25:57 | Improved |
| use the authors' pADMM instead of Flare on a case where objectives are equal | srLasso solver · synthetic exmp4, lambda_c=0.5 | primal objective value: 1.0165+4 -> 1.0165+4 | No clear effect |
| use PMM instead of pADMM or dADMM | srLasso solver · synthetic and UCI datasets | computation time and KKT accuracy | Improved |
| use pADMM instead of dADMM | srLasso solver · synthetic datasets | efficiency | Improved |
Closest papers by meaning
- On Quadratic Convergence of DC Proximal Newton Algorithm in Nonconvex Sparse Learning (NeurIPS 2017 · similarity 0.89)
- A Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems (AAAI 2024 · similarity 0.86)
- Skip the Hessian, Keep the Rates: Globalized Semismooth Newton with Lazy Hessian Updates (NeurIPS 2026 · similarity 0.85)
- ADMM for Nonconvex Optimization under Minimal Continuity Assumption (ICLR 2025 · similarity 0.85)
- A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees (NeurIPS 2025 · similarity 0.85)
- Smoothing Proximal Gradient Methods for Nonsmooth Sparsity Constrained Optimization: Optimality Conditions and Global Convergence (ICML 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.
