arXiv Machine Learning August 26, 2026 By Dmitrii M. Ostrovskii, Babak Barazandeh, Meisam Razaviyayn

Nonconvex-Nonconcave Min-Max Optimization with a Small Maximization Domain

Read the original on arXiv Machine Learning →

arXiv:2110. 03950v3 Announce Type: replace-cross Abstract: We study the problem of finding approximate first-order stationary points in optimization problems of the form $\min_{x \in X} \max_{y \in Y} f(x,y)$, where the sets $X,Y$ are convex and $Y$ is compact.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI

Jun 10

On the Condition Number Dependency in Bilevel Optimization

arXiv:2511. 22331v2 Announce Type: replace-cross Abstract: Bilevel optimization minimizes an objective function, defined by an upper-level problem whose feasible region is the solution of a lower-level problem.

By Lesi Chen, Jingzhao Zhang

arXiv Machine Learning

Jul 21

Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach

arXiv:2601. 21243v3 Announce Type: replace-cross Abstract: We consider max-min and min-max problems with objective functions that are possibly non-smooth, submodular with respect to the minimiser and concave with respect to the maximiser.

By Amir Ali Farzin, Yuen-Man Pun, Philipp Braun, Tyler Summers, Iman Shames

arXiv AI

Aug 11

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities

arXiv:2608. 08463v1 Announce Type: cross Abstract: We study second- and higher-order methods for solving smooth monotone variational inequalities (MVI).

By Lesi Chen, Xinliang Zhang, Hengyu Wang, Chengchang Liu, Yongchao Chen, Jingzhao Zhang

arXiv Machine Learning

Jul 13

Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization

arXiv:2405. 00914v4 Announce Type: replace-cross Abstract: We present in this paper novel accelerated fully first-order methods in \emph{Bilevel Optimization} (BLO).

By Chris Junchi Li

benchmarks

arXiv Machine Learning

Aug 10

A proximal subgradient method for nonconvex stochastic optimization under the Kurdyka-{\L}ojasiewicz condition

arXiv:2608. 05460v1 Announce Type: cross Abstract: This work introduces a proximal stochastic subgradient method for minimizing the sum of an expected cost, whose integrand is potentially nonsmooth and nonconvex, and a lower semicontinuous, prox-bounded function.

By Felipe Atenas, Alejandro Jofr\'e, Pedro P\'erez-Aros, David Torregrosa-Bel\'en

arXiv Machine Learning

Jun 15

Online Convex Optimization with Sublinear Noisy Probes

arXiv:2606. 14640v1 Announce Type: new Abstract: We study Online Convex Optimization (OCO) over a convex set $K\subseteq \mathbb R^d$, where in each round $t$ the learner selects $x_t\in K$ and then observes a convex loss $f_t:K\to[0,1]$, with the goal of minimizing regret to the best fixed decision in hindsight.

By Simone Di Gregorio, Anupam Gupta, Stefano Leonardi, Matteo Russo

One email a morning, machine-written

Related stories

On the Condition Number Dependency in Bilevel Optimization

Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities

Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization

A proximal subgradient method for nonconvex stochastic optimization under the Kurdyka-{\L}ojasiewicz condition

Online Convex Optimization with Sublinear Noisy Probes