Information Geometry for Regularized Optimal Transport and Barycenters of Patterns
暂无分享,去创建一个
Shun-ichi Amari | Ryo Karakida | Masafumi Oizumi | Marco Cuturi | S. Amari | Marco Cuturi | Ryo Karakida | Masafumi Oizumi
[1] Gabriel Peyré,et al. Iterative Bregman Projections for Regularized Transportation Problems , 2014, SIAM J. Sci. Comput..
[2] Gabriel Peyré,et al. Learning Generative Models with Sinkhorn Divergences , 2017, AISTATS.
[3] Hossein Mobahi,et al. Learning with a Wasserstein Loss , 2015, NIPS.
[4] C. Villani. Topics in Optimal Transportation , 2003 .
[5] Han Zhang,et al. Improving GANs Using Optimal Transport , 2018, ICLR.
[6] Nicolas Courty,et al. Optimal Transport for Domain Adaptation , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[7] Gabriel Peyré,et al. Fast Dictionary Learning with a Smoothed Wasserstein Loss , 2016, AISTATS.
[8] Gabriel Peyré,et al. A Smoothed Dual Approach for Variational Wasserstein Problems , 2015, SIAM J. Imaging Sci..
[9] Richard Sinkhorn. A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices , 1964 .
[10] Arnaud Doucet,et al. Fast Computation of Wasserstein Barycenters , 2013, ICML.
[11] Guillaume Carlier,et al. Barycenters in the Wasserstein Space , 2011, SIAM J. Math. Anal..
[12] Marco Cuturi,et al. Sinkhorn Distances: Lightspeed Computation of Optimal Transport , 2013, NIPS.
[13] Frank Nielsen,et al. Tsallis Regularized Optimal Transport and Ecological Inference , 2016, AAAI.
[14] Shun-ichi Amari,et al. Information geometry connecting Wasserstein distance and Kullback–Leibler divergence via the entropy-relaxed transportation problem , 2017, Information Geometry.
[15] Shun-ichi Amari,et al. Information Geometry and Its Applications , 2016 .