{"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/fast-computation-of-wasserstein-barycenters","title":"Fast Computation of Wasserstein Barycenters","arxiv_id":"1310.4375","date":"2013-10-16","proceeding":null,"authors":["Marco Cuturi","Arnaud Doucet"],"abstract":"We present new algorithms to compute the mean of a set of empirical\nprobability measures under the optimal transport metric. This mean, known as\nthe Wasserstein barycenter, is the measure that minimizes the sum of its\nWasserstein distances to each element in that set. We propose two original\nalgorithms to compute Wasserstein barycenters that build upon the subgradient\nmethod. A direct implementation of these algorithms is, however, too costly\nbecause it would require the repeated resolution of large primal and dual\noptimal transport problems to compute subgradients. Extending the work of\nCuturi (2013), we propose to smooth the Wasserstein distance used in the\ndefinition of Wasserstein barycenters with an entropic regularizer and recover\nin doing so a strictly convex objective whose gradients can be computed for a\nconsiderably cheaper computational cost using matrix scaling algorithms. We use\nthese algorithms to visualize a large family of images and to solve a\nconstrained clustering problem.","url_abs":"http://arxiv.org/abs/1310.4375v3","url_pdf":"http://arxiv.org/pdf/1310.4375v3.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":"fast-computation-of-wasserstein-barycenters","repo_url":"https://github.com/nicolasbolle/barycenters","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"fast-computation-of-wasserstein-barycenters","repo_url":"https://github.com/dan-mim/Wasserstein-barycenters/tree/main/Cuturi%20support%20and%20probability%20optimization","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"constrained-clustering","task_name":"Constrained Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1310.4375","atlas_url":"https://app.syntology.ai/?focus=1310.4375","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":"1310.4375"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1310.4375\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1310.4375"},"call":"get_concepts_for_paper(arxiv_id=\"1310.4375\")"}],"by_repo":[{"repo":"nicolasbolle/barycenters","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1306.0895"],"harvested_for_calls":[{"arxiv_id":"1306.0895","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1306.0895"},"call":"get_harvested_code_for_paper(arxiv_id=\"1306.0895\")"}]},{"repo":"dan-mim/Wasserstein-barycenters","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"857427fae9c631a1ce7a210ea401e429a36e8358c31e47f0de7f4887c3e849f9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}