Cover Image

Accelerating Proximal Gradient Descent via Silver Stepsizes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bok, Jinho, Altschuler, Jason M.
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
by: Altschuler, Jason M., et al.
Published: (2023)

Stepsize Hedging: an Alternative Mechanism for Accelerating Gradient Descent
by: Altschuler, Jason M., et al.
Published: (2026)

Negative Stepsizes Make Gradient-Descent-Ascent Converge
by: Shugart, Henry, et al.
Published: (2025)

Optimized methods for composite optimization: a reduction perspective
by: Bok, Jinho, et al.
Published: (2025)

Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule
by: Altschuler, Jason M., et al.
Published: (2024)

Min-Max Optimization Is Strictly Easier Than Variational Inequalities
by: Shugart, Henry, et al.
Published: (2025)

Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm
by: Cai, Xufeng, et al.
Published: (2025)

Negative Momentum for Convex-Concave Optimization
by: Shugart, Henry, et al.
Published: (2026)

Constrained and Composite Sampling via Proximal Sampler
by: Dang, Thanh, et al.
Published: (2026)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
by: Adil, Deeksha, et al.
Published: (2025)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
by: Xie, Fangzhou
Published: (2025)

Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
by: Adil, Deeksha, et al.
Published: (2024)

Accelerated first-order methods for a class of semidefinite programs
by: Wang, Alex L., et al.
Published: (2022)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
by: Chen, Li, et al.
Published: (2025)

Grams: Gradient Descent with Adaptive Momentum Scaling
by: Cao, Yang, et al.
Published: (2024)

Improved Speed via Regional Fulfillment
by: Hathcock, Daniel, et al.
Published: (2026)

Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems
by: Blanchard, Moise
Published: (2024)

Extracting Dual Solutions via Primal Optimizers
by: Carmon, Yair, et al.
Published: (2024)

Radial Isotropic Position via an Implicit Newton's Method
by: Jambulapati, Arun, et al.
Published: (2025)

Near-Optimal Sample Complexity for MDPs via Anchoring
by: Lee, Jongmin, et al.
Published: (2025)

3.415-Approximation for Coflow Scheduling via Iterated Rounding
by: Rohwedder, Lars, et al.
Published: (2025)

Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
by: Ene, Alina, et al.
Published: (2025)

Optimal Micro-Transit Zoning via Clique Generation and Integer Programming
by: Hu, Hins, et al.
Published: (2025)

Resource-Constrained Joint Replenishment via Power-of-$m^{1/k}$ Policies
by: Segev, Danny
Published: (2026)

Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
by: Segev, Danny
Published: (2026)

TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
by: Yamanaka, Toshiaki
Published: (2025)

Acceleration by Stepsize Hedging II: Silver Stepsize Schedule for Smooth Convex Optimization
by: Altschuler, Jason M., et al.
Published: (2023)

Gradient Testing and Estimation by Comparisons
by: Tao, Xiwen, et al.
Published: (2024)

On the complexity of the upgrading version of the maximal covering location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

Gradient-Free Method for Heavily Constrained Nonconvex Optimization
by: Shi, Wanli, et al.
Published: (2024)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
by: Kasperski, Adam, et al.
Published: (2024)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
by: Chen, Yike, et al.
Published: (2024)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
by: Sergeev, Ivan
Published: (2024)

Distributionally Robust Newsvendor on a Metric
by: Foussoul, Ayoub, et al.
Published: (2024)

The Robust Bilevel Selection Problem
by: Henke, Dorothee
Published: (2024)

A rounding and clustering-based exact algorithm for the p-center problem
by: Ales, Zacharie, et al.
Published: (2024)

Convex optimization with $p$-norm oracles
by: Adil, Deeksha, et al.
Published: (2024)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
by: Zhang, Qiao, et al.
Published: (2024)

Fully Subexponential Time Approximation Scheme for Product Partition
by: Costandin, Marius
Published: (2024)