{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/large-scale-optimal-transport-and-mapping","title":"Large-Scale Optimal Transport and Mapping Estimation","arxiv_id":"1711.02283","date":"2017-11-07","proceeding":null,"authors":["Vivien Seguy","Bharath Bhushan Damodaran","Rémi Flamary","Nicolas Courty","Antoine Rolet","Mathieu Blondel"],"abstract":"This paper presents a novel two-step approach for the fundamental problem of\nlearning an optimal map from one distribution to another. First, we learn an\noptimal transport (OT) plan, which can be thought as a one-to-many map between\nthe two distributions. To that end, we propose a stochastic dual approach of\nregularized OT, and show empirically that it scales better than a recent\nrelated approach when the amount of samples is very large. Second, we estimate\na \\textit{Monge map} as a deep neural network learned by approximating the\nbarycentric projection of the previously-obtained OT plan. This\nparameterization allows generalization of the mapping outside the support of\nthe input measure. We prove two theoretical stability results of regularized OT\nwhich show that our estimations converge to the OT plan and Monge map between\nthe underlying continuous measures. We showcase our proposed approach on two\napplications: domain adaptation and generative modeling.","url_abs":"http://arxiv.org/abs/1711.02283v2","url_pdf":"http://arxiv.org/pdf/1711.02283v2.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":"large-scale-optimal-transport-and-mapping","repo_url":"https://github.com/mikigom/large-scale-OT-mapping-TF","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"large-scale-optimal-transport-and-mapping","repo_url":"https://github.com/vivienseguy/Large-Scale-OT","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.02283","atlas_url":"https://app.syntology.ai/?focus=1711.02283","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1711.02283"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.02283\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.02283"},"call":"get_concepts_for_paper(arxiv_id=\"1711.02283\")"}],"by_repo":[{"repo":"mikigom/large-scale-OT-mapping-TF","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"vivienseguy/Large-Scale-OT","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f3c460ea1941b499d3ebffbd4cde751e3ec124e09730c12eb988e78364d7c7cb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}