conftrace_

first-order method

89 papers

Explore in graph

Also known as

FOM

Co-occurring keywords

convex optimization (1321) convergence rate (607) gradient descent (1144) stochastic optimization (1060) accelerated gradient (62) bilevel optimization (194) constrained optimization (281) non-convex optimization (547) nonconvex optimization (316) first-order optimization (47)

Papers

Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence Analysis ICML 2022
Exploitability Minimization in Games and Beyond NIPS 2022
Efficient Convex Optimization Requires Superlinear Memory COLT 2022
On Acceleration for Convex Composite Minimization with Noise-Corrupted Gradients and Approximate Proximal Mapping JMLR 2022
BOME! Bilevel Optimization Made Easy: A Simple First-Order Approach NIPS 2022
Fast Algorithms for Packing Proportional Fairness and its Dual NIPS 2022
Stochastic Halpern Iteration with Variance Reduction for Stochastic Monotone Inclusions NIPS 2022
Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums AISTATS 2022
LocoProp: Enhancing BackProp via Local Loss Optimization AISTATS 2022
Accelerating Quadratic Optimization with Reinforcement Learning NIPS 2021
Convex-Concave Min-Max Stackelberg Games NIPS 2021
A first-order primal-dual method with adaptivity to local smoothness NIPS 2021
A Unified Analysis of First-Order Methods for Smooth Games via Integral Quadratic Constraints JMLR 2021
First-Order Methods for Wasserstein Distributionally Robust MDP ICML 2021
On a Combination of Alternating Minimization and Nesterov’s Momentum ICML 2021
Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient NIPS 2021
Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization AISTATS 2021
Anderson acceleration of coordinate descent AISTATS 2021
Momentum Improves Optimization on Riemannian Manifolds AISTATS 2021
Debiasing a First-order Heuristic for Approximate Bi-level Optimization ICML 2021
Increasing Iterate Averaging for Solving Saddle-Point Problems AAAI 2021
Scalable First-Order Methods for Robust MDPs AAAI 2021
Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements NIPS 2021
Sifting through the noise: Universal first-order methods for stochastic variational inequalities NIPS 2021
Adversarial Regression with Doubly Non-negative Weighting Matrices NIPS 2021