Fetching the paper…
Reading the bibliography…
We consider the population Wasserstein barycenter problem for random probability measures supported on a finite set of points and generated by an online stream of data.
Kroshnin, A., Tupitsa, N., Dvinskikh, D., Dvurechensky, P., Gasnikov, A., Uribe, C.: On the complexity of approximating Wasserstein barycenters · 1901
Earlier work this paper cites.
Bach, F., Levy, K.Y.: A universal algorithm for variational inequalities adaptive to smoothness and noise · 1902
Earlier work this paper cites.
Optimization Methods and Software (2021)
Stonyakin, F., Tyurin, A., Gasnikov, A., Dvurechensky, P., Agafonov, A., Dvinskikh, D., Alkousa, M., Pasechnyuk, D., Artamonov, S., Piskunova, V.: Inexact model: A framework for optimization and variational inequalities · 1902
Earlier work this paper cites.
Stonyakin, F.S., Dvinskikh, D., Dvurechensky, P., Kroshnin, A., Kuznetsova, O., Agafonov, A., Gasnikov, A., Tyurin, A., Uribe, C.A., Pasechnyuk, D., Artamonov, S.: Gradient methods for problems with inexact model of the objective · 1902
Earlier work this paper cites.
In: 2019 IEEE 58th Conference on Decision and Control (CDC), pp. 7435–7440. IEEE (2019)
Dvinskikh, D., Gorbunov, E., Gasnikov, A., Dvurechensky, P., Uribe, C.A.: On primal and dual approaches for distributed stochastic convex optimization over networks · 1903
Earlier work this paper cites.
Guminov, S., Dvurechensky, P., Tupitsa, N., Gasnikov, A.: On a combination of alternating minimization and Nesterov’s momentum · 1906
Earlier work this paper cites.
Dvinskikh, D., Ogaltsov, A., Gasnikov, A., Dvurechensky, P., Spokoiny, V.: On the line-search gradient methods for stochastic optimization · 1911
Earlier work this paper cites.
J. Wiley & Sons, New York (1983)
Nemirovsky, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization · 1983
Earlier work this paper cites.
Journal of Machine Learning Research 6
Lafferty, J., Lebanon, G.: Diffusion kernels on statistical manifolds · 2005
Earlier work this paper cites.
In: 2018 IEEE Conference on Decision and Control (CDC), pp. 6544–6549 (2018)
Uribe, C.A., Dvinskikh, D., Dvurechensky, P., Gasnikov, A., Nedić, A.: Distributed computation of Wasserstein barycenters over networks · 2006
Earlier work this paper cites.
Springer Science & Business Media (2008)
Steinwart, I., Christmann, A.: Support vector machines · 2008
Earlier work this paper cites.
SIAM Journal on Optimization 19
Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming · 2009
Earlier work this paper cites.
Springer Science & Business Media (2009)
Rockafellar, R.T., Wets, R.J.B.: Variational analysis, vol. 317 · 2009
Earlier work this paper cites.
Some Properties of Gaussian Reproducing Kernel Hilbert Spaces and Their Implications for Function Approximation and Learning Theory 44
Minh, H.Q.: Nonparametric stochastic approximation with large step-sizes · 2010
Earlier work this paper cites.
SIAM Journal on Mathematical Analysis 43
Agueh, M., Carlier, G.: Barycenters in the wasserstein space · 2011
Earlier work this paper cites.
In: C.J.C. Burges, L. Bottou, M. Welling, Z. Ghahramani, K.Q. Weinberger (eds.) Advances in Neural Information Processing Systems 26, pp. 2292–2300. Curran Associates, Inc. (2013)
Cuturi, M.: Sinkhorn distances: Lightspeed computation of optimal transport · 2013
Earlier work this paper cites.
In: E.P. Xing, T. Jebara (eds.) Proceedings of the 31st International Conference on Machine Learning, Proceedings of Machine Learning Research , vol. 32, pp. 685–693. PMLR, Bejing, China (2014)
Cuturi, M., Doucet, A.: Fast computation of wasserstein barycenters · 2014
Earlier work this paper cites.
SIAM Journal on Scientific Computing 37
Benamou, J.D., Carlier, G., Cuturi, M., Nenna, L., Peyré, G.: Iterative bregman projections for regularized transportation problems · 2015
Earlier work this paper cites.
Bernoulli 21
Boissard, E., Le Gouic, T., Loubes, J.M.: Distribution’s template estimate with wasserstein metrics · 2015
Earlier work this paper cites.
Foundations and Trends® in Machine Learning 8
Bubeck, S.: Convex optimization: Algorithms and complexity · 2015
Earlier work this paper cites.
In: Y. Kochetov, M. Khachay, V. Beresnev, E. Nurminski, P. Pardalos (eds.) Discrete Optimization and Operations Research: 9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings, pp. 391–403. Springer International Publishing (2016)
Chernov, A., Dvurechensky, P., Gasnikov, A.: Fast primal-dual gradient method for strongly convex minimization problems with linear constraints · 2016
Cited alongside, same era.
Dvurechensky, P., Gasnikov, A., Gasnikova, E., Matsievsky, S., Rodomanov, A., Usik, I.: Primal-dual method for searching equilibrium in hierarchical congestion population games · 2016
Cited alongside, same era.
In: Advances in neural information processing systems, pp. 3440–3448 (2016)
Genevay, A., Cuturi, M., Peyré, G., Bach, F.: Stochastic optimization for large-scale optimal transport · 2016
Cited alongside, same era.
Computational Mathematics and Mathematical Physics 57
Anikin, A.S., Gasnikov, A.V., Dvurechensky, P.E., Tyurin, A.I., Chernov, A.V.: Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints · 2017
In: J. Abernethy, S. Agarwal (eds.) Proceedings of Thirty Third Conference on Learning Theory, Proceedings of Machine Learning Research , vol. 125, pp. 1276–1304. PMLR (2020)
Chewi, S., Maunu, T., Rigollet, P., Stromme, A.: Gradient descent algorithms for Bures-Wasserstein barycenters · 2020
Closest in time.
SIAM J. Imaging Sci. 13
Delon, J., Desolneux, A.: A wasserstein-type distance in the space of gaussian mixture models · 2020
Closest in time.
Dvinskikh, D.: Stochastic averaging versus sample average approximation for population wasserstein barycenter calculation · 2020
Closest in time.
In: A. Kononov, M. Khachay, V.A. Kalyagin, P. Pardalos (eds.) Mathematical Optimization Theory and Operations Research, pp. 406–423. Springer International Publishing, Cham (2020)
Dvurechensky, P., Gasnikov, A., Omelchenko, S., Tiurin, A.: A stable alternative to Sinkhorn’s algorithm for regularized optimal transport · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
In: D. Precup, Y.W. Teh (eds.) Proceedings of the 34th International Conference on Machine Learning, Proceedings of Machine Learning Research , vol. 70, pp. 3027–3036. PMLR, International Convention Centre, Sydney, Australia (2017)
Scaman, K., Bach, F., Bubeck, S., Lee, Y.T., Massoulié, L.: Optimal algorithms for smooth and strongly convex distributed optimization in networks · 2017
Cited alongside, same era.
In: I. Guyon, U.V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, R. Garnett (eds.) Advances in Neural Information Processing Systems 30, pp. 2647–2658. Curran Associates, Inc. (2017)
Staib, M., Claici, S., Solomon, J.M., Jegelka, S.: Parallel streaming wasserstein barycenters · 2017
Cited alongside, same era.
Bayandina, A., Dvurechensky, P., Gasnikov, A., Stonyakin, F., Titov, A.: Mirror descent and convex optimization problems with non-smooth inequality constraints · 2018
Cited alongside, same era.
In: J. Dy, A. Krause (eds.) Proceedings of the 35th International Conference on Machine Learning, Proceedings of Machine Learning Research , vol. 80, pp. 999–1008. PMLR (2018)
Claici, S., Chien, E., Solomon, J.: Stochastic Wasserstein barycenters · 2018
Cited alongside, same era.
Dvurechensky, P., Dvinskikh, D., Gasnikov, A., Uribe, C.A., Nedić, A.: Decentralize and randomize: Faster algorithm for Wasserstein barycenters · 2018
Cited alongside, same era.
Dvurechensky, P., Gasnikov, A., Kroshnin, A.: Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn’s algorithm · 2018
Cited alongside, same era.
MIT press (2018)
Mohri, M., Rostamizadeh, A., Talwalkar, A.: Foundations of machine learning · 2018
Cited alongside, same era.
Stonyakin, F., Gasnikov, A., Dvurechensky, P., Alkousa, M., Titov, A.: Generalized Mirror Prox for monotone variational inequalities: Universality and inexact oracle · 2018
Cited alongside, same era.
Gorbunov, E., Rogozin, A., Beznosikov, A., Dvinskikh, D., Gasnikov, A.: Recent theoretical advances in decentralized distributed convex optimization · 2020
Closest in time.
arXiv preprint arXiv:2012.06397 (2020)
Heinemann, F., Munk, A., Zemel, Y.: Randomised wasserstein barycenter computation: Resampling with statistical guarantees · 2020
Closest in time.
arXiv preprint arXiv:2005.10675 (2020)
Hendrikx, H., Bach, F., Massoulie, L.: An optimal algorithm for decentralized finite sum optimization · 2020
Closest in time.
In: H.D. III, A. Singh (eds.) Proceedings of the 37th International Conference on Machine Learning, Proceedings of Machine Learning Research , vol. 119, pp. 4203–4227. PMLR (2020)
Hendrikx, H., Xiao, L., Bubeck, S., Bach, F., Massoulie, L.: Statistically preconditioned accelerated gradient method for distributed optimization · 2020
Closest in time.
Krawtschenko, R., Uribe, C.A., Gasnikov, A., Dvurechensky, P.: Distributed optimization with quantization for computing wasserstein barycenters · 2020
Closest in time.
arXiv preprint arXiv:2002.04783 (2020)
Lin, T., Ho, N., Chen, X., Cuturi, M., Jordan, M.I.: Revisiting fixed support wasserstein barycenter: Computational hardness and efficient algorithms · 2020
Closest in time.
Advances in Neural Information Processing Systems 33
Mensch, A., Peyré, G.: Online sinkhorn: Optimal transport distances from sample streams · 2020
Closest in time.
Optimization Methods and Software 0
Nesterov, Y., Gasnikov, A., Guminov, S., Dvurechensky, P.: Primal-dual accelerated gradient methods with small-dimensional relaxation oracle · 2020
Closest in time.
Beznosikov, A., Dvurechensky, P., Koloskova, A., Samokhina, V., Stich, S.U., Gasnikov, A.: Decentralized local stochastic extra-gradient for variational inequalities · 2021
Closest in time.
Dvinskikh, D.: Decentralized algorithms for wasserstein barycenters · 2021
Closest in time.
In: A. Banerjee, K. Fukumizu (eds.) Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research , vol. 130, pp. 1738–1746. PMLR (2021)
Dvinskikh, D., Tiapkin, D.: Improved complexity bounds in wasserstein barycenter problem · 2021
Closest in time.
Dvurechensky, P., Kamzolov, D., Lukashevich, A., Lee, S., Ordentlich, E., Uribe, C.A., Gasnikov, A.: Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization · 2021
Closest in time.
The Annals of Applied Probability 31
Kroshnin, A., Spokoiny, V., Suvorikova, A.: Statistical inference for Bures–Wasserstein barycenters · 2021
Closest in time.
Rogozin, A., Beznosikov, A., Dvinskikh, D., Kovalev, D., Dvurechensky, P., Gasnikov, A.: Decentralized distributed optimization for saddle point problems · 2021
Closest in time.
Rogozin, A., Bochko, M., Dvurechensky, P., Gasnikov, A., Lukoshkin, V.: An accelerated method for decentralized distributed stochastic optimization over time-varying graphs · 2021
Closest in time.