{"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/large-scale-optimal-transport-map-estimation-1","title":"Large-scale optimal transport map estimation using projection pursuit","arxiv_id":"2106.05838","date":"2021-06-09","proceeding":"NeurIPS 2019 12","authors":["Cheng Meng","Yuan Ke","Jingyi Zhang","Mengrui Zhang","Wenxuan Zhong","Ping Ma"],"abstract":"This paper studies the estimation of large-scale optimal transport maps (OTM), which is a well-known challenging problem owing to the curse of dimensionality. Existing literature approximates the large-scale OTM by a series of one-dimensional OTM problems through iterative random projection. Such methods, however, suffer from slow or none convergence in practice due to the nature of randomly selected projection directions. Instead, we propose an estimation method of large-scale OTM by combining the idea of projection pursuit regression and sufficient dimension reduction. The proposed method, named projection pursuit Monge map (PPMM), adaptively selects the most ``informative'' projection direction in each iteration. We theoretically show the proposed dimension reduction method can consistently estimate the most ``informative'' projection direction in each iteration. Furthermore, the PPMM algorithm weakly convergences to the target large-scale OTM in a reasonable number of steps. Empirically, PPMM is computationally easy and converges fast. We assess its finite sample performance through the applications of Wasserstein distance estimation and generative models.","url_abs":"https://arxiv.org/abs/2106.05838v1","url_pdf":"https://arxiv.org/pdf/2106.05838v1.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-map-estimation-1","repo_url":"https://github.com/ChengzijunAixiaoli/PPMM","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2106.05838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05838"}},"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/ChengzijunAixiaoli/PPMM","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"unverified":3},"by_repo_kind":{"official":{"samples":3,"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":"f8bb2b89114b7d14","entry":"drDir","repo":"ChengzijunAixiaoli/PPMM","repo_kind":"official","path":"lib/PPMM_func.py","file_url":"https://github.com/ChengzijunAixiaoli/PPMM/blob/HEAD/lib/PPMM_func.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"f8bb2b89114b7d14"}},{"code_sha256_prefix":"d134f8e1e2237c98","entry":"fastCov","repo":"ChengzijunAixiaoli/PPMM","repo_kind":"official","path":"lib/PPMM_func.py","file_url":"https://github.com/ChengzijunAixiaoli/PPMM/blob/HEAD/lib/PPMM_func.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"d134f8e1e2237c98"}},{"code_sha256_prefix":"acd8dfcb704a68ae","entry":"saveDir","repo":"ChengzijunAixiaoli/PPMM","repo_kind":"official","path":"lib/PPMM_func.py","file_url":"https://github.com/ChengzijunAixiaoli/PPMM/blob/HEAD/lib/PPMM_func.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"acd8dfcb704a68ae"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}