Image de couverture de livre

Online Min-Max Optimization: From Individual Regrets to Cumulative Saddle Points

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Vyas, Abhijeet, Bullins, Brian
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Federated Composite Saddle Point Optimization
par: Bai, Site, et autres
Publié: (2023)

Beyond First-Order Methods for $\ell_p$-Structured Non-Monotone Variational Inequalities
par: Vyas, Abhijeet, et autres
Publié: (2026)

Mirror-Free Proximal Methods
par: Vyas, Abhijeet, et autres
Publié: (2026)

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
par: Daskalakis, Constantinos, et autres
Publié: (2018)

Proximal Point Method for Online Saddle Point Problem
par: Meng, Qing-xin, et autres
Publié: (2024)

Diffusion Stochastic Optimization for Min-Max Problems
par: Cai, Haoyuan, et autres
Publié: (2024)

Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity
par: Bai, Cedar Site, et autres
Publié: (2024)

Faster Acceleration for Steepest Descent
par: Bai, Cedar Site, et autres
Publié: (2024)

Quantization Avoids Saddle Points in Distributed Optimization
par: Bo, Yanan, et autres
Publié: (2024)

Scalable Min-Max Optimization via Primal-Dual Exact Pareto Optimization
par: Park, Sangwoo, et autres
Publié: (2025)

Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentum
par: Cai, Haoyuan, et autres
Publié: (2024)

Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity
par: Alacaoglu, Ahmet, et autres
Publié: (2024)

Simultaneous Learning and Optimization via Misspecified Saddle Point Problems
par: Ahmadi, Mohammad Mahdi, et autres
Publié: (2025)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
par: Hua, Youqing, et autres
Publié: (2024)

Implicit Riemannian Optimism with Applications to Min-Max Problems
par: Roux, Christophe, et autres
Publié: (2025)

Small Gradient Norm Regret for Online Convex Optimization
par: Gao, Wenzhi, et autres
Publié: (2026)

Inertial Newton Algorithms Avoiding Strict Saddle Points
par: Castera, Camille
Publié: (2021)

Efficiently Escaping Saddle Points for Policy Optimization
par: Khorasani, Sadegh, et autres
Publié: (2023)

From Saddle Points Toward Global Minima: A Newton-Type Method on Wasserstein Space
par: Lascu, Razvan-Andrei, et autres
Publié: (2026)

Min-Max Optimization Is Strictly Easier Than Variational Inequalities
par: Shugart, Henry, et autres
Publié: (2025)

Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
par: Zhao, Peng, et autres
Publié: (2025)

A Gauss-Newton Approach for Min-Max Optimization in Generative Adversarial Networks
par: Mishra, Neel, et autres
Publié: (2024)

Second-Order Min-Max Optimization with Lazy Hessians
par: Chen, Lesi, et autres
Publié: (2024)

Robust Min-Max (Regret) Optimization using Ordered Weighted Averaging
par: Baak, Werner, et autres
Publié: (2023)

Bilevel Optimization over Saddle Points of Zero-Sum Markov Games
par: Zheng, Zihao, et autres
Publié: (2026)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
par: Jia, Tingkai, et autres
Publié: (2026)

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
par: Liu, Zijian
Publié: (2025)

On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
par: Kovalev, Dmitry, et autres
Publié: (2024)

Hessian-guided Perturbed Wasserstein Gradient Flows for Escaping Saddle Points
par: Yamamoto, Naoya, et autres
Publié: (2025)

Regret Analysis of Policy Optimization over Submanifolds for Linearly Constrained Online LQG
par: Chang, Ting-Jui, et autres
Publié: (2024)

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
par: Sahinoglu, Emre, et autres
Publié: (2025)

Exploring New Frontiers in Vertical Federated Learning: the Role of Saddle Point Reformulation
par: Beznosikov, Aleksandr, et autres
Publié: (2026)

Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
par: Cai, Yang, et autres
Publié: (2022)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
par: Zhang, Jiawei, et autres
Publié: (2020)

Equity-Transformer: Solving NP-hard Min-Max Routing Problems as Sequential Generation with Equity Context
par: Son, Jiwoo, et autres
Publié: (2023)

Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity
par: Cao, Daniel Yiming, et autres
Publié: (2025)

Enhancing Stability of Physics-Informed Neural Network Training Through Saddle-Point Reformulation
par: Bylinkin, Dmitry, et autres
Publié: (2025)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
par: Huang, Minhui, et autres
Publié: (2021)

Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach
par: Farzin, Amir Ali, et autres
Publié: (2026)

Min-Max Grassmannian Optimization for Online Subspace Tracking
par: Bharadwaj, Shreyas, et autres
Publié: (2026)