Imagen de Portada

Negative Momentum for Convex-Concave Optimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Shugart, Henry, Wang, Shuyi, Altschuler, Jason M.
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control Data Structures and Algorithms Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
por: Grigorescu, Elena, et al.
Publicado: (2024)

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

Accelerating Proximal Gradient Descent via Silver Stepsizes
por: Bok, Jinho, et al.
Publicado: (2024)

Convex Optimization with Nested Evolving Feasible Sets
por: M., Karthick Krishna, et al.
Publicado: (2026)

Optimal Decentralized Smoothed Online Convex Optimization
por: Bhuyan, Neelkamal, et al.
Publicado: (2024)

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

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

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

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
por: Grigorescu, Elena, et al.
Publicado: (2024)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
por: Ferreira, Ricardo N., et al.
Publicado: (2025)

Non-Euclidean High-Order Smooth Convex Optimization
por: Contreras, Juan Pablo, et al.
Publicado: (2024)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
por: Jambulapati, Arun, et al.
Publicado: (2024)

Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
por: Shah, Harsh, et al.
Publicado: (2025)

Oracle-based Uniform Sampling from Convex Bodies
por: Dang, Thanh, et al.
Publicado: (2025)

Online Resource Allocation with Convex-set Machine-Learned Advice
por: Golrezaei, Negin, et al.
Publicado: (2023)

Efficient Convex Optimization Requires Superlinear Memory
por: Marsden, Annie, et al.
Publicado: (2022)

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

Multi-LLM Query Optimization
por: Dean, Arlen, et al.
Publicado: (2026)

Distributionally Robust Optimization with Adversarial Data Contamination
por: Li, Shuyao, et al.
Publicado: (2025)

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

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

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
por: Tarzanagh, Davoud Ataee, et al.
Publicado: (2022)

Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective
por: Diakonikolas, Jelena, et al.
Publicado: (2024)

Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
por: Cai, Yang, et al.
Publicado: (2022)

Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach
por: Zhang, Hongyang R., et al.
Publicado: (2023)

Isotropic Noise in Stochastic and Quantum Convex Optimization
por: Marsden, Annie, et al.
Publicado: (2025)

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

Non-Stationary Online Resource Allocation: Learning from a Single Sample
por: Feng, Yiding, et al.
Publicado: (2026)

Infrequent Resolving Algorithm for Online Linear Programming
por: Li, Guokai, et al.
Publicado: (2024)

Truncated Variance Reduced Value Iteration
por: Jin, Yujia, et al.
Publicado: (2024)

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

Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
por: Bhuyan, Neelkamal, et al.
Publicado: (2023)

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

Complexity of Classical Acceleration for $\ell_1$-Regularized PageRank
por: Fountoulakis, Kimon, et al.
Publicado: (2026)

Robust Learning of a Group DRO Neuron
por: Cao, Guyang, et al.
Publicado: (2026)

Online Linear Programming with Replenishment
por: Chen, Yuze, et al.
Publicado: (2026)

Combinatorial Sparse PCA Beyond the Spiked Identity Model
por: Kumar, Syamantak, et al.
Publicado: (2026)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
por: Kim, Jung-hun, et al.
Publicado: (2021)