Fetching the paper…
Reading the bibliography…
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.
A bound for the error in the normal approximation to the distribution of a sum of dependent random variables
Charles Stein · 1972
Earlier work this paper cites.
Evolutionary algorithms for reinforcement learning
David E Moriarty, Alan C Schultz, and John J Grefenstette · 1999
Earlier work this paper cites.
Stochastic games and applications
Abraham Neyman, Sylvain Sorin, and S Sorin · 2003
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Y. E. Nesterov · 2004
Earlier work this paper cites.
Introduction to derivative-free optimization
Andrew Conn, Katya Scheinberg, and Luis Vicente · 2009
Earlier work this paper cites.
Robust optimization with simulated annealing
Dimitris Bertsimas and Omid Nohadani · 2010
Earlier work this paper cites.
LIBSVM: A library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 2011
Earlier work this paper cites.
Competitive Markov decision processes
Jerzy Filar and Koos Vrieze · 2012
Earlier work this paper cites.
Practical bayesian optimization of machine learning algorithms
Jasper Snoek, Hugo Larochelle, and Ryan P Adams · 2012
Earlier work this paper cites.
Stochastic first- and zeroth-order methods for nonconvex stochastic programming
Saeed Ghadimi and Guanghui Lan · 2013
Earlier work this paper cites.
Derivative-free optimization: a review of algorithms and comparison of software implementations
Luis Rios and Nikolaos Sahinidis · 2013
Earlier work this paper cites.
Intriguing properties of neural networks
Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus · 2013
Earlier work this paper cites.
Generative adversarial nets
Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio · 2014
Earlier work this paper cites.
Stochastic gradient methods for distributionally robust optimization with f-divergences
Hongseok Namkoong and John C Duchi · 2016
Earlier work this paper cites.
Connecting generative adversarial networks and actor-critic methods
David Pfau and Oriol Vinyals · 2016
Earlier work this paper cites.
Stochastic online AUC maximization
Yiming Ying, Longyin Wen, and Siwei Lyu · 2016
Earlier work this paper cites.
Derivative-Free and Blackbox Optimization
Charles Audet and Warren Hare · 2017
Earlier work this paper cites.
Kernel-based methods for bandit convex optimization
Sébastien Bubeck, Yin Tat Lee, and Ronen Eldan · 2017
Earlier work this paper cites.
Zoo: Zeroth order optimization based black-box attacks to deep neural networks without training substitute models
Pin-Yu Chen, Huan Zhang, Yash Sharma, Jinfeng Yi, and Cho-Jui Hsieh · 2017
Earlier work this paper cites.
UCI machine learning repository, 2017
Dheeru Dua and Casey Graff · 2017
Earlier work this paper cites.
Delving into transferable adversarial examples and black-box attacks
Yanpei Liu, Xinyun Chen, Chang Liu, and Dawn Song · 2017
Earlier work this paper cites.
Towards deep learning models resistant to adversarial attacks
Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu · 2017
Earlier work this paper cites.
Random gradient-free minimization of convex functions
Yurii Nesterov and Vladimir Spokoiny · 2017
Earlier work this paper cites.
Evolution strategies as a scalable alternative to reinforcement learning
Tim Salimans, Jonathan Ho, Xi Chen, Szymon Sidor, and Ilya Sutskever · 2017
Cited alongside, same era.
Online reinforcement learning in stochastic games
Chen-Yu Wei, Yi-Te Hong, and Chi-Jen Lu · 2017
Cited alongside, same era.
Max-value entropy search for efficient bayesian optimization
Zi Wang and Stefanie Jegelka · 2017
Cited alongside, same era.
A reductions approach to fair classification
Alekh Agarwal, Alina Beygelzimer, Miroslav Dudik, John Langford, and Hanna Wallach · 2018
Cited alongside, same era.
On the application of Danskin’s theorem to derivative-free minimax optimization
Abdullah Al-Dujaili, Shashank Srikant, Erik Hemberg, and Una-May O’Reilly · 2018
Cited alongside, same era.
Rényi fair inference
Sina Baharlouei, Maher Nouiehed, and Meisam Razaviyayn · 2019
Later among the works it cites.
Finding mixed nash equilibria of generative adversarial networks
Ya-Ping Hsieh, Chen Liu, and Volkan Cevher · 2019
Later among the works it cites.
Songtao Lu, Ioannis Tsaknakis, Mingyi Hong, and Yongxin Chen · 2019
Later among the works it cites.
Solving a class of non-convex min-max games using iterative first order methods
Maher Nouiehed, Maziar Sanjabi, Tianjian Huang, Jason Lee, and Meisam Razaviyayn · 2019
Later among the works it cites.
A bayesian optimization approach to find nash equilibria
Victor Picheny, Mickael Binois, and Abderrahmane Habbal · 2019
Later among the works it cites.
Online and bandit algorithms for nonstationary stochastic saddle-point optimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Raef Bassily, Mikhail Belkin, and Siyuan Ma · 2018
Cited alongside, same era.
Zeroth-order (non)-convex stochastic optimization via conditional gradient and gradient updates
Krishnakumar Balasubramanian and Saeed Ghadimi · 2018
Cited alongside, same era.
Adversarially robust optimization with Gaussian processes
Ilija Bogunovic, Jonathan Scarlett, Stefanie Jegelka, and Volkan Cevher · 2018
Cited alongside, same era.
Training GANs with optimism
Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, and Haoyang Zeng · 2018
Cited alongside, same era.
The limit points of (optimistic) gradient descent in min-max optimization
Constantinos Daskalakis and Ioannis Panageas · 2018
Cited alongside, same era.
SBEED: Convergent reinforcement learning with nonlinear function approximation
Bo Dai, Albert Shaw, Lihong Li, Lin Xiao, Niao He, Zhen Liu, Jianshu Chen, and Le Song · 2018
Cited alongside, same era.
A variational inequality perspective on generative adversarial networks
Gauthier Gidel, Hugo Berard, Gaëtan Vignoud, Pascal Vincent, and Simon Lacoste-Julien · 2018
Cited alongside, same era.
Abhishek Roy, Yifang Chen, Krishnakumar Balasubramanian, and Prasant Mohapatra · 2019
Later among the works it cites.
Efficient algorithms for smooth minimax optimization
Kiran Thekumparampil, Prateek Jain, Praneeth Netrapalli, and Sewoong Oh · 2019
Later among the works it cites.
Fast and faster convergence of SGD for over-parameterized models and an accelerated perceptron
Sharan Vaswani, Francis Bach, and Mark Schmidt · 2019
Later among the works it cites.
Poincaré recurrence, cycles and spurious equilibria in gradient-descent-ascent for non-convex non-concave zero-sum games
Emmanouil-Vasileios Vlatakis-Gkaragkounis, Lampros Flokas, and Georgios Piliouras · 2019
Later among the works it cites.
Painless stochastic gradient: Interpolation, line-search, and convergence rates
Sharan Vaswani, Aaron Mishkin, Issam Laradji, Mark Schmidt, Gauthier Gidel, and Simon Lacoste-Julien · 2019
Later among the works it cites.
Accelerated zeroth-order and first-order momentum methods from mini to minimax optimization
F. Huang, S. Gao, J. Pei, and H. Huang · 2020
Closest in time.
What is local optimality in nonconvex-nonconcave minimax optimization?
Chi Jin, Praneeth Netrapalli, and Michael Jordan · 2020
Closest in time.
On gradient descent ascent for nonconvex-concave minimax problems
Tianyi Lin, Chi Jin, and Michael I Jordan · 2020
Closest in time.
Min-max optimization without gradients: Convergence and applications to adversarial ml
Sijia Liu, Songtao Lu, Xiangyi Chen, Yao Feng, Kaidi Xu, Abdullah Al-Dujaili, Minyi Hong, and Una-May Obelilly · 2020
Closest in time.
Stochastic recursive gradient descent ascent for stochastic nonconvex-strongly-concave minimax problems
Luo Luo, Haishan Ye, Zhichao Huang, and Tong Zhang · 2020
Closest in time.
Fast and furious convergence: Stochastic second order methods under interpolation
Si Yi Meng, Sharan Vaswani, Issam Hadj Laradji, Mark Schmidt, and Simon Lacoste-Julien · 2020
Closest in time.
Escaping saddle-points faster under interpolation-like conditions
Abhishek Roy, Krishnakumar Balasubramanian, Saeed Ghadimi, and Prasant Mohapatra · 2020
Closest in time.
Enhanced first and zeroth order variance reduced algorithms for min-max optimization
Tengyu Xu, Zhe Wang, Yingbin Liang, and H Vincent Poor · 2020
Closest in time.
Direct-search methods for a class of non-convex min-max games
S. Anagnostidis, A. Lucchi, and Y. Diouane · 2021
Closest in time.
Zeroth-order nonconvex stochastic optimization: Handling constraints, high-dimensionality, and saddle-points
Krishnakumar Balasubramanian and Saeed Ghadimi · 2021
Closest in time.
Gradient free minimax optimization: Variance reduction and faster convergence
T. Xu, Z. Zhe Wang, Y. Liang, and H. V. Poor · 2021
Closest in time.
Multi-agent reinforcement learning: A selective overview of theories and algorithms
Kaiqing Zhang, Zhuoran Yang, and Tamer Başar · 2021
Closest in time.