Metraipolis › archive › dc_a91632807ca2
Generalizing Identifiability Results in Causal Discovery from Complete Data to Missing Data Settings — arXiv:2610.19211
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.19211
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T14:23:18.368Z
- SHA-256 of the archived text
373a5a921198e3a330a693e4174507accc10500781d21afe9496f2762fc8739c- Stable URL of this page
https://metraipolis.com/documento/dc_a91632807ca2
How to cite
Generalizing Identifiability Results in Causal Discovery from Complete Data to Missing Data Settings — arXiv:2610.19211 — arXiv (en), https://arxiv.org/abs/2610.19211 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a91632807ca2 (Metraipolis archive dc_a91632807ca2, sha256 373a5a921198e3a330a693e4174507accc10500781d21afe9496f2762fc8739c)
BibTeX
@misc{dca91632807ca2,
title = {Generalizing Identifiability Results in Causal Discovery from Complete Data to Missing Data Settings — arXiv:2610.19211},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.19211},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a91632807ca2; sha256 373a5a921198e3a330a693e4174507accc10500781d21afe9496f2762fc8739c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19211. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
While causal discovery methods have matured for complete data, such algorithms for handling missing values remain limited. We establish general sufficient conditions under which causal graphs remain identifiable (i.e., uniquely determined from the available data distribution) under various missingness categories, including Missing Not At Random, and provide a framework to extend correctness guarantees from causal discovery algorithms for complete data to missing data settings. Our results show that identifiability of causal graphs with no unobserved confounders is preserved when (1) missingness mechanisms do not causally interact, (2) no variable directly causes its own missingness, and (3) either faithfulness holds for missingness mechanisms, or they follow generalized linear models. Guided by these theoretical results, we introduce two asymptotically correct algorithms for Additive Noise Models (ANMs) that recover the underlying causal graph and provide consistent parameter estimates. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (stat.ML) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Methodology (stat.ME). Pagina del lavoro: https://arxiv.org/abs/2610.19211 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T13:53:35.841Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).