Imagen de Portada

Min-Max Optimization Is Strictly Easier Than Variational Inequalities

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Shugart, Henry, Altschuler, Jason M.
Formato:	Preprint
Publicado:	2025
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)

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

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

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)

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

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

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

Min-Max Connected Multiway Cut
por: Tiwary, Hans Raj, et al.
Publicado: (2026)

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

Min-Max Optimization Requires Exponentially Many Queries
por: Bernasconi, Martino, et al.
Publicado: (2026)

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

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

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)

Optimal Decentralized Smoothed Online Convex Optimization
por: Bhuyan, Neelkamal, 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)

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

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

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

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

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

Solving Dense Linear Systems Faster Than via Preconditioning
por: Dereziński, Michał, et al.
Publicado: (2023)

Exploiting Low-Rank Structure in Max-K-Cut Problems
por: Stevens, Ria, et al.
Publicado: (2026)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
por: Fujiwara, Hiroshi, et al.
Publicado: (2025)

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

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

Discrete and Continuous Difference of Submodular Minimization
por: Orfanides, George, et al.
Publicado: (2025)

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

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

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

Importance Sparsification for Sinkhorn Algorithm
por: Li, Mengyu, et al.
Publicado: (2023)

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)

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

Learning Mixtures of Spherical Gaussians via Fourier Analysis
por: Chakraborty, Somnath, et al.
Publicado: (2020)

Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling
por: Kook, Yunbum, et al.
Publicado: (2023)

Learning-Augmented Algorithms for the Bahncard Problem
por: Zhao, Hailiang, et al.
Publicado: (2024)