{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/learning-latent-causal-graphs-via-mixture","title":"Learning latent causal graphs via mixture oracles","arxiv_id":"2106.15563","date":"2021-06-29","proceeding":"NeurIPS 2021 12","authors":["Bohdan Kivva","Goutham Rajendran","Pradeep Ravikumar","Bryon Aragam"],"abstract":"We study the problem of reconstructing a causal graphical model from data in the presence of latent variables. The main problem of interest is recovering the causal structure over the latent variables while allowing for general, potentially nonlinear dependence between the variables. In many practical problems, the dependence between raw observations (e.g. pixels in an image) is much less relevant than the dependence between certain high-level, latent features (e.g. concepts or objects), and this is the setting of interest. We provide conditions under which both the latent representations and the underlying latent causal model are identifiable by a reduction to a mixture oracle. These results highlight an intriguing connection between the well-studied problem of learning the order of a mixture model and the problem of learning the bipartite structure between observables and unobservables. The proof is constructive, and leads to several algorithms for explicitly reconstructing the full graphical model. We discuss efficient algorithms and provide experiments illustrating the algorithms in practice.","url_abs":"https://arxiv.org/abs/2106.15563v2","url_pdf":"https://arxiv.org/pdf/2106.15563v2.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":"learning-latent-causal-graphs-via-mixture","repo_url":"https://github.com/30bohdan/latent-dag","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2106.15563","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.15563"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/30bohdan/latent-dag","reach":null}],"summary":{"ran_draft_wrong":2,"ran_honours":1,"unverified":1},"by_repo_kind":{"official":{"samples":4,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":4,"samples":[{"code_sha256_prefix":"30c2aabe236eb642","entry":"count_accuracy","repo":"30bohdan/latent-dag","repo_kind":"official","path":"pipeline.py","file_url":"https://github.com/30bohdan/latent-dag/blob/HEAD/pipeline.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"30c2aabe236eb642"}},{"code_sha256_prefix":"157ac7a2a7709d90","entry":"get_metrics","repo":"30bohdan/latent-dag","repo_kind":"official","path":"pipeline.py","file_url":"https://github.com/30bohdan/latent-dag/blob/HEAD/pipeline.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"157ac7a2a7709d90"}},{"code_sha256_prefix":"4f8950874bc21658","entry":"log_sum_union","repo":"30bohdan/latent-dag","repo_kind":"official","path":"latent.py","file_url":"https://github.com/30bohdan/latent-dag/blob/HEAD/latent.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"4f8950874bc21658"}},{"code_sha256_prefix":"e5f89a81a3b1892d","entry":"fges_disc_bic","repo":"30bohdan/latent-dag","repo_kind":"official","path":"pipeline.py","file_url":"https://github.com/30bohdan/latent-dag/blob/HEAD/pipeline.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"e5f89a81a3b1892d"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}