Research map / Optimization / Nonconvex and smooth optimization
Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization
Michael R. Metel, Akiko Takeda
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 MBSPA or VRSPA instead of deterministic SDCAM | non-negative sparse PCA with MCP regularizer · MNIST and RCV1 | objective vs wall-clock time | Improved |
| give VRSPA the larger MBSPA stepsize (VRSPA2) (ablation) | VRSPA · MNIST and RCV1 | objective vs wall-clock time | No clear effect |
Closest papers by meaning
- Simple Stochastic Gradient Methods for Non-Smooth Non-Convex Regularized Optimization (ICML 2019 · similarity 0.95)
- Proximal Stochastic Methods for Nonsmooth Nonconvex Finite-Sum Optimization (NeurIPS 2016 · similarity 0.94)
- Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints (ICML 2025 · similarity 0.91)
- A Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems (AAAI 2024 · similarity 0.90)
- High-probability complexity bounds for stochastic non-convex minimax optimization (NeurIPS 2024 · similarity 0.90)
- Stochastic Newton Proximal Extragradient Method (NeurIPS 2024 · 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.
