Fetching the paper…
Reading the bibliography…
We consider distributed convex-concave saddle point problems over arbitrary connected undirected networks and propose a decentralized distributed algorithm for their solution.
On primal and dual approaches for distributed stochastic convex optimization over networks
D. Dvinskikh, E. Gorbunov, A. Gasnikov, P. Dvurechensky, and C. A. Uribe · 1903
Earlier work this paper cites.
Prox-method with rate of convergence o ( 1 / t ) o(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
A. Nemirovski · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: a basic course
Y. Nesterov · 2004
Earlier work this paper cites.
A support vector method for multivariate performance measures
T. Joachims · 2005
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Earlier work this paper cites.
Maximum margin clustering
L. Xu, J. Neufeld, B. Larson, and D. Schuurmans · 2005
Earlier work this paper cites.
Finite-dimensional variational inequalities and complementarity problems
F. Facchinei and J.-S. Pang · 2007
Earlier work this paper cites.
Convex sparse matrix factorizations
F. Bach, J. Mairal, and J. Ponce · 2008
Earlier work this paper cites.
Robust Optimization
A. Ben-Tal, L. E. Ghaoui, and A. Nemirovski · 2009
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
A. Nedic and A. Ozdaglar · 2009
Earlier work this paper cites.
A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
E. Esser, X. Zhang, and T. F. Chan · 2010
Earlier work this paper cites.
Iterative solution of large linear systems
W. Auzinger and J. Melenk · 2011
Earlier work this paper cites.
Optimization with sparsity-inducing penalties
F. Bach, R. Jenatton, J. Mairal, and G. Obozinski · 2011
Earlier work this paper cites.
Lectures on modern convex optimization (2012)
A. Ben-Tal and A. Nemirovski · 2011
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
A. Chambolle and T. Pock · 2011
Earlier work this paper cites.
Parallel and distributed optimization methods for estimation and control in networks
I. Necoara, V. Nedelcu, and I. Dumitrache · 2011
Earlier work this paper cites.
Wasserstein barycenter and its application to texture mixing
J. Rabin, G. Peyré, J. Delon, and M. Bernot · 2011
Earlier work this paper cites.
Theory of convex optimization for machine learning
S. Bubeck · 2014
Earlier work this paper cites.
Fast distributed gradient methods
D. Jakovetić, J. Xavier, and J. M. F. Moura · 2014
Earlier work this paper cites.
Communication complexity of distributed convex learning and optimization
Y. Arjevani and O. Shamir · 2015
Earlier work this paper cites.
Iterative bregman projections for regularized transportation problems
J.-D. Benamou, G. Carlier, M. Cuturi, L. Nenna, and G. Peyré · 2015
Earlier work this paper cites.
Distribution’s template estimate with wasserstein metrics
E. Boissard, T. Le Gouic, and J.-M. Loubes · 2015
Cited alongside, same era.
Fast optimal transport averaging of neuroimaging data
A. Gramfort, G. Peyré, and M. Cuturi · 2015
Cited alongside, same era.
Distributed subgradient methods for saddle-point problems
D. Mateos-Núnez and J. Cortés · 2015
Cited alongside, same era.
Convolutional Wasserstein distances: Efficient optimal transportation on geometric domains
J. Solomon, F. De Goes, G. Peyré, M. Cuturi, A. Butscher, A. Nguyen, T. Du, and L. Guibas · 2015
Cited alongside, same era.
WASP: Scalable Bayes via barycenters of subset posteriors
S. Srivastava, V. Cevher, Q. Dinh, and D. Dunson · 2015
Cited alongside, same era.
On lower iteration complexity bounds for the saddle point problems
J. Zhang, M. Hong, and S. Zhang · 2019
Later among the works it cites.
Local sgd for saddle-point problems
A. Beznosikov, V. Samokhin, and A. Gasnikov · 2020
Later among the works it cites.
A wasserstein-type distance in the space of gaussian mixture models
J. Delon and A. Desolneux · 2020
Later among the works it cites.
Recent theoretical advances in decentralized distributed convex optimization
E. Gorbunov, A. Rogozin, A. Beznosikov, D. Dvinskikh, and A. Gasnikov · 2020
Later among the works it cites.
Efficiently solving mdps with stochastic mirror descent
Y. Jin and A. Sidford · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Gasnikov · 2017
Cited alongside, same era.
Communication-efficient algorithms for decentralized and stochastic optimization
G. Lan, S. Lee, and Y. Zhou · 2017
Cited alongside, same era.
Deep decentralized multi-task multi-agent reinforcement learning under partial observability
S. Omidshafiei, J. Pazis, C. Amato, J. P. How, and J. Vian · 2017
Cited alongside, same era.
Optimal algorithms for smooth and strongly convex distributed optimization in networks
K. Scaman, F. Bach, S. Bubeck, Y. T. Lee, and L. Massoulié · 2017
Cited alongside, same era.
Decentralize and randomize: Faster algorithm for wasserstein barycenters
P. Dvurechenskii, D. Dvinskikh, A. Gasnikov, C. Uribe, and A. Nedich · 2018
Cited alongside, same era.
A variational inequality perspective on generative adversarial networks
G. Gidel, H. Berard, G. Vignoud, P. Vincent, and S. Lacoste-Julien · 2018
Cited alongside, same era.
Optimal algorithms for non-smooth distributed optimization in networks
K. Scaman, F. Bach, S. Bubeck, L. Massoulié, and Y. T. Lee · 2018
Cited alongside, same era.
D. Kovalev, A. Salim, and P. Richtárik · 2020
Later among the works it cites.
First-order and Stochastic Optimization Methods for Machine Learning
G. Lan · 2020
Later among the works it cites.
Communication-efficient algorithms for decentralized and stochastic optimization
G. Lan, S. Lee, and Y. Zhou · 2020
Later among the works it cites.
Fixed-support wasserstein barycenters: Computational hardness and fast algorithm
T. Lin, N. Ho, X. Chen, M. Cuturi, and M. I. Jordan · 2020
Later among the works it cites.
Near-optimal algorithms for minimax optimization
T. Lin, C. Jin, and M. I. Jordan · 2020
Later among the works it cites.
A decentralized algorithm for large scale min-max problems
S. Mukherjee and M. Chakraborty · 2020
Later among the works it cites.
A dual approach for optimal algorithms in distributed optimization over networks
C. A. Uribe, S. Lee, A. Gasnikov, and A. Nedić · 2020
Later among the works it cites.
Distributed saddle-point problems under data similarity
A. Beznosikov, G. Scutari, A. Rogozin, and A. Gasnikov · 2021
Closest in time.
Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems
D. Dvinskikh and A. Gasnikov · 2021
Closest in time.
Improved complexity bounds in wasserstein barycenter problem
D. Dvinskikh and D. Tiapkin · 2021
Closest in time.
On a combination of alternating minimization and nesterov’s momentum
S. Guminov, P. Dvurechensky, N. Tupitsa, and A. Gasnikov · 2021
Closest in time.
Accelerated gradient tracking over time-varying graphs for decentralized optimization
H. Li and Z. Lin · 2021
Closest in time.
Optimal gradient tracking for decentralized optimization
Z. Song, L. Shi, S. Pu, and M. Yan · 2021
Closest in time.
Primal-dual first-order methods for affinely constrained multi-block saddle point problems
J. Zhang, M. Wang, M. Hong, and S. Zhang · 2021
Closest in time.
Optimal algorithms for decentralized stochastic variational inequalities
D. Kovalev, A. Beznosikov, A. Sadiev, M. Persiianov, P. Richtárik, and A. Gasnikov · 2022
Closest in time.