Imagen de Portada

Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Alacaoglu, Ahmet, Kim, Donghwan, Wright, Stephen J.
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Towards Weaker Variance Assumptions for Stochastic Optimization
por: Alacaoglu, Ahmet, et al.
Publicado: (2025)

Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints
por: Huang, Ruichuan, et al.
Publicado: (2025)

Solving Stochastic Variational Inequalities without the Bounded Variance Assumption
por: Alacaoglu, Ahmet, et al.
Publicado: (2026)

Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
por: Vaidyan, Kevin Kurian Thomas, et al.
Publicado: (2026)

Diffusion Stochastic Optimization for Min-Max Problems
por: Cai, Haoyuan, et al.
Publicado: (2024)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
por: Zhang, Jiawei, et al.
Publicado: (2020)

On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation
por: Kwon, Jeongyeol, et al.
Publicado: (2023)

Implicit Riemannian Optimism with Applications to Min-Max Problems
por: Roux, Christophe, et al.
Publicado: (2025)

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
por: Daskalakis, Constantinos, et al.
Publicado: (2018)

Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentum
por: Cai, Haoyuan, et al.
Publicado: (2024)

Equity-Transformer: Solving NP-hard Min-Max Routing Problems as Sequential Generation with Equity Context
por: Son, Jiwoo, et al.
Publicado: (2023)

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

Online Min-Max Optimization: From Individual Regrets to Cumulative Saddle Points
por: Vyas, Abhijeet, et al.
Publicado: (2026)

Two-timescale Extragradient for Finding Local Minimax Points
por: Chae, Jiseok, et al.
Publicado: (2023)

Bilevel Learning with Inexact Stochastic Gradients
por: Salehi, Mohammad Sadegh, et al.
Publicado: (2024)

Stochastic Extragradient with Flip-Flop Shuffling & Anchoring: Provable Improvements
por: Chae, Jiseok, et al.
Publicado: (2024)

Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods
por: Liu, Zijian, et al.
Publicado: (2023)

Beyond the Bellman Fixed Point: Geometry and Fast Policy Identification in Value Iteration
por: Lee, Donghwan
Publicado: (2026)

Decentralized Personalized Federated Learning for Min-Max Problems
por: Borodich, Ekaterina, et al.
Publicado: (2021)

Min-Max Optimisation for Nonconvex-Nonconcave Functions Using a Random Zeroth-Order Extragradient Algorithm
por: Farzin, Amir Ali, et al.
Publicado: (2025)

Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning
por: Ding, Kuangyu, et al.
Publicado: (2023)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
por: Daskalakis, Constantinos, et al.
Publicado: (2018)

Revisiting Frank-Wolfe for Structured Nonconvex Optimization
por: Maskan, Hoomaan, et al.
Publicado: (2025)

Scalable Min-Max Optimization via Primal-Dual Exact Pareto Optimization
por: Park, Sangwoo, et al.
Publicado: (2025)

Semi-infinite Nonconvex Constrained Min-Max Optimization
por: Melcher, Cody, et al.
Publicado: (2025)

An Iteratively Reweighted Method for Sparse Optimization on Nonconvex $\ell_{p}$ Ball
por: Wang, Hao, et al.
Publicado: (2021)

Constrained Stochastic Spectral Preconditioning Converges for Nonconvex Objectives
por: Oikonomidis, Konstantinos, et al.
Publicado: (2026)

Decentralized Stochastic Nonconvex Optimization under the Relaxed Smoothness
por: Luo, Luo, et al.
Publicado: (2025)

An Asynchronous Decentralised Optimisation Algorithm for Nonconvex Problems
por: Mafakheri, Behnam, et al.
Publicado: (2025)

Optimal Rates for Robust Stochastic Convex Optimization
por: Gao, Changyu, et al.
Publicado: (2024)

Zeroth-Order Methods for Stochastic Nonconvex Nonsmooth Composite Optimization
por: Chen, Ziyi, et al.
Publicado: (2025)

Compressed Decentralized Momentum Stochastic Gradient Methods for Nonconvex Optimization
por: Liu, Wei, et al.
Publicado: (2025)

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
por: Chen, Lesi, et al.
Publicado: (2023)

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
por: Lin, Tianyi, et al.
Publicado: (2019)

Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions
por: Hu, Quanqi, et al.
Publicado: (2024)

On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
por: Cao, Jincheng, et al.
Publicado: (2025)

Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis
por: Li, Jiajin, et al.
Publicado: (2022)

Convergence of Decentralized Stochastic Subgradient-based Methods for Nonsmooth Nonconvex functions
por: Zhang, Siyuan, et al.
Publicado: (2024)

Near-Optimal Decentralized Stochastic Nonconvex Optimization with Heavy-Tailed Noise
por: Wang, Menglian, et al.
Publicado: (2026)

An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization
por: Chen, Lesi, et al.
Publicado: (2022)