Research map / Optimization / Nonconvex and smooth optimization
A Hybrid Stochastic-Deterministic Minibatch Proximal Gradient Method for Efficient Optimization and Generalization
Pan Zhou, Xiao–Tong Yuan, Zhouchen Lin, Steven C. H. Hoi
Read the paperCheck your idea against 137,217 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
- Hybrid Stochastic-Deterministic Minibatch Proximal Gradient: Less-Than-Single-Pass Optimization with Nearly Optimal Generalization (ICML 2020 · similarity 0.96)
- Minibatch Stochastic Approximate Proximal Point Methods (NeurIPS 2020 · similarity 0.92)
- Sharper Analysis for Minibatch Stochastic Proximal Point Methods: Stability, Smoothness, and Deviation (JMLR 2023 · similarity 0.91)
- Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimization (JMLR 2022 · similarity 0.91)
- Non-convex Stochastic Composite Optimization with Polyak Momentum (ICML 2024 · similarity 0.89)
- The Sample Complexity of Gradient Descent in Stochastic Convex Optimization (NeurIPS 2024 · 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.
