Fetching the paper…
Reading the bibliography…
In this paper, we focus on solving a class of constrained non-convex non-concave saddle point problems in a decentralized manner by a group of nodes in a network.
Aryan Mokhtari, Asuman Ozdaglar, and Sarath Pattathil · 1901
Earlier work this paper cites.
Aryan Mokhtari, Asuman Ozdaglar, and Sarath Pattathil · 1906
Earlier work this paper cites.
Brève communication. régularisation d’inéquations variationnelles par approximations successives
Bernard Martinet · 1970
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
GM Korpelevich · 1976
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R Tyrrell Rockafellar · 1976
Earlier work this paper cites.
Dynamic noncooperative game theory , volume 23
Tamer Basar and Geert Jan Olsder · 1999
Earlier work this paper cites.
Prox-method with rate of convergence o (1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
Arkadi Nemirovski · 2004
Earlier work this paper cites.
Consensus in ad hoc wsns with noisy links–part i: Distributed estimation of deterministic signals
Ioannis D Schizas, Alejandro Ribeiro, and Georgios B Giannakis · 2008
Earlier work this paper cites.
Robust optimization , volume 28
Aharon Ben-Tal, Laurent El Ghaoui, and Arkadi Nemirovski · 2009
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
Angelia Nedic and Asuman Ozdaglar · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Earlier work this paper cites.
On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
Renato DC Monteiro and Benar Fux Svaiter · 2010
Earlier work this paper cites.
Distributed optimization and statistical learning via the alternating direction method of multipliers
Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein · 2011
Earlier work this paper cites.
Dual averaging for distributed optimization: convergence analysis and network scaling
John C Duchi, Alekh Agarwal, and Martin J Wainwright · 2012
Earlier work this paper cites.
Push-sum distributed dual averaging for convex optimization
Konstantinos I Tsianos, Sean Lawlor, and Michael G Rabbat · 2012
Earlier work this paper cites.
Pid design by convex-concave optimization
Martin Hast, KJ Astrom, Bo Bernhardsson, and Stephen Boyd · 2013
Earlier work this paper cites.
Optimal primal-dual methods for a class of saddle point problems
Yunmei Chen, Guanghui Lan, and Yuyuan Ouyang · 2014
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
Cited alongside, same era.
Fast distributed gradient methods
Dusan Jakovetic, Joao Xavier, and José MF Moura · 2014
Cited alongside, same era.
On the linear convergence of the admm in decentralized consensus optimization
Wei Shi, Qing Ling, Kun Yuan, Gang Wu, and Wotao Yin · 2014
Cited alongside, same era.
Multi-agent distributed optimization via inexact consensus admm
Ting-Hau Chang, Mingyi Hong, and Xiongfei Wang · 2015
Cited alongside, same era.
On the convergence properties of non-euclidean extragradient methods for variational inequalities with generalized monotone operators
Cong D Dang and Guanghui Lan · 2015
Cited alongside, same era.
A saddle point algorithm for networked online convex optimization
The limit points of (optimistic) gradient descent in min-max optimization
Constantinos Daskalakis and Ioannis Panageas · 2018
Later among the works it cites.
A variational inequality perspective on generative adversarial networks
Gauthier Gidel, Hugo Berard, Gaëtan Vignoud, Pascal Vincent, and Simon Lacoste-Julien · 2018
Later among the works it cites.
Mingyi Hong, Jason D Lee, and Meisam Razaviyayn · 2018
Later among the works it cites.
Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks
Tengyuan Liang and James Stokes · 2018
Later among the works it cites.
Solving weakly-convex-weakly-concave saddle-point problems as weakly-monotone variational inequality
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Alec Koppel, Felicia Y Jakubiec, and Alejandro Ribeiro · 2015
Cited alongside, same era.
Distributed subgradient methods for saddle-point problems
David Mateos-Núnez and Jorge Cortés · 2015
Cited alongside, same era.
Dsa: Decentralized double stochastic averaging gradient algorithm
Aryan Mokhtari and Alejandro Ribeiro · 2016
Cited alongside, same era.
Stochastic variance reduction methods for saddle-point problems
Balamurugan Palaniappan and Francis Bach · 2016
Cited alongside, same era.
On the convergence of decentralized gradient descent
Kun Yuan, Qing Ling, and Wotao Yin · 2016
Cited alongside, same era.
Prox-pda: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks
Mingyi Hong, Davood Hajinezhad, and Ming-Min Zhao · 2017
Cited alongside, same era.
Towards deep learning models resistant to adversarial attacks
Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu · 2017
Cited alongside, same era.
Qihang Lin, Mingrui Liu, Hassan Rafique, and Tianbao Yang · 2018
Later among the works it cites.
Non-convex min-max optimization: Provable algorithms and applications in machine learning
Hassan Rafique, Mingrui Liu, Qihang Lin, and Tianbao Yang · 2018
Later among the works it cites.
Maziar Sanjabi, Meisam Razaviyayn, and Jason D Lee · 2018
Later among the works it cites.
Optimal algorithms for non-smooth distributed optimization in networks
Kevin Scaman, Francis Bach, Sébastien Bubeck, Laurent Massoulié, and Yin Tat Lee · 2018
Later among the works it cites.
Distributed nonconvex constrained optimization over time-varying digraphs
Gesualdo Scutari and Ying Sun · 2018
Later among the works it cites.
Towards more efficient stochastic decentralized learning: Faster convergence and sparse communication
Zebang Shen, Aryan Mokhtari, Tengfei Zhou, Peilin Zhao, and Hui Qian · 2018
Later among the works it cites.
Haoran Sun and Mingyi Hong · 2018
Later among the works it cites.
A dual approach for optimal algorithms in distributed optimization over networks
César A Uribe, Soomin Lee, Alexander Gasnikov, and Angelia Nedić · 2018
Later among the works it cites.
Multi-agent reinforcement learning via double averaging primal-dual optimization
Hoi-To Wai, Zhuoran Yang, Princeton Zhaoran Wang, and Mingyi Hong · 2018
Later among the works it cites.
On nonconvex decentralized gradient descent
Jinshan Zeng and Wotao Yin · 2018
Later among the works it cites.
Minmax optimization: Stable limit points of gradient descent ascent are locally optimal, 2019
Chi Jin, Praneeth Netrapalli, and Michael I. Jordan · 2019
Closest in time.
Songtao Lu, Ioannis Tsaknakis, Mingyi Hong, and Yongxin Chen · 2019
Closest in time.
Solving a class of non-convex min-max games using iterative first order methods
Maher Nouiehed, Maziar Sanjabi, Jason D Lee, and Meisam Razaviyayn · 2019
Closest in time.