{"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/unbalanced-optimal-transport-meets-sliced","title":"Slicing Unbalanced Optimal Transport","arxiv_id":"2306.07176","date":"2023-06-12","proceeding":null,"authors":["Clément Bonet","Kimia Nadjahi","Thibault Séjourné","Kilian Fatras","Nicolas Courty"],"abstract":"Optimal transport (OT) is a powerful framework to compare probability measures, a fundamental task in many statistical and machine learning problems. Substantial advances have been made in designing OT variants which are either computationally and statistically more efficient or robust. Among them, sliced OT distances have been extensively used to mitigate optimal transport's cubic algorithmic complexity and curse of dimensionality. In parallel, unbalanced OT was designed to allow comparisons of more general positive measures, while being more robust to outliers. In this paper, we bridge the gap between those two concepts and develop a general framework for efficiently comparing positive measures. We notably formulate two different versions of sliced unbalanced OT, and study the associated topology and statistical properties. We then develop a GPU-friendly Frank-Wolfe like algorithm to compute the corresponding loss functions, and show that the resulting methodology is modular as it encompasses and extends prior related work. We finally conduct an empirical analysis of our loss functions and methodology on both synthetic and real datasets, to illustrate their computational efficiency, relevance and applicability to real-world scenarios including geophysical data.","url_abs":"https://arxiv.org/abs/2306.07176v2","url_pdf":"https://arxiv.org/pdf/2306.07176v2.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":"unbalanced-optimal-transport-meets-sliced","repo_url":"https://github.com/clbonet/Slicing_Unbalanced_Optimal_Transport","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":null,"task_name":"GPU"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2306.07176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07176"}},"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/clbonet/Slicing_Unbalanced_Optimal_Transport","reach":null}],"summary":{"ran_honours":2,"ran_draft_wrong":1},"by_repo_kind":{"official":{"samples":3,"ran":3,"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":3,"samples":[{"code_sha256_prefix":"79dce2a6375ed79d","entry":"kullback_leibler","repo":"clbonet/Slicing_Unbalanced_Optimal_Transport","repo_kind":"official","path":"sliceduot/sliced_uot.py","file_url":"https://github.com/clbonet/Slicing_Unbalanced_Optimal_Transport/blob/HEAD/sliceduot/sliced_uot.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"79dce2a6375ed79d"}},{"code_sha256_prefix":"fdfc994f94c3f151","entry":"logsumexp","repo":"clbonet/Slicing_Unbalanced_Optimal_Transport","repo_kind":"official","path":"sliceduot/sliced_uot.py","file_url":"https://github.com/clbonet/Slicing_Unbalanced_Optimal_Transport/blob/HEAD/sliceduot/sliced_uot.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"fdfc994f94c3f151"}},{"code_sha256_prefix":"14b11fbb67145fcb","entry":"rescale_potentials","repo":"clbonet/Slicing_Unbalanced_Optimal_Transport","repo_kind":"official","path":"sliceduot/sliced_uot.py","file_url":"https://github.com/clbonet/Slicing_Unbalanced_Optimal_Transport/blob/HEAD/sliceduot/sliced_uot.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"14b11fbb67145fcb"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}