A Line-search-free Method for Adaptive Decentralized Optimization
math.OC
Submitted: 2026-05-01
Updated: 2026-11-16
Terminology
Sources
- On the convergence of decentralized gradient descent with diminishing stepsize, revisited
- Adaptive Gradient Descent without Descent
- Adam: A Method for Stochastic Optimization
- On the Convergence of Adam and Beyond
- A Parameter-free Decentralized Algorithm for Composite Convex Optimization
- A distributed proximal splitting method with linesearch for locally Lipschitz gradients
- Towards Parameter-free Distributed Optimization: a Port-Hamiltonian Approach
- Adaptive Polyak Stepsize with Level-value Adjustment for Distributed Optimization
- Problem-Parameter-Free Decentralized Nonconvex Stochastic Optimization
- Adaptive Stepsize Selection in Decentralized Convex Optimization
- Adaptive Decentralized Composite Optimization via Three-Operator Splitting
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise