{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:28:17Z","timestamp":1743024497052,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031264184"},{"type":"electronic","value":"9783031264191"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-26419-1_18","type":"book-chapter","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:24:57Z","timestamp":1679876697000},"page":"291-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Feature-Robust Optimal Transport for\u00a0High-Dimensional Data"],"prefix":"10.1007","author":[{"given":"Mathis","family":"Petrovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryoma","family":"Sato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao-Hung Hubert","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linchao","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruslan","family":"Salakhutdinov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Yamada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,17]]},"reference":[{"key":"18_CR1","unstructured":"Blondel, M., Seguy, V., Rolet, A.: Smooth and sparse optimal transport. In: AISTATS (2018)"},{"key":"18_CR2","unstructured":"Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. In: NIPS (2013)"},{"key":"18_CR3","unstructured":"Cuturi, M., Doucet, A.: Fast computation of Wasserstein barycenters. In: ICML (2014)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Deng, J., Dong, W., Socher, R., Li, L. J., Li, K., Fei-Fei, L.: Imagenet: a large-scale hierarchical image database. In: CVPR (2009)","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Deshpande, I., et al.: Max-sliced Wasserstein distance and its use for GANs. In: CVPR (2019)","DOI":"10.1109\/CVPR.2019.01090"},{"key":"18_CR6","unstructured":"Dhouib, S., Redko, I., Kerdoncuff, T., Emonet, R., Sebban, M.: A swiss army knife for minimax optimal transport. In: ICML (2020)"},{"issue":"3","key":"18_CR7","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1111\/j.1467-9868.2011.01018.x","volume":"74","author":"SN Evans","year":"2012","unstructured":"Evans, S.N., Matsen, F.A.: The phylogenetic Kantorovich-Rubinstein metric for environmental sequence samples. J. Roy. Stat. Soc. Ser. B (Stat. Methodol.) 74(3), 569\u2013592 (2012)","journal-title":"J. Roy. Stat. Soc. Ser. B (Stat. Methodol.)"},{"issue":"1\u20132","key":"18_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Q. 3(1\u20132), 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Q."},{"key":"18_CR9","unstructured":"Gretton, A., Fukumizu, K., Teo, C., Song, L., Sch\u00f6lkopf, B., Smola, A.: A kernel statistical test of independence. In: NIPS (2007)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: CVPR (2016)","DOI":"10.1109\/CVPR.2016.90"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Seo, P.H., Lee, J., Jung, D., Han, B., Cho, M.: Attentive semantic alignment with offset-aware correlation kernels. In: ECCV (2018)","DOI":"10.1007\/978-3-030-01225-0_22"},{"key":"18_CR12","unstructured":"Jaggi, M.: Revisiting frank-wolfe: projection-free sparse convex optimization. In: ICML (2013)"},{"key":"18_CR13","unstructured":"Janati, H., Cuturi, M., Gramfort, A.: Wasserstein regularization for sparse multi-task regression. In: AISTATS (2019)"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Kolouri, S., Zou, Y., Rohde, G.K.: Sliced Wasserstein kernels for probability distributions. In: CVPR (2016)","DOI":"10.1109\/CVPR.2016.568"},{"key":"18_CR15","unstructured":"Kolouri, S., Nadjahi, K., Simsekli, U., Badeau, R., Rohde, G.: Generalized sliced Wasserstein distances. In: NeurIPS (2019)"},{"key":"18_CR16","unstructured":"Kusner, M., Sun, Y., Kolkin, N., Weinberger, K.: From word embeddings to document distances. In: ICML (2015)"},{"key":"18_CR17","unstructured":"Le, T., Yamada, M., Fukumizu, K., Cuturi, M.: Tree-sliced approximation of Wasserstein distances. In: NeurIPS (2019)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Liu, Y., Zhu, L., Yamada, M., Yang, Y.: Semantic correspondence as an optimal transport problem. In: CVPR (2020)","DOI":"10.1109\/CVPR42600.2020.00452"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Liu, Y., Yamada, M., Tsai, Y.-H.H., Le, T., Salakhutdinov, R., Yang, Y.: Semi-supervised squared-loss mutual information estimation with optimal transport. In: ECML (2021)","DOI":"10.1007\/978-3-030-86486-6_40"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Min, J., Lee, J., Ponce, J., Cho, M.: Hyperpixel flow: semantic correspondence with multi-layer neural features. In: ICCV (2019a)","DOI":"10.1109\/ICCV.2019.00349"},{"key":"18_CR21","unstructured":"Min, J., Lee, J., Ponce, J., Cho, M.: Spair-71k: a large-scale benchmark for semantic correspondence. arXiv preprint arXiv:1908.10543 (2019b)"},{"issue":"1","key":"18_CR22","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Yu Nesterov","year":"2005","unstructured":"Nesterov, Yu.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"18_CR23","unstructured":"Paty, F.-P., Cuturi, M.: Subspace robust Wasserstein distances. In: ICML (2019)"},{"key":"18_CR24","unstructured":"Paty, F.P., Cuturi, M.: Regularized optimal transport is ground cost adversarial. In: ICML (2020)"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Peyr\u00e9, G., Cuturi, M., et al.: Computational optimal transport. Found. Trends\u00ae Mach. Learn. 11(5\u20136), 355\u2013607 (2019)","DOI":"10.1561\/2200000073"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Rocco, I., Arandjelovic, R., Sivic, J.: Convolutional neural network architecture for geometric matching. In: CVPR (2017)","DOI":"10.1109\/CVPR.2017.12"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Rocco, I., Arandjelovi\u0107, R., Sivic, J.: End-to-end weakly-supervised semantic alignment. In: CVPR (2018a)","DOI":"10.1109\/CVPR.2018.00723"},{"key":"18_CR28","unstructured":"Rocco, I., Cimpoi, M., Arandjelovi\u0107, R., Torii, A., Pajdla, T., Sivic, J.: Neighbourhood consensus networks. In: NeurIPS (2018b)"},{"issue":"2","key":"18_CR29","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.: The earth mover\u2019s distance as a metric for image retrieval. Int. J. Comput. Vis. 40(2), 99\u2013121 (2000)","journal-title":"Int. J. Comput. Vis."},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Sarlin, P.E., DeTone, D., Malisiewicz, T., Rabinovich, A.: Learning feature matching with graph neural networks. In: CVPR (2020)","DOI":"10.1109\/CVPR42600.2020.00499"},{"key":"18_CR31","unstructured":"Sato, R., Yamada, M., Kashima, H.: Fast unbalanced optimal transport on tree. In: NeurIPS (2020)"},{"key":"18_CR32","unstructured":"Sato, R., Yamada, M., Kashima, H.: Re-evaluating word mover\u2019s distance. In: ICML (2022)"},{"key":"18_CR33","unstructured":"Scetbon, M., Meunier, L., Atif, J., Cuturi, M.: Equitable and optimal transport with multiple agents. In: AISTATS (2021)"},{"key":"18_CR34","unstructured":"Takezawa, Y., Sato, R., Yamada, M.: Supervised tree-Wasserstein distance. In: ICML (2021)"},{"key":"18_CR35","unstructured":"Takezawa, Y., Sato, R., Kozareva, Z., Ravi, S., Yamada, M.: Fixed support tree-sliced Wasserstein barycenter. In: AISTATS (2022)"},{"key":"18_CR36","doi-asserted-by":"crossref","unstructured":"Yan, Y., Li, W., Wu, H., Min, H., Tan, M., Wu, Q.: Semi-supervised optimal transport for heterogeneous domain adaptation. In: IJCAI (2018)","DOI":"10.24963\/ijcai.2018\/412"},{"issue":"1","key":"18_CR37","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. Roy. Stat. Soc. Ser. B (Stat. Methodol.) 68(1), 49\u201367 (2006)","journal-title":"J. Roy. Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"Zhou, B., Khosla, A., Lapedriza, A., Oliva, A., Torralba, A.: Learning deep features for discriminative localization. In: CVPR (2016)","DOI":"10.1109\/CVPR.2016.319"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26419-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:31:04Z","timestamp":1679877064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26419-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031264184","9783031264191"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26419-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1060","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"236","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17 demo track papers have been accepted from 28 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}