Co-occurring keywords · papers mentioning both
Papers
Accelerated Methods for Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties
AISTATS 2025
Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity
ICLR 2025
Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
NeurIPS 2024
Linearization Algorithms for Fully Composite Optimization
COLT 2023
Acceleration in Distributed Optimization under Similarity
AISTATS 2022
Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities
AAAI 2021
Highly smooth minimization of non-smooth problems
COLT 2020
Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond
COLT 2020
Accelerated Coordinate Descent with Arbitrary Sampling and Best Rates for Minibatches
AISTATS 2019
Katalyst: Boosting Convex Katayusha for Non-Convex Problems with a Large Condition Number
ICML 2019
Accelerated Doubly Stochastic Gradient Algorithm for Large-scale Empirical Risk Minimization
IJCAI 2017
Doubly Accelerated Methods for Faster CCA and Generalized Eigendecomposition
ICML 2017
A Simple Practical Accelerated Method for Finite Sums
NeurIPS 2016
Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization
ICML 2015
An Accelerated Proximal Coordinate Gradient Method
NeurIPS 2014