{"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-discriminant-analysis","title":"Wasserstein Discriminant Analysis","arxiv_id":"1608.08063","date":"2016-08-29","proceeding":null,"authors":["Rémi Flamary","Marco Cuturi","Nicolas Courty","Alain Rakotomamonjy"],"abstract":"Wasserstein Discriminant Analysis (WDA) is a new supervised method that can\nimprove classification of high-dimensional data by computing a suitable linear\nmap onto a lower dimensional subspace. Following the blueprint of classical\nLinear Discriminant Analysis (LDA), WDA selects the projection matrix that\nmaximizes the ratio of two quantities: the dispersion of projected points\ncoming from different classes, divided by the dispersion of projected points\ncoming from the same class. To quantify dispersion, WDA uses regularized\nWasserstein distances, rather than cross-variance measures which have been\nusually considered, notably in LDA. Thanks to the the underlying principles of\noptimal transport, WDA is able to capture both global (at distribution scale)\nand local (at samples scale) interactions between classes. Regularized\nWasserstein distances can be computed using the Sinkhorn matrix scaling\nalgorithm; We show that the optimization of WDA can be tackled using automatic\ndifferentiation of Sinkhorn iterations. Numerical experiments show promising\nresults both in terms of prediction and visualization on toy examples and real\nlife datasets such as MNIST and on deep features obtained from a subset of the\nCaltech dataset.","url_abs":"http://arxiv.org/abs/1608.08063v2","url_pdf":"http://arxiv.org/pdf/1608.08063v2.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-discriminant-analysis","repo_url":"https://github.com/rflamary/POT","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[{"method_slug":"lda","method_name":"LDA"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1608.08063","atlas_url":"https://app.syntology.ai/?focus=1608.08063","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":"1608.08063"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1608.08063\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1608.08063"},"call":"get_concepts_for_paper(arxiv_id=\"1608.08063\")"}],"by_repo":[{"repo":"rflamary/POT","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2002.08276"],"harvested_for_calls":[{"arxiv_id":"2002.08276","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2002.08276"},"call":"get_harvested_code_for_paper(arxiv_id=\"2002.08276\")"}]}],"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":"3872c791104e80ec2634dbee0d87bf0834c71327ae83cbefa58d11af33a94227","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}