{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T01:21:30Z","timestamp":1783473690840,"version":"3.55.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T00:00:00Z","timestamp":1627257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T00:00:00Z","timestamp":1627257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010115","name":"R\u00e9gion Auvergne-Rh\u00f4ne-Alpes","doi-asserted-by":"publisher","award":["17 011047 01"],"award-info":[{"award-number":["17 011047 01"]}],"id":[{"id":"10.13039\/501100010115","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10994-021-06035-1","type":"journal-article","created":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T20:03:28Z","timestamp":1627329808000},"page":"2151-2186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Sampled Gromov Wasserstein"],"prefix":"10.1007","volume":"110","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9209-3096","authenticated-orcid":false,"given":"Tanguy","family":"Kerdoncuff","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R\u00e9mi","family":"Emonet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Sebban","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,7,26]]},"reference":[{"key":"6035_CR1","unstructured":"Arjovsky, M., Chintala, S., & Bottou, L. (2017). Wasserstein generative adversarial networks. In Proceedings of the 34th international conference on machine learning (Vol. 70, pp. 214\u2013223)."},{"key":"6035_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"M Beckman","year":"1957","unstructured":"Beckman, M., & Koopmans, T. (1957). Assignment problems and the location of economic activities. Econometrica, 25, 53\u201376.","journal-title":"Econometrica"},{"key":"6035_CR3","unstructured":"Blondel, M., Seguy, V., & Rolet, A. (2018). Smooth and sparse optimal transport. In International conference on artificial intelligence and statistics (pp. 880\u2013889), PMLR."},{"key":"6035_CR4","doi-asserted-by":"crossref","unstructured":"Bonneel, N., Van De\u00a0Panne, M., Paris, S., & Heidrich, W. (2011). Displacement interpolation using lagrangian mass transport. In Proceedings of the 2011 SIGGRAPH Asia conference (pp. 1\u201312).","DOI":"10.1145\/2070781.2024192"},{"key":"6035_CR5","doi-asserted-by":"crossref","unstructured":"Brandes, U., Gaertler, M., & Wagner, D. (2003). Experiments on graph clustering algorithms. In European symposium on algorithms (pp. 568\u2013579), Springer.","DOI":"10.1007\/978-3-540-39658-1_52"},{"issue":"2\u20133","key":"6035_CR6","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/s11263-009-0301-6","volume":"89","author":"AM Bronstein","year":"2010","unstructured":"Bronstein, A. M., Bronstein, M. M., Kimmel, R., Mahmoudi, M., & Sapiro, G. (2010). A gromov-hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching. International Journal of Computer Vision, 89(2\u20133), 266\u2013286.","journal-title":"International Journal of Computer Vision"},{"key":"6035_CR7","unstructured":"Bunne, C., Alvarez-Melis, D., Krause, A., & Jegelka, S. (2019). Learning generative models across incomparable spaces. In International conference on machine learning (pp. 851\u2013861)."},{"issue":"6","key":"6035_CR8","doi-asserted-by":"publisher","first-page":"064001","DOI":"10.1088\/1751-8121\/ab4a34","volume":"53","author":"S Caracciolo","year":"2020","unstructured":"Caracciolo, S., D\u2019Achille, M. P., Erba, V., & Sportiello, A. (2020). The dyck bound in the concave 1-dimensional random assignment model. Journal of Physics A Mathematical and Theoretical 53(6), 064001.","journal-title":"Journal of Physics A Mathematical and Theoretical"},{"issue":"4","key":"6035_CR9","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1093\/imaiai\/iaz026","volume":"8","author":"S Chowdhury","year":"2019","unstructured":"Chowdhury, S., & M\u00e9moli, F. (2019). The gromov-wasserstein distance between networks and stable network invariants. Information and Inference: A Journal of the IMA 8(4), 757\u2013787.","journal-title":"Information and Inference: A Journal of the IMA"},{"key":"6035_CR10","doi-asserted-by":"crossref","unstructured":"Courty, N., Flamary, R., & Tuia, D. (2014). Domain adaptation with regularized optimal transport. In Joint European conference on machine learning and knowledge discovery in databases (pp. 274\u2013289), Springer.","DOI":"10.1007\/978-3-662-44848-9_18"},{"key":"6035_CR11","unstructured":"Cuturi, M. (2013). Sinkhorn distances: Lightspeed computation of optimal transport. In Advances in neural information processing systems (pp. 2292\u20132300)."},{"key":"6035_CR12","unstructured":"Cuturi, M., Teboul, O., & Vert, J. P. (2019). Differentiable ranking and sorting using optimal transport. In Advances in neural information processing systems (pp. 6861\u20136871)."},{"issue":"2","key":"6035_CR13","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1137\/110823304","volume":"26","author":"J Delon","year":"2012","unstructured":"Delon, J., Salomon, J., & Sobolevski, A. (2012). Local matching indicators for transport problems with concave costs. SIAM Journal on Discrete Mathematics 26(2), 801\u2013827.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"6035_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/cgf.13244","volume":"36","author":"D Ezuz","year":"2017","unstructured":"Ezuz, D., Solomon, J., Kim, V. G., & Ben-Chen, M. (2017). Gwcnn: A metric alignment layer for deep shape analysis. Computer Graphics Forum 36, 49\u201357.","journal-title":"Computer Graphics Forum"},{"issue":"1\u20132","key":"6035_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P., et al. (1956). An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3(1\u20132), 95\u2013110.","journal-title":"Naval Research Logistics Quarterly"},{"key":"6035_CR16","unstructured":"Gelfand, N., Mitra, N. J., Guibas, L.J., & Pottmann, H. (2005). Robust global registration. In Symposium on geometry processing (Vol.\u00a02, pp.\u00a05), Vienna, Austria."},{"key":"6035_CR17","unstructured":"Genevay, A., Chizat, L., Bach, F., Cuturi, M., & Peyr\u00e9, G. (2019). Sample complexity of sinkhorn divergences. In The 22nd international conference on artificial intelligence and statistics (pp. 1574\u20131583)."},{"issue":"2","key":"6035_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland, P. W., Laskey, K. B., & Leinhardt, S. (1983). Stochastic blockmodels: First steps. Social Networks, 5(2), 109\u2013137.","journal-title":"Social Networks"},{"key":"6035_CR19","unstructured":"Kantorovich, L. (1942). On the transfer of masses. In Dokl Acad Nauk USSR (Vol. 37, pp. 7\u20138)."},{"key":"6035_CR20","unstructured":"Kersting, K., Kriege, N. M., Morris, C., Mutzel, P., & Neumann, M. (2016). Benchmark data sets for graph kernels. http:\/\/graphkernels.cs.tu-dortmund.de."},{"key":"6035_CR21","doi-asserted-by":"publisher","unstructured":"Memoli, F. (2007). On the use of Gromov-Hausdorff distances for shape comparison. In: Botsch M, Pajarola R, Chen B, Zwicker M (eds) Eurographics symposium on point-based graphics. The Eurographics Association. https:\/\/doi.org\/10.2312\/SPBG\/SPBG07\/081-090.","DOI":"10.2312\/SPBG\/SPBG07\/081-090"},{"key":"6035_CR22","doi-asserted-by":"crossref","unstructured":"M\u00e9moli, F. (2009). Spectral gromov-wasserstein distances for shape matching. In IEEE 12th international conference on computer vision workshops (pp. 256\u2013263). IEEE: ICCV Workshops.","DOI":"10.1109\/ICCVW.2009.5457690"},{"issue":"4","key":"6035_CR23","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10208-011-9093-5","volume":"11","author":"F M\u00e9moli","year":"2011","unstructured":"M\u00e9moli, F. (2011). Gromov-wasserstein distances and the metric approach to object matching. Foundations of Computational Mathematics 11(4), 417\u2013487.","journal-title":"Foundations of Computational Mathematics"},{"key":"6035_CR24","unstructured":"Neumann, M., Moreno, P., Antanas, L., Garnett, R., & Kersting, K. (2013). Graph kernels for object category prediction in task-dependent robot grasping. In Online proceedings of the eleventh workshop on mining and learning with graphs (pp. 0\u20136)."},{"key":"6035_CR25","unstructured":"Paty, F. P., & Cuturi, M. (2019). Subspace robust wasserstein distances. In International conference on machine learning (pp. 5072\u20135081), PMLR."},{"key":"6035_CR26","doi-asserted-by":"crossref","unstructured":"Pele, O., & Werman, M. (2009). Fast and robust earth mover\u2019s distances. In 2009 IEEE 12th international conference on computer vision (pp. 460\u2013467), IEEE.","DOI":"10.1109\/ICCV.2009.5459199"},{"key":"6035_CR27","unstructured":"Peyr\u00e9, G., Cuturi, M., & Solomon, J. (2016). Gromov-wasserstein averaging of kernel and distance matrices. In International conference on machine learning (pp. 2664\u20132672)."},{"key":"6035_CR28","doi-asserted-by":"crossref","unstructured":"Rabin, J., & Peyr\u00e9, G. (2011). Wasserstein regularization of imaging problem. In 2011 18th IEEE international conference on image processing (pp. 1541\u20131544), IEEE.","DOI":"10.1109\/ICIP.2011.6115740"},{"issue":"6","key":"6035_CR29","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1162\/089976699300016313","volume":"11","author":"A Rangarajan","year":"1999","unstructured":"Rangarajan, A., Yuille, A., & Mjolsness, E. (1999). Convergence properties of the softassign quadratic assignment algorithm. Neural Computation, 11(6), 1455\u20131474.","journal-title":"Neural Computation"},{"key":"6035_CR30","doi-asserted-by":"crossref","unstructured":"Reddi, S. J., Sra, S., P\u00f3czos, B., & Smola, A. (2016). Stochastic frank-wolfe methods for nonconvex optimization. In 2016 54th annual Allerton conference on communication, control, and computing (Allerton) (pp. 1244\u20131251), IEEE.","DOI":"10.1109\/ALLERTON.2016.7852377"},{"key":"6035_CR31","unstructured":"Redko, I., Vayer, T., Flamary, R., & Courty, N. (2020). Co-optimal transport. In NeurIPS 2020-thirty-four conference on neural information processing systems."},{"key":"6035_CR32","unstructured":"Sato, R., Cuturi, M., Yamada, M., & Kashima, H. (2020). Fast and robust comparison of probability measures in heterogeneous spaces. arXiv preprint arXiv:200201615."},{"issue":"4","key":"6035_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2897824.2925903","volume":"35","author":"J Solomon","year":"2016","unstructured":"Solomon, J., Peyr\u00e9, G., Kim, V. G., & Sra, S. (2016). Entropic metric alignment for correspondence problems. ACM Transactions on Graphics (TOG), 35(4), 1\u201313.","journal-title":"ACM Transactions on Graphics (TOG)"},{"issue":"3","key":"6035_CR34","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/TSP.2016.2601299","volume":"65","author":"Y Sun","year":"2016","unstructured":"Sun, Y., Babu, P., & Palomar, D. P. (2016). Majorization-minimization algorithms in signal processing, communications, and machine learning. IEEE Transactions on Signal Processing 65(3), 794\u2013816.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"6035_CR35","unstructured":"Vayer, T., Chapel, L., Flamary, R., Tavenard, R., & Courty, N. (2018). Fused gromov-wasserstein distance for structured objects: theoretical foundations and mathematical properties. arXiv preprint arXiv:181102834."},{"key":"6035_CR36","unstructured":"Vayer, T., Chapel, L., Flamary, R., Tavenard, R., & Courty, N. (2019a). Optimal transport for structured data with application on graphs. In ICML 2019-36th international conference on machine learning (pp. 1\u201316)."},{"key":"6035_CR37","unstructured":"Vayer, T., Flamary, R., Tavenard, R., Chapel, L., & Courty, N. (2019b). Sliced gromov-wasserstein. In NeurIPS 2019-thirty-third conference on neural information processing systems (vol.\u00a032)."},{"key":"6035_CR38","doi-asserted-by":"crossref","unstructured":"Villani, C. (2008). Optimal transport: old and new. Springer.","DOI":"10.1007\/978-3-540-71050-9"},{"key":"6035_CR39","unstructured":"Wright, M.H. (1996). Direct search methods: Once scorned, now respectable. Pitman Research Notes in Mathematics Series (pp. 191\u2013208)."},{"key":"6035_CR40","unstructured":"Xie, Y., Wang, X., Wang, R., & Zha, H. (2020). A fast proximal point method for computing exact wasserstein distance. In Uncertainty in artificial intelligence (pp. 433\u2013453), PMLR."},{"key":"6035_CR41","unstructured":"Xu, H., Luo, D., & Carin, L. (2019a). Scalable gromov-wasserstein learning for graph partitioning and matching. In Advances in neural information processing systems (pp. 3046\u20133056)."},{"key":"6035_CR42","unstructured":"Xu, H., Luo, D., Zha, H., & Duke, L.C. (2019b). Gromov-wasserstein learning for graph matching and node embedding. In International conference on machine learning (pp. 6932\u20136941)."},{"key":"6035_CR43","doi-asserted-by":"crossref","unstructured":"Yan, Y., Li, W., Wu, H., Min, H., Tan, M., & Wu, Q. (2018). Semi-supervised optimal transport for heterogeneous domain adaptation. In IJCAI (pp. 2969\u20132975).","DOI":"10.24963\/ijcai.2018\/412"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06035-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-06035-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06035-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T14:00:09Z","timestamp":1659103209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-06035-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,26]]},"references-count":43,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["6035"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-06035-1","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,26]]},"assertion":[{"value":"29 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 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"}]}}