Research map / Optimization / Nonconvex and smooth optimization
Accelerated, Optimal and Parallel: Some results on model-based stochastic 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.
Closest papers by meaning
- Minibatch Stochastic Approximate Proximal Point Methods (NeurIPS 2020 · similarity 0.95)
- An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning (NeurIPS 2021 · similarity 0.91)
- Hybrid Stochastic-Deterministic Minibatch Proximal Gradient: Less-Than-Single-Pass Optimization with Nearly Optimal Generalization (ICML 2020 · similarity 0.90)
- Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization (NeurIPS 2021 · similarity 0.90)
- Faster Stochastic Optimization with Arbitrary Delays via Adaptive Asynchronous Mini-Batching (ICML 2025 · similarity 0.89)
- Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints (ICML 2025 · similarity 0.88)
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.