{"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/wasserstein-dictionary-learning-optimal","title":"Wasserstein Dictionary Learning: Optimal Transport-based unsupervised non-linear dictionary learning","arxiv_id":"1708.01955","date":"2017-08-07","proceeding":null,"authors":["Morgan A. Schmitz","Matthieu Heitz","Nicolas Bonneel","Fred Maurice Ngolè Mboula","David Coeurjolly","Marco Cuturi","Gabriel Peyré","Jean-Luc Starck"],"abstract":"This paper introduces a new nonlinear dictionary learning method for\nhistograms in the probability simplex. The method leverages optimal transport\ntheory, in the sense that our aim is to reconstruct histograms using so-called\ndisplacement interpolations (a.k.a. Wasserstein barycenters) between dictionary\natoms; such atoms are themselves synthetic histograms in the probability\nsimplex. Our method simultaneously estimates such atoms, and, for each\ndatapoint, the vector of weights that can optimally reconstruct it as an\noptimal transport barycenter of such atoms. Our method is computationally\ntractable thanks to the addition of an entropic regularization to the usual\noptimal transportation problem, leading to an approximation scheme that is\nefficient, parallel and simple to differentiate. Both atoms and weights are\nlearned using a gradient-based descent method. Gradients are obtained by\nautomatic differentiation of the generalized Sinkhorn iterations that yield\nbarycenters with entropic smoothing. Because of its formulation relying on\nWasserstein barycenters instead of the usual matrix product between dictionary\nand codes, our method allows for nonlinear relationships between atoms and the\nreconstruction of input data. We illustrate its application in several\ndifferent image processing settings.","url_abs":"http://arxiv.org/abs/1708.01955v3","url_pdf":"http://arxiv.org/pdf/1708.01955v3.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":"wasserstein-dictionary-learning-optimal","repo_url":"https://github.com/matthieuheitz/WassersteinDictionaryLearning","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"wasserstein-dictionary-learning-optimal","repo_url":"https://github.com/mark-fangzhou-xie/wigpy","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"dictionary-learning","task_name":"Dictionary Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1708.01955","atlas_url":"https://app.syntology.ai/?focus=1708.01955","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.01955"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1708.01955\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1708.01955"},"call":"get_concepts_for_paper(arxiv_id=\"1708.01955\")"}],"by_repo":[{"repo":"matthieuheitz/WassersteinDictionaryLearning","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mark-fangzhou-xie/wigpy","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":"c30d24ad2cda254acd7e726cb004fa817d01f53c806ddf3d60886483ebe1a2fe","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}