Zeroth-order algorithms for nonconvex–strongly-concave minimax problems with improved complexities

In this paper, we study zeroth-order algorithms for minimax optimization problems that are nonconvex in one variable and strongly-concave in the other variable. Such minimax optimization problems have attracted significant attention lately due to their applications in modern machine learning tasks....

Full description

Saved in:
Bibliographic Details
Published inJournal of global optimization Vol. 87; no. 2-4; pp. 709 - 740
Main Authors Wang, Zhongruo, Balasubramanian, Krishnakumar, Ma, Shiqian, Razaviyayn, Meisam
Format Journal Article
LanguageEnglish
Published New York Springer US 01.11.2023
Springer
Subjects
Online AccessGet full text

Cover

Loading…