Stochastic optimization for large-scale optimal transport

Advances in Neural Information Processing Systems

Volumn , Issue , 2016, Pages 3440-3448

  Genevay, Aude ^a   Cuturi, Marco ^b   Peyré, Gabriel ^c   Bach, Francis ^d  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b CREST   (France)

^c ECOLE NORMALE SUPÉRIEURE   (France)

^d INRIA Sierra Project Team DI   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; SAMPLING; STOCHASTIC SYSTEMS;

ARBITRARY DISTRIBUTION; DISCRETE DISTRIBUTION; DISCRETIZATION ERRORS; HIGH-DIMENSIONAL LEARNING; REPRODUCING KERNEL HILBERT SPACES; STOCHASTIC GRADIENT DESCENT; STOCHASTIC OPTIMIZATION ALGORITHM; STOCHASTIC OPTIMIZATIONS;

OPTIMIZATION;

EID: 85019185445     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. F. Aurenhammer, F. Hoffmann, and B. Aronov. Minkowski-type theorems and least-squares clustering. Algorithmica, 20(1): 61-76, 1998.
2. F. Bassetti, A. Bodini, and E. Regazzini. On minimum Kantorovich distance estimators. Statistics & Probability Letters, 76(12): 1298-1302, 2006.
3. R. Burkard, M. Dell'Amico, and S. Martello. Assignment Problems. SIAM, 2009.
4. G. Carlier, V. Duval, G. Peyré, and B. Schmitzer. Convergence of entropic schemes for optimal transport and gradient flows. arXiv preprint arXiv: 1512.02783, 2015.
5. R. Cominetti and J. San Martin. Asymptotic analysis of the exponential penalty trajectory in linear programming. Mathematical Programming, 67(1-3): 169-187, 1994.
6. M. Cuturi. Sinkhorn distances: Lightspeed computation of optimal transport. In Adv. in Neural Information Processing Systems, pages 2292-2300, 2013.
7. A. Dieuleveut and F. Bach. Non-parametric stochastic approximation with large step sizes. arXiv preprint arXiv: 1408.0361, 2014.
8. J. Franklin and J. Lorenz. On the scaling of multidimensional matrices. Linear Algebra and its applications, 114: 717-735, 1989.
9. C. Frogner, C. Zhang, H. Mobahi, M. Araya, and T. Poggio. Learning with a Wasserstein loss. In Adv. in Neural Information Processing Systems, pages 2044-2052, 2015.
10. L. Kantorovich. On the transfer of masses (in russian). Doklady Akademii Nauk, 37(2): 227-229, 1942.
11. M. J. Kusner, Y. Sun, N. I. Kolkin, and K. Q. Weinberger. From word embeddings to document distances. In ICML, 2015.
12. Q. Mérigot. A multiscale approach to optimal transport. Comput. Graph. Forum, 30(5): 1583-1592, 2011.
13. G. Montavon, K.-R. Müller, and M. Cuturi. Wasserstein training of restricted Boltzmann machines. In Adv. in Neural Information Processing Systems, 2016.
14. J. Pennington, R. Socher, and C.D. Manning. Glove: Global vectors for word representation. Proc. of the Empirical Methods in Natural Language Processing (EMNLP 2014), 12: 1532-1543, 2014.
15. B. T. Polyak and A. B. Juditsky. Acceleration of stochastic approximation by averaging. SIAM Journal on Control and Optimization, 30(4): 838-855, 1992.
16. A. Rahimi and B. Recht. Random features for large-scale kernel machines. In Adv. in Neural Information Processing Systems, pages 1177-1184, 2007.
17. Y. Rubner, C. Tomasi, and L. J. Guibas. The earth mover's distance as a metric for image retrieval. IJCV, 40(2): 99-121, November 2000.
18. F. Santambrogio. Optimal transport for applied mathematicians. Birkäuser, NY, 2015.
19. M. Schmidt, N. Le Roux, and F. Bach. Minimizing finite sums with the stochastic average gradient. Mathematical Programming, 2016.
20. R. Sinkhorn. A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statist., 35: 876-879, 1964.
21. J. Solomon, F. de Goes, G. Peyré, M. Cuturi, A. Butscher, A. Nguyen, T. Du, and L. Guibas. Convolutional Wasserstein distances: Efficient optimal transportation on geometric domains. ACM Transactions on Graphics (SIGGRAPH), 34(4): 66:1-66:11, 2015.
22. Bharath K Sriperumbudur, Kenji Fukumizu, Arthur Gretton, Bernhard Schölkopf, Gert RG Lanckriet, et al. On the empirical estimation of integral probability metrics. Electronic Journal of Statistics, 6: 1550-1599, 2012.
23. I. Steinwart and A. Christmann. Support vector machines. Springer Science & Business Media, 2008.
24. C. Villani. Topics in Optimal Transportation. Graduate studies in Math. AMS, 2003.
25. G. Wu, E. Chang, Y. K. Chen, and C. Hughes. Incremental approximate matrix factorization for speeding up support vector machines. In Proc. of the 12th ACM SIGKDD Intern. Conf. on Knowledge Discovery and Data Mining, pages 760-766, 2006.