{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/ground-metric-learning-on-graphs","title":"Ground Metric Learning on Graphs","arxiv_id":"1911.03117","date":"2019-11-08","proceeding":null,"authors":["Matthieu Heitz","Nicolas Bonneel","David Coeurjolly","Marco Cuturi","Gabriel Peyré"],"abstract":"Optimal transport (OT) distances between probability distributions are parameterized by the ground metric they use between observations. Their relevance for real-life applications strongly hinges on whether that ground metric parameter is suitably chosen. Selecting it adaptively and algorithmically from prior knowledge, the so-called ground metric learning GML) problem, has therefore appeared in various settings. We consider it in this paper when the learned metric is constrained to be a geodesic distance on a graph that supports the measures of interest. This imposes a rich structure for candidate metrics, but also enables far more efficient learning procedures when compared to a direct optimization over the space of all metric matrices. We use this setting to tackle an inverse problem stemming from the observation of a density evolving with time: we seek a graph ground metric such that the OT interpolation between the starting and ending densities that result from that ground metric agrees with the observed evolution. This OT dynamic framework is relevant to model natural phenomena exhibiting displacements of mass, such as for instance the evolution of the color palette induced by the modification of lighting and materials.","url_abs":"https://arxiv.org/abs/1911.03117v3","url_pdf":"https://arxiv.org/pdf/1911.03117v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"ground-metric-learning-on-graphs","repo_url":"https://github.com/matthieuheitz/2020-JMIV-ground-metric-learning-graphs","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"metric-learning","task_name":"Metric Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1911.03117","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03117"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/matthieuheitz/2020-JMIV-ground-metric-learning-graphs","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":5},"by_repo_kind":{"official":{"samples":5,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"08c979376c45f53e","entry":"bilateral_approximation","repo":"matthieuheitz/2020-JMIV-ground-metric-learning-graphs","repo_kind":"official","path":"bilateral_approximation.py","file_url":"https://github.com/matthieuheitz/2020-JMIV-ground-metric-learning-graphs/blob/HEAD/bilateral_approximation.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"08c979376c45f53e"}},{"code_sha256_prefix":"70dff2d4dfb3dd91","entry":"bilateral_approximation_color","repo":"matthieuheitz/2020-JMIV-ground-metric-learning-graphs","repo_kind":"official","path":"bilateral_approximation.py","file_url":"https://github.com/matthieuheitz/2020-JMIV-ground-metric-learning-graphs/blob/HEAD/bilateral_approximation.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"70dff2d4dfb3dd91"}},{"code_sha256_prefix":"8e46b1db6ed6aaed","entry":"color_transfer_ot_barycentric_proj","repo":"matthieuheitz/2020-JMIV-ground-metric-learning-graphs","repo_kind":"official","path":"ml_color_transfer.py","file_url":"https://github.com/matthieuheitz/2020-JMIV-ground-metric-learning-graphs/blob/HEAD/ml_color_transfer.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8e46b1db6ed6aaed"}},{"code_sha256_prefix":"c580e1ce6330f316","entry":"compute_sinkhorn_barycenter","repo":"matthieuheitz/2020-JMIV-ground-metric-learning-graphs","repo_kind":"official","path":"OT_Sinkhorn.py","file_url":"https://github.com/matthieuheitz/2020-JMIV-ground-metric-learning-graphs/blob/HEAD/OT_Sinkhorn.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c580e1ce6330f316"}},{"code_sha256_prefix":"ebde3b641f1cea99","entry":"pdf_entropy","repo":"matthieuheitz/2020-JMIV-ground-metric-learning-graphs","repo_kind":"official","path":"OT_Sinkhorn.py","file_url":"https://github.com/matthieuheitz/2020-JMIV-ground-metric-learning-graphs/blob/HEAD/OT_Sinkhorn.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ebde3b641f1cea99"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}