{"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/multiscale-strategies-for-computing-optimal","title":"Multiscale Strategies for Computing Optimal Transport","arxiv_id":"1708.02469","date":"2017-08-08","proceeding":null,"authors":["Samuel Gerber","Mauro Maggioni"],"abstract":"This paper presents a multiscale approach to efficiently compute approximate\noptimal transport plans between point sets. It is particularly well-suited for\npoint sets that are in high-dimensions, but are close to being intrinsically\nlow-dimensional. The approach is based on an adaptive multiscale decomposition\nof the point sets. The multiscale decomposition yields a sequence of optimal\ntransport problems, that are solved in a top-to-bottom fashion from the\ncoarsest to the finest scale. We provide numerical evidence that this\nmultiscale approach scales approximately linearly, in time and memory, in the\nnumber of nodes, instead of quadratically or worse for a direct solution.\nEmpirically, the multiscale approach results in less than one percent relative\nerror in the objective function. Furthermore, the multiscale plans constructed\nare of interest by themselves as they may be used to introduce novel features\nand notions of distances between point sets. An analysis of sets of brain MRI\nbased on optimal transport distances illustrates the effectiveness of the\nproposed method on a real world data set. The application demonstrates that\nmultiscale optimal transport distances have the potential to improve on\nstate-of-the-art metrics currently used in computational anatomy.","url_abs":"http://arxiv.org/abs/1708.02469v1","url_pdf":"http://arxiv.org/pdf/1708.02469v1.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":"multiscale-strategies-for-computing-optimal","repo_url":"https://bitbucket.org/suppechasper/optimaltransport","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"multiscale-strategies-for-computing-optimal","repo_url":"https://github.com/samuelgerber/mop","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"anatomy","task_name":"Anatomy"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1708.02469","atlas_url":"https://app.syntology.ai/?focus=1708.02469","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":"1708.02469"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1708.02469\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1708.02469"},"call":"get_concepts_for_paper(arxiv_id=\"1708.02469\")"}],"by_repo":[{"repo":"bitbucket.org/suppechasper/optimaltransport","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"samuelgerber/mop","kind":"official","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":"90de1779da8944d9c0b396af30960c0adba5a3c9636f339a703ff27865e434e3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}