conftrace_

gradient complexity

26 papers

Explore in graph

Co-occurring keywords

minimax optimization (186) stochastic gradient descent (1091) nonconvex optimization (316) variance reduction (523) convex optimization (1321) stochastic optimization (1060) saddle point (95) convergence analysis (395) differential privacy (1016) second-order stationary point (31)

Papers

Escaping Saddle Point Efficiently in Minimax and Bilevel Optimizations IJCAI 2025
Faster Sampling without Isoperimetry via Diffusion-based Monte Carlo COLT 2024
AdaGDA: Faster Adaptive Gradient Descent Ascent Methods for Minimax Optimization AISTATS 2023
Efficient Privacy-Preserving Stochastic Nonconvex Optimization UAI 2023
Accelerated Primal-Dual Methods for Convex-Strongly-Concave Saddle Point Problems ICML 2023
Decentralized Riemannian Algorithm for Nonconvex Minimax Problems AAAI 2023
Convergence of Adam Under Relaxed Assumptions NIPS 2023
Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization NIPS 2023
Accelerated Zeroth-Order and First-Order Momentum Methods from Mini to Minimax Optimization JMLR 2022
Improved Convergence Rate of Stochastic Gradient Langevin Dynamics with Variance Reduction and its Application to Optimization NIPS 2022
Kill a Bird with Two Stones: Closing the Convergence Gaps in Non-Strongly Convex Optimization by Directly Accelerated SVRG with Double Compensation and Snapshots ICML 2022
Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods COLT 2022
Will Bilevel Optimizers Benefit from Loops NIPS 2022
Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis NIPS 2021
Differential Privacy Dynamics of Langevin Diffusion and Noisy Gradient Descent NIPS 2021
Efficient Mirror Descent Ascent Methods for Nonsmooth Minimax Problems NIPS 2021
Optimal Underdamped Langevin MCMC Method NIPS 2021
Improved Algorithms for Convex-Concave Minimax Optimization NIPS 2020
Near-Optimal Algorithms for Minimax Optimization COLT 2020
Bounding the expected run-time of nonconvex optimization with early stopping UAI 2020
Stochastic Nested Variance Reduction for Nonconvex Optimization JMLR 2020
Acceleration of SVRG and Katyusha X by Inexact Preconditioning ICML 2019
SSRGD: Simple Stochastic Recursive Gradient Descent for Escaping Saddle Points NIPS 2019
Third-order Smoothness Helps: Faster Stochastic Optimization Algorithms for Finding Local Minima NIPS 2018
Stochastic Nested Variance Reduction for Nonconvex Optimization NIPS 2018