28 citations · 131 across the 41 of their papers we have counts for
4 papers · 1 filter
Adaptive Algorithms for Robust Phase Retrieval
Zhong Zheng, Necdet Serhat Aybat, Shiqian Ma +1
This paper considers robust phase retrieval, which can be cast as a nonsmooth and nonconvex optimization problem. We propose two first-order algorithms with adaptive step sizes: th…
AGDA+: Proximal Alternating Gradient Descent Ascent Method with a Nonmonotone Adaptive Step-Size Search for Nonconvex Minimax Problems
Xuan Zhang, Qiushui Xu, Necdet Serhat Aybat
We consider double-regularized nonconvex-strongly concave (NCSC) minimax problems of the form , where , ar…
High-probability complexity guarantees for nonconvex minimax problems
Yassine Laguel, Yasa Syed, Necdet Serhat Aybat +1
Stochastic smooth nonconvex minimax problems are prevalent in machine learning, e.g., GAN training, fair classification, and distributionally robust learning. Stochastic gradient d…
A Stochastic GDA Method With Backtracking For Solving Nonconvex Concave Minimax Problems
Necdet Serhat Aybat, Qiushui Xu, Xuan Zhang +1
We propose a stochastic GDA (gradient descent ascent) method with backtracking (SGDA-B) to solve nonconvex-concave (NCC) minimax problems of the form: $\min_{\mathbf{x}} \max_y \su…