arXiv:2609. 17973v1 Announce Type: cross Abstract: We introduce a new single-loop algorithmic framework for smooth nonconvex--concave minimax optimization.
By Minghao Zhang, Zi Xu
arXiv:2610.07290v1 Announce Type: cross
Abstract: Recent advances in penalty-based methods for stochastic bilevel optimization (SBO) have eliminated the need for second-order derivative oracles. Howe...
By Xingyu Chen, Ming Yang, Quanqi Hu, Tianbao Yang
arXiv:2610. 03222v1 Announce Type: cross Abstract: This paper studies the complexity of convex optimization using lazy second-order oracles (Doikov, Chayti, and Jaggi, ICML 2023), where an algorithm queries gradients every iteration and Hessians once per $m$ iterations.
By Xinliang Zhang, Lesi Chen, Chengchang Liu, Jingzhao Zhang
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:2610.01662v1 Announce Type: cross
Abstract: We establish complexity lower bounds for stochastic first-order algorithms in nonconvex--concave minimax optimization, allowing algorithms to use var...
By Jiayi Song, Zi Xu
In this work, we study the oracle complexity of finding an $ε$-stationary point for nonconvex-strongly-convex (NC-SC) bilevel optimization using only first-order oracles. Existing methods achieving th...