Fetching the paper…
Reading the bibliography…
Much recent research effort has been directed to the development of efficient algorithms for solving minimax problems with theoretical convergence guarantees due to the relevance of these problems to a few emergent applications.
L. Yann, B. Léon, B. Yoshua, and H. Patrick. Gradient-based learning applied to document recognition . Proceedings of the IEEE, 86(11):2278–2324, 1998
1998
Earlier work this paper cites.
Y. Nesterov. Introductory lectures on convex optimization: A basic course . Springer Science & Business Media, 2003
2003
Earlier work this paper cites.
S. Boyd and L. Vandenberghe. Convex optimization . Cambridge university press, 2004
2004
Earlier work this paper cites.
A. Nemirovski. Prox-method with rate of convergence 𝒪 ( 1 / t ) \mathcal{O}(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems . SIAM Journal on Optimization, 15(1):229–-251, 2004
2004
Earlier work this paper cites.
Y. Nesterov. Dual extrapolation and its applications to solving variational inequalities and related problems . Mathematical Programming, 109(2-3):319–-344, 2007
2007
Earlier work this paper cites.
P. Tseng. On accelerated proximal gradient methods for convex-concave optimization . submitted to SIAM Journal on Optimization, 2:3, 2008
2008
Earlier work this paper cites.
Krizhevsky A, Hinton G. Learning multiple layers of features from tiny images[J]. 2009
2009
Earlier work this paper cites.
A. Nedic and A. Ozdaglar. Subgradient methods for saddle-point problems . Journal of Optimization Theory and Applications, 142(1):205–228, 2009
2009
Earlier work this paper cites.
G. Mateos, J. A. Bazerque, and G. B. Giannakis. Distributed sparse linear regression . IEEE Transactions on Signal Processing, 58(10):5262–5276, 2010
2010
Earlier work this paper cites.
R. D. C. Monteiro and B. F. Svaiter. On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean . SIAM Journal on Optimization, 20(6):2755–-2787, 2010
2010
Earlier work this paper cites.
R. D. C. Monteiro and B. F. Svaiter. Complexity of variants of Tseng’s modified F-B splitting and Korpelevich’s methods for hemivariational inequalities with applications to saddle-point and convex optimization problems . SIAM Journal on Optimization, 21(4):1688–-1720, 2011
2011
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G.E. Hinton. Imagenet classification with deep convolutional neural networks . Advances in neural information processing systems, 25:1097–1105, 2012
2012
Earlier work this paper cites.
Y. Nesterov. Gradient methods for minimizing composite functions . Mathematical Programming, 140(1):125–161, 2013
2013
Earlier work this paper cites.
Y. Chen, G. Lan, and Y. Ouyang. Optimal primal-dual methods for a class of saddle point problems . SIAM Journal on Optimization, 24(4):1779–1814, 2014
2014
Earlier work this paper cites.
S. S. Abadeh, P. M. M. Esfahani, and D. Kuhn. Distributionally robust logistic regression . In NeurIPS, pages 1576–1584, 2015
2015
Earlier work this paper cites.
C. D. Dang and G. Lan. Randomized first-Order methods for saddle point optimization . Technical Report, Department of Industrial and Systems Engineering, University of Florida, 2015
2015
Earlier work this paper cites.
C. D. Dang and G. Lan. On the convergence properties of non-Euclidean extragradient methods for variational Inequalities with Generalized Monotone Operators . Computational Optimization and Applications, 60(2):277–310, 2015
2015
Earlier work this paper cites.
W. Liao, M. Hong, H. Farmanbar, and Z.-Q. Luo. Semi-asynchronous routing for large scale hierarchical networks . In Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 2894–2898, 2015
2015
Earlier work this paper cites.
Y. Ouyang, Y. Chen, G. Lan, and E. Pasiliao Jr. An accelerated linearized alternating direction method of multipliers . SIAM Journal on Imaging Sciences, 8(1):644–681, 2015
2015
Cited alongside, same era.
A. Chambolle and T. Pock. On the ergodic convergence rates of a first-order primal-dual algorithm . Mathematical Programming, 159(1-2):253–287, 2016
2016
Cited alongside, same era.
G. B. Giannakis, Q. Ling, G. Mateos, I. D. Schizas, and H. Zhu. Decentralized learning for wireless communications and networking . Splitting Methods in Communication, Imaging, Science, and Engineering, Springer, Cham, pages 461–497, 2016
2016
Cited alongside, same era.
Y. He and R. D. C. Monteiro. An accelerated hpe-type algorithm for a class of composite convex-concave saddle-point problems . SIAM Journal on Optimization, 26(1):29–-56, 2016
2016
Cited alongside, same era.
L. Flokas, E. Vlatakis-Gkaragkounis, and G. Piliouras. Poincaré recurrence, cycles and spurious equilibria in gradient-descent-ascent for non-convex non-concave zero-sum games . Advances in Neural Information Processing Systems, 32:10450–10461, 2019
2019
Later among the works it cites.
G. Gidel, R. A. Hemmat, M. Pezeshki, G. Huang, R. Lepriol, S. Lacoste-Julien, and I. Mitliagkas. Negative momentum for improved game dynamics . The 22nd International Conference on Artificial Intelligence and Statistics, PMLR, pages 1802–1811, 2019
2019
Later among the works it cites.
Y. Hsieh, C. Liu, and V. Cevher. Finding mixed nash equilibria of generative adversarial networks . International Conference on Machine Learning, PMLR, pages 2810–2819, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Ho and S. Ermon. Generative adversarial imitation learning . In Advances in Neural Information Processing Systems, pages 4565–-4573, 2016
2016
Cited alongside, same era.
G. Lan and R. D. C. Monteiro. Iteration-complexity of first-order augmented lagrangian methods for convex programming . Mathematical Programming, 155(1-2):511–-547, 2016
2016
Cited alongside, same era.
Y. Chen, G. Lan, and Y. Ouyang. Accelerated schemes for a class of variational inequalities . Mathematical Programming, 165(1):113–149, 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
M. Heusel, H. Ramsauer, T. Unterthiner, B. Nessler, and S. Hochreiter. Gans trained by a two time-scale update rule converge to a local nash equilibrium . In NeurIPS, pages 6626–-6637, 2017
2017
Cited alongside, same era.
C. Daskalakis and I. Panageas. The limit points of (optimistic) gradient descent in min-max optimization . In Advances in Neural Information Processing Systems, pages 9236–9246, 2018
2018
Cited alongside, same era.
G. Gidel, H. Berard, G. Vignoud, P. Vincent, and S. Lacoste-Julien. A variational inequality perspective on generative adversarial networks . International Conference on Learning Representations, 2018
2018
Cited alongside, same era.
R. Giordano, T. Broderick, and M. I. Jordan. Covariances, robustness, and variational bayes . Journal of Machine Learning Research, 19(51), 2018
2018
Cited alongside, same era.
2019
Later among the works it cites.
A. Letcher, D. Balduzzi, S. Racaniere, J. Martens, J. Foerster, K. Tuyls, and T. Graepel. Differentiable game mechanics . Journal of Machine Learning Research, 20(84):1–-40, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
M. Nouiehed, M. Sanjabi, T. Huang, J.D. Lee. Solving a class of nonconvex min-max games using iterative first order methods . Advances in Neural Information Processing Systems, 32:14934–14942, 2019
2019
Later among the works it cites.
Y. Ouyang and Y. Xu. Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems . Mathematical Programming, doi:10.1007/s10107-019-01420-0, 2019
2019
Later among the works it cites.
Q. Qian, S. Zhu, J. Tang, R. Jin, B. Sun, and H. Li. Robust optimization over multiple domains . Proceedings of the AAAI Conference on Artificial Intelligence, 33(01):4739–4746, 2019
2019
Later among the works it cites.
K. K. Thekumparampil, P. Jain, P. Netrapalli, and S. Oh. Efficient algorithms for smooth minimax optimization . In NeurIPS, pages 12659–-12670, 2019
2019
Later among the works it cites.
J. Bailey, G. Gidel, and G. Piliouras. Finite regret and cycles with fixed step-size via alternating gradient descent-ascent . Proceedings of Thirty Third Conference on Learning Theory, PMLR 125:391–407, 2020
2020
Closest in time.
G. Lan, First-order and stochastic optimization methods for machine learning , Springer-Nature, 2020
2020
Closest in time.
T. Lin, C. Jin and M. Jordan. On gradient descent ascent for nonconvex-concave minimax problems . International Conference on Machine Learning, PMLR, pages 6083–6093, 2020
2020
Closest in time.
T. Lin, C. Jin and M. Jordan. Near-optimal algorithms for minimax optimization . Conference on Learning Theory, PMLR, pages 2738–2779, 2020
2020
Closest in time.
S. Lu, I. Tsaknakis, M. Hong, and Y. Chen. Hybrid block successive approximation for one-sided nonconvex min-max problems: Algorithms and applications . IEEE Transactions on Signal Processing, 68:3676–3691, 2020
2020
Closest in time.
2020
Closest in time.