Fetching the paper…
Reading the bibliography…
In this paper, we study zeroth-order algorithms for nonconvex-concave minimax problems, which have attracted widely attention in machine learning, signal processing and many other fields in recent years.
Nemirovskij A S, Yudin D B. Problem complexity and method efficiency in optimization. 1983
1983
Earlier work this paper cites.
Foschini G, Miljanic Z. A simple distributed autonomous power control algorithm and its convergence. IEEE transactions on vehicular Technology, 1993, 42: 641-646
1993
Earlier work this paper cites.
Nemirovski A. Prox-method with rate of convergence o (1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM Journal on Optimization, 2004, 15: 229-251
2004
Earlier work this paper cites.
Nesterov Y. Dual extrapolation and its applications to solving variational inequalities andrelated problems. Mathematical Programming, 2007, 109: 319-344
2007
Earlier work this paper cites.
Yildiz M E, Scaglione A. Coding with side information for rate-constrained consensus. IEEE Transactions on Signal Processing, 2008, 56(8): 3753-3764
2008
Earlier work this paper cites.
Gohary R H, Huang Y, Luo Z Q, Pang J S. A generalized iterative water-filling algorithm for distributed power control in the presence of a jammer. IEEE Transactions on Signal Processing, 2009, 57: 2660-2674
2009
Earlier work this paper cites.
Bertsimas D, Nohadani O. Robust optimization with simulated annealing. Journal of Global Optimization, 2010, 48(2): 323-334
2010
Earlier work this paper cites.
Mateos G, Bazerque J, Giannakis G. Distributed sparse linear regression. IEEE Transactions on Signal Processing, 2010, 58: 5262-5276
2010
Earlier work this paper cites.
Monteiro R, Svaiter B. Complexity of variants of tseng’s modified fb splitting and korpelevich’s methods for hemivariational inequalities with applications to saddle-point and convex optimization problems. SIAM Journal on Optimization, 2011, 21: 1688-1720
2011
Earlier work this paper cites.
Snoek J, Larochelle H, Adams R. Practical bayesian optimization of machine learning algorithms. NeurIPS, Nevada USA, 2012, 25: 2960-2968
2012
Earlier work this paper cites.
Asteris M, Papailiopoulos D, Dimakis A. Nonnegative sparse PCA with provable guarantees. International Conference on Machine Learning, 2014, 32(2): 1728-1736
2014
Earlier work this paper cites.
Chen Y M, Lan G H, Ouyang Y Y. Optimal primal-dual methods for a class of saddle point problems. SIAM Journal on Optimization, 2014, 24: 1779-1814
2014
Earlier work this paper cites.
Li W C, Chang T H, Chi C Y. Multicell coordinated beamforming with rate outage constraintpart ii: Efficient approximation algorithms. IEEE Transactions on Signal Processing, 2015, 63: 2763-2778
2015
Earlier work this paper cites.
Liao W C, Hong M Y, Farmanbar H, Luo Z Q. Semi-asynchronous routing for large scale hierarchical networks. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2015, 2894-2898
2015
Earlier work this paper cites.
Chambolle A, Pock T. On the ergodic convergence rates of a first-order primal–dual algorithm. Mathematical Programming, 2016, 159: 253-287
2016
Earlier work this paper cites.
Ho J, Ermon S. Generative adversarial imitation learning. NeurIPS, Barcelona Spain, 2016, 29: 4565-4573
2016
Earlier work this paper cites.
Juditsky A, Nemirovski A. Solving variational inequalities with monotone operators on domains given by linear minimization oracles. Mathematical Programming, 2016, 156: 221-256
2016
Earlier work this paper cites.
Lan G H, Monteiro R. Iteration-complexity of first-order augmented Lagrangian methods for convex programming. Mathematical Programming, 2016, 155: 511-547
2016
Earlier work this paper cites.
Chen P Y, Zhang H, Sharma Y, Yi J F, Hsieh C J. Zoo: Zeroth order optimization based black-box attacks to deep neural networks without training substitute models. In Proceedings of the 10th ACM workshop on artificial intelligence and security, Dallas Texas USA, 2017, pp 15-26
2017
Earlier work this paper cites.
Chen Y M, Lan G H, Ouyang Y Y. Accelerated schemes for a class of variational inequalities. Mathematical Programming, 2017, 165: 113-149
2017
Earlier work this paper cites.
Daskalakis C, Ilyas A, Syrgkanis V, Zeng H Y. Training GANs with optimism. ICLR, Vancouver Canada, 2018
2018
Earlier work this paper cites.
Daskalakis C, Panageas I. The limit points of (optimistic) gradient descent in min-max optimization. NeurIPS, Montréal Canada, 2018, 31: 9236-9246
2018
Cited alongside, same era.
Gao X, Jiang B, Zhang S Z. On the information-adaptive variants of the ADMM: an iteration complexity perspective. Journal of Scientific Computing, 2018, 76: 327-363
2018
Cited alongside, same era.
Jagielski M, Oprea A, Biggio B, Liu C, Nita-Rotaru C, Li B. Manipulating machine learning: Poisoning attacks and countermeasures for regression learning. 2018 IEEE Symposium on Security and Privacy (SP), 2018, 19-35
2018
Cited alongside, same era.
Nesterov Y. Lectures on Convex Optimization. Springer, 2018
2018
Cited alongside, same era.
Gidel G, Berard H, Vignoud G, Vincent P, Lacoste-Julien S. A variational inequality perspective on generative adversarial networks. ICLR, New Orleans, 2019
Luo L, Ye H S, Huang Z C, Zhang T. Stochastic recursive gradient descent ascent for stochastic nonconvex-strongly-concave minimax problems. NeurIPS, 2020, 33: 20566-20577
2020
Later among the works it cites.
Menickelly M, Wild S. Derivative-free robust optimization by outer approximations. Mathematical Programming, 2020, 179: 157-193
2020
Later among the works it cites.
Mokhtari A, Ozdaglar A, Pattathil S. A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach. PMLR, 2020, 108: 1497-1507
2020
Later among the works it cites.
2020
Later among the works it cites.
Yang J C, Zhang S Q, Kiyavash N, He N. A catalyst framework for minimax optimization. NeurIPS, 2020, 33: 5667-5678
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
Hajinezhad D, Hong M Y. Perturbed proximal primal–dual algorithm for nonconvex non-smooth optimization. Mathematical Programming, 2019, 176: 207-245
2019
Cited alongside, same era.
Larson J, Menickelly M, Wild S M. Derivative-free optimization methods. Acta Numer, 2019, 28: 287-404
2019
Cited alongside, same era.
Letcher A, Balduzzi D, Racaniere S, Martens J, Foerster J, Tuyls K, Graepel T. Differentiable game mechanics. Journal of Machine Learning Research, 2019, 20(84): 1-40
2019
Cited alongside, same era.
Mertikopoulos P, Zenati H, Lecouat B, Foo C, Chandrasekhar V, Piliouras G. Mirror descent in saddle-point problems: Going the extra (gradient) mile. ICLR, New Orleans, 2019
2019
Cited alongside, same era.
Nouiehed M, Sanjabi M, Huang T J, Lee J D, Razaviyayn M. Solving a class of non-convex min-max games using iterative first order methods. NeurIPS, Vancouver Canada, 2019, 32: 14934-14942
2019
Cited alongside, same era.
Picheny V, Binois M, Habbal A. A bayesian optimization approach to find nash equilibria. Journal of Global Optimization, 2019, 73(1): 171-192
2019
Cited alongside, same era.
Qian Q, Zhu S H, Tang J S, Jin R, Sun B G, Li H. Robust optimization over multiple domains. In Proceedings of the AAAI Conference on Artificial Intelligence, Hawaii USA, 2019, 33: 4739-4746
2019
Cited alongside, same era.
2020
Later among the works it cites.
Zhang J W, Xiao P J, Sun R Y, Luo Z Q. A single-loop smoothed gradient descent-ascent algorithm for nonconvex-concave min-max problems. NeurIPS, 2020, 33: 7377-7389
2020
Later among the works it cites.
Berahas A S, Cao L Y, Choromanski K, Scheinberg K. A theoretical and empirical comparison of gradient approximations in derivative-free optimization. Found Comput Math, Springer, 2021, 1-54
2021
Closest in time.
Finlay C, Oberman A. Scaleable input gradient regularization for adversarial robustness. Machine Learning with Applications, 2021, 3: 100017
2021
Closest in time.
Kong W, Monteiro R D C. An accelerated inexact proximal point method for solving nonconvex-concave min-max problems[J]. SIAM Journal on Optimization, 2021, 31(4): 2558-2585
2021
Closest in time.
Ostrovskii D M, Lowy A, Razaviyayn M. Efficient search of first-order nash equilibria in nonconvex-concave smooth min-max problems[J]. SIAM Journal on Optimization, 2021, 31(4): 2508-2538
2021
Closest in time.
Ouyang Y Y, Xu Y Y. Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems. Mathematical Programming, 2021, 185: 1-35
2021
Closest in time.
Rafique H, Liu M R, Lin Q H, Yang T B. Weakly-convex-concave min-max optimization: provable algorithms and applications in machine learning. Optimization Methods and Software, 2021, 1-35
2021
Closest in time.
Sadiev A, Beznosikov A, Dvurechensky P, et al. Zeroth-order algorithms for smooth saddle-point problems[C]//Mathematical Optimization Theory and Operations Research: Recent Trends: 20th International Conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021, Revised Selected Papers 20. Springer International Publishing, 2021: 71-85
2021
Closest in time.
Zhang S, Yang J, Guzmán C, et al. The complexity of nonconvex-strongly-concave minimax optimization[C]//Uncertainty in Artificial Intelligence. PMLR, 2021: 482-492
2021
Closest in time.
Huang F, Gao S, Pei J, et al. Accelerated Zeroth-Order and First-Order Momentum Methods from Mini to Minimax Optimization[J]. J. Mach. Learn. Res., 2022, 23: 36:1-36:70
2022
Closest in time.
Maheshwari C, Chiu C Y, Mazumdar E, et al. Zeroth-order methods for convex-concave min-max problems: Applications to decision-dependent risk minimization[C]//International Conference on Artificial Intelligence and Statistics. PMLR, 2022: 6702-6734
2022
Closest in time.
Shen J, Wang Z, Xu Z. Zeroth-order single-loop algorithms for nonconvex-linear minimax problems[J]. Journal of Global Optimization, 2022: 1-30. https://doi.org/10.1007/s10898-022-01169-5
2022
Closest in time.
Wang Z, Balasubramanian K, Ma S, et al. Zeroth-order algorithms for nonconvex–strongly-concave minimax problems with improved complexities[J]. Journal of Global Optimization, 2022: 1-32
2022
Closest in time.
Xu Z, Wang Z Q, Wang J L, Dai Y H. Zeroth-Order Alternating Gradient Descent Ascent Algorithms for a Class of Nonconvex-Nonconcave Minimax Problems. Journal of Machine Learning Research, 2023, 24(313):1-25
2023
Closest in time.
Xu Z, Zhang H, Xu Y, Lan G. A unified single-loop alternating gradient projection algorithm for nonconvex–concave and convex–nonconcave minimax problems[J]. Mathematical Programming, 2023, 201:635-706
2023
Closest in time.
Al-Dujaili A, Srikant S, Hemberg E, OReilly U. On the application of danskin’s theorem to derivative-free minimax optimization. AIP Conference Proceedings, 2019, 2070: 020026
2070
Closest in time.