← Keywords

finite-sum optimization

31 papers

Explore in graph

Co-occurring keywords

variance reduction (520) nonconvex optimization (316) stochastic gradient descent (1088) stochastic optimization (1060) convex optimization (1320) stochastic gradient (296) convergence rate (606) non-convex optimization (546) gradient descent (1143) oracle complexity (65)

Papers

A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization JMLR 2025
SIFAR: A Simple Faster Accelerated Variance-Reduced Gradient Method IJCAI 2025
Last-iterate Convergence of Shuffling Momentum Gradient Method under the Kurdyka-Lojasiewicz Inequality JMLR 2025
Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction JMLR 2024
Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations NIPS 2024
Non-Smooth Weakly-Convex Finite-sum Coupled Compositional Optimization NIPS 2023
Faster Rates of Convergence to Stationary Points in Differentially Private Optimization ICML 2023
Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization NIPS 2022
Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction ICML 2022
On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization AISTATS 2022
Theoretical Convergence of Multi-Step Model-Agnostic Meta-Learning JMLR 2022
Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums AISTATS 2022
Dimension-free Complexity Bounds for High-order Nonconvex Finite-sum Optimization ICML 2022
A Unified Convergence Analysis for Shuffling-Type Gradient Methods JMLR 2021
L-SVRG and L-Katyusha with Arbitrary Sampling JMLR 2021
How Good is SGD with Random Shuffling? COLT 2020
DINO: Distributed Newton-Type Optimization Method ICML 2020
SGD with shuffling: optimal rates without component convexity and large epoch requirements NIPS 2020
Variance Reduced Coordinate Descent with Acceleration: New Method With a Surprising Application to Finite-Sum Problems ICML 2020
Adaptive Importance Sampling for Finite-Sum Optimization and Sampling with Decreasing Step-Sizes NIPS 2020
Variance Reduction via Accelerated Dual Averaging for Finite-Sum Optimization NIPS 2020
A unified variance-reduced accelerated gradient method for convex optimization NIPS 2019
An Accelerated Decentralized Stochastic Proximal Algorithm for Finite Sums NIPS 2019
Lower Bounds for Smooth Nonconvex Finite-Sum Optimization ICML 2019
SGDLibrary: A MATLAB library for stochastic optimization algorithms JMLR 2018