Research map / Optimization / Nonconvex and smooth optimization
Variance Reduction via Accelerated Dual Averaging for Finite-Sum 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
- Variance Reduction via Primal-Dual Accelerated Dual Averaging for Nonsmooth Convex Finite-Sums (ICML 2021 · similarity 0.94)
- Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction (ICML 2022 · similarity 0.91)
- Doubly Accelerated Stochastic Variance Reduced Dual Averaging Method for Regularized Empirical Risk Minimization (NeurIPS 2017 · similarity 0.90)
- A unified variance-reduced accelerated gradient method for convex optimization (NeurIPS 2019 · similarity 0.90)
- Double Variance Reduction: A Smoothing Trick for Composite Optimization Problems without First-Order Gradient (ICML 2024 · similarity 0.89)
- Decentralized Convex Finite-Sum Optimization with Better Dependence on Condition Numbers (ICML 2024 · similarity 0.87)
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.