Fast Algorithms for Computational Optimal Transport and Wasserstein Barycenter
暂无分享,去创建一个
[1] Alexander Gasnikov,et al. Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm , 2018, ICML.
[2] Richard Sinkhorn. Diagonal equivalence to matrices with prescribed row and column sums. II , 1967 .
[3] Jason Altschuler,et al. Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration , 2017, NIPS.
[4] Léon Bottou,et al. Wasserstein Generative Adversarial Networks , 2017, ICML.
[5] Arnaud Doucet,et al. Fast Computation of Wasserstein Barycenters , 2013, ICML.
[6] Martin J. Wainwright,et al. MAP estimation via agreement on trees: message-passing and linear programming , 2005, IEEE Transactions on Information Theory.
[7] Richard Sinkhorn. Diagonal equivalence to matrices with prescribed row and column sums. II , 1967 .
[8] Michael I. Jordan,et al. Probabilistic Multilevel Clustering via Composite Transportation Distance , 2018, AISTATS.
[9] Philip A. Knight,et al. The Sinkhorn-Knopp Algorithm: Convergence and Applications , 2008, SIAM J. Matrix Anal. Appl..
[10] Bahman Kalantari,et al. On the complexity of general matrix scaling and entropy minimization via the RAS algorithm , 2007, Math. Program..
[11] Michael I. Jordan,et al. On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms , 2019, ICML.
[12] Darina Dvinskikh,et al. Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters , 2018, NeurIPS.
[13] Nicolas Courty,et al. Optimal Transport for Domain Adaptation , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[14] Yoshua Bengio,et al. Gradient-based learning applied to document recognition , 1998, Proc. IEEE.
[15] Lei Yang,et al. A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters , 2018, J. Mach. Learn. Res..
[16] Volkan Cevher,et al. WASP: Scalable Bayes via barycenters of subset posteriors , 2015, AISTATS.
[17] Bernhard Schölkopf,et al. Wasserstein Auto-Encoders , 2017, ICLR.
[18] Yin Tat Lee,et al. Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[19] Peter Richtárik,et al. Parallel coordinate descent methods for big data optimization , 2012, Mathematical Programming.
[20] Peter Richtárik,et al. Accelerated, Parallel, and Proximal Coordinate Descent , 2013, SIAM J. Optim..
[21] P. L. Combettes,et al. Primal-Dual Splitting Algorithm for Solving Inclusions with Mixtures of Composite, Lipschitzian, and Parallel-Sum Type Monotone Operators , 2011, Set-Valued and Variational Analysis.
[22] David B. Dunson,et al. Scalable Bayes via Barycenter in Wasserstein Space , 2015, J. Mach. Learn. Res..
[23] P. Rigollet,et al. Uncoupled isotonic regression via minimum Wasserstein deconvolution , 2018, Information and Inference: A Journal of the IMA.
[24] L. Kantorovich. On the Translocation of Masses , 2006 .
[25] Vahab S. Mirrokni,et al. Accelerating Greedy Coordinate Descent Methods , 2018, ICML.
[26] Marco Cuturi,et al. Sinkhorn Distances: Lightspeed Computation of Optimal Transport , 2013, NIPS.
[27] Xin Guo,et al. Sparsemax and Relaxed Wasserstein for Topic Sparsity , 2018, WSDM.
[28] Yurii Nesterov,et al. Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems , 2012, SIAM J. Optim..
[29] X. Nguyen. Convergence of latent mixing measures in finite and infinite mixture models , 2011, 1109.3250.