Research map / Optimization / Nonconvex and smooth optimization
On Acceleration for Convex Composite Minimization with Noise-Corrupted Gradients and Approximate Proximal Mapping
Qiang Zhou, Sinno Jialin Pan
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
- Accelerated Quasi-Newton Proximal Extragradient: Faster Rate for Smooth Convex Optimization (NeurIPS 2023 · similarity 0.91)
- Inexact Proximal Gradient Methods for Non-Convex and Non-Smooth Optimization (AAAI 2018 · similarity 0.90)
- RECAPP: Crafting a More Efficient Catalyst for Convex Optimization (ICML 2022 · similarity 0.90)
- Adaptive Proximal Average Approximation for Composite Convex Minimization (AAAI 2017 · similarity 0.89)
- Convergence Analysis of Proximal Gradient with Momentum for Nonconvex Optimization (ICML 2017 · similarity 0.89)
- Non-convex Stochastic Composite Optimization with Polyak Momentum (ICML 2024 · 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.
