Research map / Optimization / Nonconvex and smooth optimization
Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
Andrei Patrascu, Ion Necoara
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 stochastic proximal point (SPP) instead of SGD | constrained stochastic optimization · Markowitz portfolio (SP500, FF100) | test objective over one pass | Improved |
| vary initial stepsize and stepsize exponent for SPP vs SGD (ablation) | SPP and SGD · Markowitz portfolio (SP500, FF100) | sensitivity to stepsize | Improved |
| increase stepsize exponent gamma (ablation) | SPP and RSPP · constrained least squares, random data | convergence rate | Improved |
| add restarting (RSPP) to SPP (ablation) | SPP · constrained least squares, random data | convergence | Improved |
Closest papers by meaning
- Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization (JMLR 2021 · similarity 0.91)
- Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods (ICLR 2024 · similarity 0.91)
- Universal Gradient Methods for Stochastic Convex Optimization (ICML 2024 · similarity 0.90)
- Stochastic Newton Proximal Extragradient Method (NeurIPS 2024 · similarity 0.90)
- High-probability complexity bounds for stochastic non-convex minimax optimization (NeurIPS 2024 · similarity 0.89)
- Last-Iterate Convergence of Single-Loop Stochastic Methods for Constrained Convex-Concave Minimax Problems (NeurIPS 2026 · similarity 0.89)
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.
