https://orcid.org/0000-0002-4576-734X
References
- Agueh M, Carlier G. Barycenters in the Wasserstein space. SIAM J Math Anal Appl. 2011;43(2):904–924. doi: 10.1137/100805741
- Alvarez-Esteban PC, del Barrio E, Cuesta-Albertos JA, et al. A fixed point approach to barycenters in Wasserstein spaces. J Math Anal Appl. 2016;441:744–762. doi: 10.1016/j.jmaa.2016.04.045
- Bhatia R, Jain T, Lim Y. On the Bures-Wasserstein distance between positive definite matrices. Expo Math. 2019;37(2):165–191. doi: 10.1016/j.exmath.2018.01.002
- Bhatia R, Jain T, Lim Y. Inequalities for the Wasserstein mean of positive definite matrices. Linear Algebra Appl. 2019;576:108–123. doi: 10.1016/j.laa.2018.03.017
- Hwang J, Kim S. Bounds for the Wasserstein mean with applications to the Lie-Trotter mean. J Math Anal Appl. 2019;475:1744–1753. doi: 10.1016/j.jmaa.2019.03.049
- Hwang J, Kim S. Tensor product and Hadamard product for the Wasserstein means. Linear Algebra Appl. 2020;603:496–507. doi: 10.1016/j.laa.2020.06.032
- Kim S, Lee H. Inequalities of the Wasserstein mean with other matrix means. Ann Func Anal. 2020;11:194–207. doi: 10.1007/s43034-019-00025-0
- Altschuler JM, Boix-Adserà E. Wasserstein barycenters can be computed in polynomial time in fixed dimension. J Mach Learn Res. 2021;22:44–1.
- Cuturi M, Doucet A. Fast computation of Wasserstein barycenters. Proceedings of the 31st International Conference on Machine Learning. 2014;32(2):685–693.
- Elvander F, Haasler I, Jakobsson A, et al. Multimarginal optimal transport using partial information with applications in robust localization and sensor fusion. Signal Process. 2020;171:107474. doi: 10.1016/j.sigpro.2020.107474
- Ho N, Nguyen XL, Yurochkin M, et al. Multilevel clustering via Wasserstein means. Proceedings of the 34th International Conference on Machine Learning. 2017;70:1501–1509.
- Srivastava S, Li C, Dunson DB. Scalable Bayes via barycenter in Wasserstein space. J Mach Learn Res. 2018;19(1):312–346.
- Panaretos VM, Zemel Y. Statistical aspects of Wasserstein distances. Ann Rev Stat Appl. 2019;6:405–431. doi: 10.1146/statistics.2019.6.issue-1
- Peyrè G, Cuturi M. Computational optimal transport. Found Trends Mach Learn. 2017;11(5-6):355–607.
- Moakher M. A differential geometric approach to the geometric mean of symmetric positive-definite matrices. SIAM J Matrix Anal Appl. 2005;26(3):735–747. doi: 10.1137/S0895479803436937
- Bhatia R, Holbrook J. Riemannian geometry and matrix geometric means. Linear Algebra Appl. 2006;413(2–3):594–618. doi: 10.1016/j.laa.2005.08.025
- Lawson J, Lim Y. Karcher means and Karcher equations of positive definite operators. Trans Amer Math Soc Ser B. 2014;1:1–24. doi: 10.1090/btran/2014-01-01
- Choi H, Lim Y. Operator means of lower triangular matrices. J Lie Theory. 2022;32(1):175–190.
- Choi H, Kim S, Lim Y. A binomial expansion formula for weighted geometric means of unipotent matrices. Linear Multilinear Algebra. 2022. doi: 10.1080/03081087.2022.2160425.
- Lim Y. Homogeneous Sylvester equations of lower triangular matrices. Linear Algebra Appl. 2022;653:183–192. doi: 10.1016/j.laa.2022.08.009
- Knott M, Smith C. On the optimal mapping of distributions. J Optim Theory Appl. 1984;43:39–49. doi: 10.1007/BF00934745
- Alvarez-Esteban PC, del Barrio E, Cuesta-Albertos JA, et al. Uniqueness and approximate computation of optimal incomplete transportation plans. Ann Institut Henri Poincaré. 2011;47:358–375.