1. Absil, P. A., Mahony, R., & Sepulchre, R. (2008). Optimization algorithms on matrix manifolds. Princeton: Princeton University Press.
2. Altschuler, J., Weed, J., & Rigollet, P. (2017). Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. In Proceedings of the 31st international conference on neural information processing systems (pp. 1961–1971), Curran Associates Inc., USA, NIPS’17.
3. Amari, S., & Nagaoka, H. (2007). Methods of informantion geometry. Providence: American Mathematical Society.
4. Amari, S., & Nagaoka, H. (2000). Methods of Information Geometry (pp. 37–40). Oxford University Press, New York, chap Chentsov’s theorem and some historical remarks.
5. Ambrogioni, L., Güçlü U, Güçlütürk, Y., Hinne, M., Maris, E., & van Gerven, M. A. J. (2018). Wasserstein variational inference. In Proceedings of the 32nd international conference on neural information processing systems (pp. 2478–2487), Curran Associates Inc., USA, NIPS’18.