{"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/revisiting-classifier-two-sample-tests","title":"Revisiting Classifier Two-Sample Tests","arxiv_id":"1610.06545","date":"2016-10-20","proceeding":null,"authors":["David Lopez-Paz","Maxime Oquab"],"abstract":"The goal of two-sample tests is to assess whether two samples, $S_P \\sim P^n$\nand $S_Q \\sim Q^m$, are drawn from the same distribution. Perhaps intriguingly,\none relatively unexplored method to build two-sample tests is the use of binary\nclassifiers. In particular, construct a dataset by pairing the $n$ examples in\n$S_P$ with a positive label, and by pairing the $m$ examples in $S_Q$ with a\nnegative label. If the null hypothesis \"$P = Q$\" is true, then the\nclassification accuracy of a binary classifier on a held-out subset of this\ndataset should remain near chance-level. As we will show, such Classifier\nTwo-Sample Tests (C2ST) learn a suitable representation of the data on the fly,\nreturn test statistics in interpretable units, have a simple null distribution,\nand their predictive uncertainty allow to interpret where $P$ and $Q$ differ.\nThe goal of this paper is to establish the properties, performance, and uses of\nC2ST. First, we analyze their main theoretical properties. Second, we compare\ntheir performance against a variety of state-of-the-art alternatives. Third, we\npropose their use to evaluate the sample quality of generative models with\nintractable likelihoods, such as Generative Adversarial Networks (GANs).\nFourth, we showcase the novel application of GANs together with C2ST for causal\ndiscovery.","url_abs":"http://arxiv.org/abs/1610.06545v4","url_pdf":"http://arxiv.org/pdf/1610.06545v4.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":"revisiting-classifier-two-sample-tests","repo_url":"https://github.com/lopezpaz/classifier_tests","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"causal-discovery","task_name":"Causal Discovery"},{"task_slug":"two","task_name":"Vocal Bursts Valence Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1610.06545","atlas_url":"https://app.syntology.ai/?focus=1610.06545","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":"1610.06545"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1610.06545\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1610.06545"},"call":"get_concepts_for_paper(arxiv_id=\"1610.06545\")"}],"by_repo":[{"repo":"lopezpaz/classifier_tests","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":"55ed9304e7a5f6a2a88565ee4ec133b9249e3f1ff74487e9e53e6cbcadc40d99","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}