1. Altschuler, J., Niles-Weed, J., Rigollet, P.: Near-linear Time Approximation Algorithms for Optimal Transport via Sinkhorn Iteration. Advances in Neural Information Processing Systems, vol. 30 (2017)
2. Amari, S.-I.: Differential-Geometrical Methods in Statistics, vol. 28. Springer Science & Business Media, Berlin (2012)
3. Amari, S.-I., Karakida, R., Oizumi, M.: Information geometry connecting Wasserstein distance and Kullback–Leibler divergence via the entropy-relaxed transportation problem. Inf. Geom. 1(1), 13–37 (2018)
4. Amari, S.-I., Nagaoka, H.: Methods of Information Geometry, vol. 191. American Mathematical Society, Providence (2000)
5. Ambrosio, L., Gigli, N.: A user’s guide to optimal transport. In: Modelling and Optimisation of Flows on Networks, pp. 1–155. Springer (2013)