{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,7]],"date-time":"2026-09-07T03:22:10Z","timestamp":1788751330874,"version":"build-2803163510"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10994-020-05931-2","type":"journal-article","created":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T12:02:32Z","timestamp":1609502552000},"page":"533-558","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Coupling matrix manifolds assisted optimization for optimal transport problems"],"prefix":"10.1007","volume":"110","author":[{"given":"Dai","family":"Shi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9803-0256","authenticated-orcid":false,"given":"Junbin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xia","family":"Hong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S. T.","family":"Boris Choy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiyong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,1]]},"reference":[{"key":"5931_CR1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization algorithms on matrix manifolds","author":"PA Absil","year":"2008","unstructured":"Absil, P. A., Mahony, R., & Sepulchre, R. (2008). Optimization algorithms on matrix manifolds. Princeton: Princeton University Press."},{"key":"5931_CR2","unstructured":"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\u20131971), Curran Associates Inc., USA, NIPS\u201917."},{"key":"5931_CR3","doi-asserted-by":"publisher","DOI":"10.1090\/mmono\/191","volume-title":"Methods of informantion geometry","author":"S Amari","year":"2007","unstructured":"Amari, S., & Nagaoka, H. (2007). Methods of informantion geometry. Providence: American Mathematical Society."},{"key":"5931_CR4","unstructured":"Amari, S., & Nagaoka, H. (2000). Methods of Information Geometry (pp. 37\u201340). Oxford University Press, New York, chap Chentsov\u2019s theorem and some historical remarks."},{"key":"5931_CR5","unstructured":"Ambrogioni, L., G\u00fc\u00e7l\u00fc U, G\u00fc\u00e7l\u00fct\u00fcrk, 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\u20132487), Curran Associates Inc., USA, NIPS\u201918."},{"key":"5931_CR6","unstructured":"Arjovsky, M., Chintala, S., & Bottou, L. (2017). Wasserstein GAN. arXiv:1701.07875."},{"key":"5931_CR7","volume-title":"Nonlinear programming","author":"D Bertsekas","year":"1999","unstructured":"Bertsekas, D. (1999). Nonlinear programming. Belmont: Athena Scientific."},{"key":"5931_CR8","unstructured":"Bousquet, O., Gelly, S., Tolstikhin, I., Simon-Gabriel, C. J., & Sch\u00f6lkopf, B. (2017). From optimal transport to generative modeling: The VEGAN cookbook. Tech. rep."},{"issue":"2","key":"5931_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.crma.2017.12.008","volume":"356","author":"H Brezis","year":"2018","unstructured":"Brezis, H. (2018). Remarks on the Monge\u2013Kantorovich problem in the discrete setting. Comptes Rendus Mathematique, 356(2), 207\u2013213.","journal-title":"Comptes Rendus Mathematique"},{"issue":"5","key":"5931_CR10","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/TPAMI.2009.57","volume":"32","author":"L Bruzzone","year":"2010","unstructured":"Bruzzone, L., & Marconcini, M. (2010). Domain adaptation problems: A DASVM classification technique and a circular validation strategy. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(5), 770\u2013787.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"9","key":"5931_CR11","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1109\/TPAMI.2016.2615921","volume":"39","author":"N Courty","year":"2016","unstructured":"Courty, N., Flamary, R., Tuia, D., & Rakotomamonjy, A. (2016). Optimal transport for domain adaptation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 39(9), 1853\u20131865.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5931_CR12","first-page":"2292","volume":"26","author":"M Cuturi","year":"2013","unstructured":"Cuturi, M. (2013). Sinkhorn distances: Lightspeed computation of optimal transport. Advances in Neural Information Processing Systems, 26, 2292\u20132300.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"5931_CR13","unstructured":"Cuturi, M., & Doucet, A. (2014). Fast computation of Wasserstein barycenters. In Xing, E. P., & Jebara, T. (Eds.) Proceedings of the 31st international conference on machine learning (pp. 685\u2013693), Bejing, China, vol\u00a032."},{"key":"5931_CR14","first-page":"37","volume":"625","author":"JA De Loera","year":"2014","unstructured":"De Loera, J. A., & Kim, E. D. (2014). Combinatorics and geometry of transportation polytopes: An update. Discrete Geometry and Algebraic Combinatorics, 625, 37\u201376.","journal-title":"Discrete Geometry and Algebraic Combinatorics"},{"issue":"15","key":"5931_CR15","first-page":"1","volume":"19","author":"A Dessein","year":"2018","unstructured":"Dessein, A., Papadakis, N., & Rouas, J. L. (2018). Regularised optimal transport and the rot mover\u2019s distance. Journal of Machine Learning Research, 19(15), 1\u201353.","journal-title":"Journal of Machine Learning Research"},{"issue":"22","key":"5931_CR16","doi-asserted-by":"publisher","first-page":"5761","DOI":"10.1109\/TSP.2019.2946024","volume":"67","author":"A Douik","year":"2019","unstructured":"Douik, A., & Hassibi, B. (2019). Manifold optimization over the set of doubly stochastic matrices: A second-order geometry. IEEE Transactions on Signal Processing, 67(22), 5761\u20135774.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"5931_CR17","doi-asserted-by":"publisher","first-page":"A1961","DOI":"10.1137\/17M1132665","volume":"40","author":"M Essid","year":"2018","unstructured":"Essid, M., & Solomon, J. (2018). Quadratically regularized optimal transport on graphs. SIAM Journal on Scientific Computing, 40(4), A1961\u2013A1986.","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"3","key":"5931_CR18","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1137\/130929886","volume":"7","author":"S Ferradans","year":"2014","unstructured":"Ferradans, S., Papadakis, N., Peyre, G., & Aujol, J. F. (2014). Regularized discrete optimal transport. SIAM Journal on Imaging Sciences, 7(3), 1853\u20131882.","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"12","key":"5931_CR19","doi-asserted-by":"publisher","first-page":"1923","DOI":"10.1007\/s10994-018-5717-1","volume":"107","author":"R Flamary","year":"2018","unstructured":"Flamary, R., Cuturi, M., Courty, N., & Rakotomamonjy, A. (2018). Wasserstein discriminant analysis. Machine Learning, 107(12), 1923\u20131945.","journal-title":"Machine Learning"},{"key":"5931_CR20","unstructured":"Frogner, C., Zhang, C., Mobahi, H., Araya-Polo, M., & Poggio, T. A. (2015). Learning with a Wasserstein loss. In Advances in neural information processing systems (NIPS), vol\u00a028."},{"issue":"2","key":"5931_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF00934767","volume":"37","author":"D Gabay","year":"1982","unstructured":"Gabay, D. (1982). Minimizing a differentiable function over a differential manifold. Journal of Optimization Theory and Applications, 37(2), 177\u2013219.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"5931_CR22","unstructured":"Genevay, A., Cuturi, M., Peyr\u00e9, G., & Bach, F. (2016). Stochastic optimization for large-scale optimal transport. In Lee, D.D., Sugiyama, M., Luxburg, U.V., Guyon, I., Garnett, R. (Eds.) Advances in neural information processing systems 29 (pp. 3440\u20133448). Curran Associates, Inc."},{"key":"5931_CR23","unstructured":"Germain, P., Habrard, A., Laviolette, F., & Morvant, E. (2013). APAC-Bayesian approach for domain adaptation with specialization to linear classifiers. In Proceedings of international conference on machine learning (ICML) (pp. 738\u2013746). Atlanta, USA."},{"key":"5931_CR24","unstructured":"Gulrajani, I., Ahmed, F., Arjovsky, M., Dumoulin, V., & Courville, A. (2017). Improved training of Wasserstein gans. In Proceedings of the 31st international conference on neural information processing systems (pp. 5769\u20135779). Curran Associates Inc., Red Hook, NY, USA, NIPS\u201917."},{"issue":"3","key":"5931_CR25","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/B:VISI.0000036836.66311.97","volume":"60","author":"S Haker","year":"2004","unstructured":"Haker, S., Zhu, L., Tannenbaum, A., & Angenent, S. (2004). Optimal mass transport for registration and warping. International Journal of Computer Vision, 60(3), 225\u2013240.","journal-title":"International Journal of Computer Vision"},{"key":"5931_CR26","doi-asserted-by":"publisher","unstructured":"Hong, X., & Gao, J. (2015). Sparse density estimation on multinomial manifold combining local component analysis. In Proceedings of international joint conference on neural networks (IJCNN) (pp. 1\u20137). https:\/\/doi.org\/10.1109\/IJCNN.2015.7280301.","DOI":"10.1109\/IJCNN.2015.7280301"},{"key":"5931_CR27","doi-asserted-by":"publisher","unstructured":"Hong, X., & Gao, J. (2018). Estimating the square root of probability density function on Riemannian manifold. Expert Systems (in press) https:\/\/doi.org\/10.1111\/exsy.12266.","DOI":"10.1111\/exsy.12266"},{"key":"5931_CR28","doi-asserted-by":"publisher","first-page":"2972","DOI":"10.1109\/TNNLS.2015.2389273","volume":"26","author":"X Hong","year":"2015","unstructured":"Hong, X., Gao, J., Chen, S., & Zia, T. (2015). Sparse density estimation on the multinomial manifold. IEEE Transactions on Neural Networks and Learning Systems, 26, 2972\u20132977.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"5931_CR29","doi-asserted-by":"crossref","unstructured":"Jacobs, M., & L\u00e8ger, F. (2020). A fast approach to optimal transport: The back-and-forth method. arXiv:190512154 2.","DOI":"10.1007\/s00211-020-01154-8"},{"key":"5931_CR30","first-page":"199","volume":"37","author":"LV Kantorovich","year":"1942","unstructured":"Kantorovich, L. V. (1942). On the translocation of masses. Doklady Akademii Nauk SSSR (NS), 37, 199\u2013201.","journal-title":"Doklady Akademii Nauk SSSR (NS)"},{"issue":"1","key":"5931_CR31","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1137\/060659624","volume":"30","author":"PA Knight","year":"2008","unstructured":"Knight, P. A. (2008). The Sinkhorn\u2013Knopp algorithm: Convergence and applications. SIAM Journal on Matrix Analysis and Applications, 30(1), 261\u2013275.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"5931_CR32","unstructured":"Kolouri, S., Pope, P. E., Martin, C. E., & Rohde, G. K. (2019) Sliced Wasserstein auto-encoders. In Proceedings of international conference on learning representation (ICLR)."},{"key":"5931_CR33","doi-asserted-by":"publisher","unstructured":"Lee, Y. T., & Sidford, A. (2014). Path finding methods for linear programming: Solving linear programs in o(vrank) iterations and faster algorithms for maximum flow. In Proceedings of IEEE 55th annual symposium on foundations of computer science (pp. 424\u2013433). https:\/\/doi.org\/10.1109\/FOCS.2014.52.","DOI":"10.1109\/FOCS.2014.52"},{"key":"5931_CR34","doi-asserted-by":"crossref","unstructured":"Maman, G., Yair, O., Eytan, D., & Talmon, R. (2019). Domain adaptation using Riemannian geometry of SPD matrices. In International conference on acoustics, speech and signal processing (ICASSP) (pp. 4464\u20134468). Brighton, United Kingdom: IEEE.","DOI":"10.1109\/ICASSP.2019.8682989"},{"key":"5931_CR35","unstructured":"Miller, M., & Lent, J. V. (2016). Monge\u2019s optimal transport distance with applications for nearest neighbour image classification. arXiv:1612.00181."},{"key":"5931_CR36","unstructured":"Monge, G. (1781). M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Histoire de l\u2019Acad\u00e9mie Royale des Sciences de Paris."},{"key":"5931_CR37","first-page":"3718","volume":"29","author":"G Montavon","year":"2016","unstructured":"Montavon, G., M\u00fcller, K. R., & Cuturi, M. (2016). Wasserstein training of restricted Boltzmann machines. Advances in Neural In-formation Processing Systems, 29, 3718\u20133726.","journal-title":"Advances in Neural In-formation Processing Systems"},{"key":"5931_CR38","doi-asserted-by":"crossref","unstructured":"Muzellec, B., Nock, R., Patrini, G., & Nielsen, F. (2017). Tsallis regularized optimal transport and ecological inference. In Proceedings of AAAI (pp. 2387\u20132393).","DOI":"10.1609\/aaai.v31i1.10854"},{"key":"5931_CR39","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1146\/annurev-statistics-030718-104938","volume":"6","author":"VM Panaretos","year":"2019","unstructured":"Panaretos, V. M., & Zemel, Y. (2019). Statistical aspects of Wasserstein distances. Annual Review of Statistics and Its Application, 6, 405\u2013431.","journal-title":"Annual Review of Statistics and Its Application"},{"key":"5931_CR40","doi-asserted-by":"crossref","unstructured":"Peyre, G., & Cuturi, M. (2019). Computational optimal transport: With applications to data science. Foundations and Trends in Machine Learning Series, Now Publishers, https:\/\/books.google.com.au\/books?id=J0BiwgEACAAJ.","DOI":"10.1561\/9781680835519"},{"issue":"5\u20136","key":"5931_CR41","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9, G., Cuturi, M., et al. (2019). Computational optimal transport. Foundations and Trends\u00ae in Machine Learning, 11(5\u20136), 355\u2013607.","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"key":"5931_CR42","doi-asserted-by":"crossref","unstructured":"Queyranne, M., & Spieksma, F. (2009). Multi-index transportation problems: Multi-index transportation problems MITP. Encyclopedia of Optimization, pp. 2413\u20132419.","DOI":"10.1007\/978-0-387-74759-0_415"},{"key":"5931_CR43","doi-asserted-by":"crossref","unstructured":"Rabin, J., & Papadakis, N. (2015). Convex color image segmentation with optimal transport distances. In International conference on scale space and variational methods in computer vision. Springer, pp. 256\u2013269.","DOI":"10.1007\/978-3-319-18461-6_21"},{"issue":"2","key":"5931_CR44","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y Rubner","year":"2000","unstructured":"Rubner, Y., Tomasi, C., & Guibas, L. J. (2000). The earth mover\u2019s distance as a metric for image retrieval. International Journal of Computer Vision, 40(2), 99\u2013121.","journal-title":"International Journal of Computer Vision"},{"issue":"3","key":"5931_CR45","doi-asserted-by":"publisher","first-page":"A1443","DOI":"10.1137\/16M1106018","volume":"41","author":"B Schmitzer","year":"2019","unstructured":"Schmitzer, B. (2019). Stabilized sparse scaling algorithms for entropy regularized transport problems. SIAM Journal on Scientic Computing, 41(3), A1443\u2013A1481.","journal-title":"SIAM Journal on Scientic Computing"},{"issue":"4","key":"5931_CR46","doi-asserted-by":"publisher","first-page":"66:1","DOI":"10.1145\/2766963","volume":"34","author":"J Solomon","year":"2015","unstructured":"Solomon, J., de Goes, F., Peyr\u00e9, G., Cuturi, M., Butscher, A., Nguyen, A., et al. (2015). Convolutional Wasserstein distances: Efficient optimal transportation on geometric domains. ACM Transactions on Graphics, 34(4), 66:1\u201366:11.","journal-title":"ACM Transactions on Graphics"},{"key":"5931_CR47","doi-asserted-by":"crossref","unstructured":"Su, B., & Hua, G. (2017). Order-preserving Wasserstein distance for sequence matching. In Proceedings of the IEEE conference on computer vision and pattern recognition (pp. 1049\u20131057).","DOI":"10.1109\/CVPR.2017.310"},{"key":"5931_CR48","unstructured":"Su, B., & Wu, Y. (2019). Learning distance for sequences by learning a ground metric. In Proceedings of the 36th international conference on machine learning (ICML)."},{"key":"5931_CR49","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/TPAMI.2015.2465901","volume":"38","author":"Y Sun","year":"2016","unstructured":"Sun, Y., Gao, J., Hong, X., Mishra, B., & Yin, B. (2016). Heterogeneous tensor decomposition for clustering via manifold optimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 38, 476\u2013489.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5931_CR50","unstructured":"Tolstikhin, I., Bousquet, O., Gelly, S., & Schoelkopf, B. (2018). Wasserstein auto-encoders. In Proceedings of international conference on learning representation."},{"key":"5931_CR51","doi-asserted-by":"crossref","unstructured":"Villani, C. (2009). Optimal transport: Old and new. Berlin: Springer, chap The Wasserstein distances (pp. 93\u2013111).","DOI":"10.1007\/978-3-540-71050-9_6"},{"key":"5931_CR52","doi-asserted-by":"crossref","unstructured":"Yair, O., Dietrich, F., Talmon, R., & Kevrekidis, I.G. (2019). Optimal transport on the manifold of SPD matrices for domain adaptation. arXiv:1906.00616.","DOI":"10.1109\/TSP.2019.2894801"},{"key":"5931_CR53","unstructured":"Zhang, S., Gao, Y., Jiao, Y., Liu, J., Wang, Y., & Yang, C. (2019). Wasserstein-Wasserstein auto-encoders. arXiv:1902.09323."},{"key":"5931_CR54","doi-asserted-by":"crossref","unstructured":"Zhao, P,, & Zhou, Z. H. (2018). Label distribution learning by optimal transport. In Proceedings of the thirty-second AAAI conference on artificial intelligence (AAAI) (pp. 4506\u20134513).","DOI":"10.1609\/aaai.v32i1.11609"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-020-05931-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-020-05931-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-020-05931-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T01:25:19Z","timestamp":1670635519000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-020-05931-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["5931"],"URL":"https:\/\/doi.org\/10.1007\/s10994-020-05931-2","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,1]]},"assertion":[{"value":"26 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}