{"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/empirical-optimal-transport-between","title":"Consistent Optimal Transport with Empirical Conditional Measures","arxiv_id":"2305.15901","date":"2023-05-25","proceeding":null,"authors":["Piyushi Manupriya","Rachit Keerti Das","Sayantan Biswas","Saketha Nath Jagarlapudi"],"abstract":"Given samples from two joint distributions, we consider the problem of Optimal Transportation (OT) between them when conditioned on a common variable. We focus on the general setting where the conditioned variable may be continuous, and the marginals of this variable in the two joint distributions may not be the same. In such settings, standard OT variants cannot be employed, and novel estimation techniques are necessary. Since the main challenge is that the conditional distributions are not explicitly available, the key idea in our OT formulation is to employ kernelized-least-squares terms computed over the joint samples, which implicitly match the transport plan's marginals with the empirical conditionals. Under mild conditions, we prove that our estimated transport plans, as a function of the conditioned variable, are asymptotically optimal. For finite samples, we show that the deviation in terms of our regularized objective is bounded by $O(1/m^{1/4})$, where $m$ is the number of samples. We also discuss how the conditional transport plan could be modelled using explicit probabilistic models as well as using implicit generative ones. We empirically verify the consistency of our estimator on synthetic datasets, where the optimal plan is analytically known. When employed in applications like prompt learning for few-shot classification and conditional-generation in the context of predicting cell responses to treatment, our methodology improves upon state-of-the-art methods.","url_abs":"https://arxiv.org/abs/2305.15901v6","url_pdf":"https://arxiv.org/pdf/2305.15901v6.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":"empirical-optimal-transport-between","repo_url":"https://github.com/atmlr-lab/cot","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"jax","reach":null}],"tasks":[{"task_slug":"prompt-learning","task_name":"Prompt Learning"}],"methods":[{"method_slug":"focus","method_name":"Focus"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2305.15901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15901"}},"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/atmlr-lab/cot","reach":null}],"summary":{"ran_honours":3},"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":"49816e2ab81696bb","entry":"m","repo":"atmlr-lab/cot","repo_kind":"official","path":"Sec5.1/Sec5.1.1/correctness_exp_v3.py","file_url":"https://github.com/atmlr-lab/cot/blob/HEAD/Sec5.1/Sec5.1.1/correctness_exp_v3.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":"49816e2ab81696bb"}},{"code_sha256_prefix":"ac94058fb78ad54b","entry":"m_dash","repo":"atmlr-lab/cot","repo_kind":"official","path":"Sec5.1/Sec5.1.1/correctness_exp_v3.py","file_url":"https://github.com/atmlr-lab/cot/blob/HEAD/Sec5.1/Sec5.1.1/correctness_exp_v3.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":"ac94058fb78ad54b"}},{"code_sha256_prefix":"99abada3230033ee","entry":"sig","repo":"atmlr-lab/cot","repo_kind":"official","path":"Sec5.1/Sec5.1.1/correctness_exp_v3.py","file_url":"https://github.com/atmlr-lab/cot/blob/HEAD/Sec5.1/Sec5.1.1/correctness_exp_v3.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":"99abada3230033ee"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}