Gradient Free Minimax Optimization: Variance Reduction and Faster
Convergence

v1v2v3 (latest)

Gradient Free Minimax Optimization: Variance Reduction and Faster Convergence

16 June 2020

H. Vincent Poor

ArXiv (abs)PDF HTML

Papers citing "Gradient Free Minimax Optimization: Variance Reduction and Faster Convergence"

7 / 7 papers shown

Title
PRECISION: Decentralized Constrained Min-Max Learning with Low Communication and Sample Complexities Zhuqing Liu Xin Zhang Songtao Lu Jia-Wei Liu 62 8 0 05 Mar 2023
Decentralized Stochastic Gradient Descent Ascent for Finite-Sum Minimax Problems Hongchang Gao 87 16 0 06 Dec 2022
Zeroth-Order Alternating Gradient Descent Ascent Algorithms for a Class of Nonconvex-Nonconcave Minimax Problems Zi Xu Ziqi Wang Junlin Wang Y. Dai 99 11 0 24 Nov 2022
Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization Le‐Yu Chen Luo Luo 97 8 0 11 Aug 2022
The Complexity of Nonconvex-Strongly-Concave Minimax Optimization Siqi Zhang Junchi Yang Cristóbal Guzmán Negar Kiyavash Niao He 88 62 0 29 Mar 2021
Proximal Gradient Descent-Ascent: Variable Convergence under KŁ Geometry Ziyi Chen Yi Zhou Tengyu Xu Yingbin Liang 115 35 0 09 Feb 2021
Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities Zhongruo Wang Krishnakumar Balasubramanian Shiqian Ma Meisam Razaviyayn 85 28 0 22 Jan 2020