Weighting-Based Identification and Estimation in Graphical Models of Missing Data

• URL: http://arxiv.org/abs/2602.10969v1
• Date: Wed, 11 Feb 2026 16:00:26 GMT
• Title: Weighting-Based Identification and Estimation in Graphical Models of Missing Data
• Authors: Anna Guo, Razieh Nabi,
• Abstract summary: We propose a constructive algorithm for identifying complete data distributions in graphical models of missing data.<n>A central challenge in this setting is that sequences of interventions on missingness indicators may induce and propagate selection bias.<n>We develop inverse probability weighting procedures that mirror the intervention logic of the identification algorithm.
• Score: 0.8880611506199766
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a constructive algorithm for identifying complete data distributions in graphical models of missing data. The complete data distribution is unrestricted, while the missingness mechanism is assumed to factorize according to a conditional directed acyclic graph. Our approach follows an interventionist perspective in which missingness indicators are treated as variables that can be intervened on. A central challenge in this setting is that sequences of interventions on missingness indicators may induce and propagate selection bias, so that identification can fail even when a propensity score is invariant to available interventions. To address this challenge, we introduce a tree-based identification algorithm that explicitly tracks the creation and propagation of selection bias and determines whether it can be avoided through admissible intervention strategies. The resulting tree provides both a diagnostic and a constructive characterization of identifiability under a given missingness mechanism. Building on these results, we develop recursive inverse probability weighting procedures that mirror the intervention logic of the identification algorithm, yielding valid estimating equations for both the missingness mechanism and functionals of the complete data distribution. Simulation studies and a real-data application illustrate the practical performance of the proposed methods. An accompanying R package, flexMissing, implements all proposed procedures.

Related papers

• Score-based Causal Representation Learning: Linear and General Transformations [31.786444957887472]
  The paper addresses both the identifiability and achievability aspects.<n>It designs a score-based class of algorithms that ensures both identifiability and achievability.<n>Results are validated via experiments on structured synthetic data and image data.
  arXiv  Detail & Related papers  (2024-02-01T18:40:03Z)
• Identification of Causal Structure in the Presence of Missing Data with Additive Noise Model [24.755511829867398]
  We find that the recent advances additive noise model has the potential for learning causal structure under the existence of self-masking missingness. We propose a practical algorithm based on the above theoretical results on learning the causal skeleton and causal direction.
  arXiv  Detail & Related papers  (2023-12-19T14:44:26Z)
• General Identifiability and Achievability for Causal Representation Learning [33.80247458590611]
  The paper establishes identifiability and achievability results using two hard uncoupled interventions per node in the latent causal graph. For identifiability, the paper establishes that perfect recovery of the latent causal model and variables is guaranteed under uncoupled interventions. The analysis, additionally, recovers the identifiability result for two hard coupled interventions, that is when metadata about the pair of environments that have the same node intervened is known.
  arXiv  Detail & Related papers  (2023-10-24T01:47:44Z)
• Identifiability Guarantees for Causal Disentanglement from Soft Interventions [26.435199501882806]
  Causal disentanglement aims to uncover a representation of data using latent variables that are interrelated through a causal model. In this paper, we focus on the scenario where unpaired observational and interventional data are available, with each intervention changing the mechanism of a latent variable. When the causal variables are fully observed, statistically consistent algorithms have been developed to identify the causal model under faithfulness assumptions.
  arXiv  Detail & Related papers  (2023-07-12T15:39:39Z)
• Learning Linear Causal Representations from Interventions under General Nonlinear Mixing [52.66151568785088]
  We prove strong identifiability results given unknown single-node interventions without access to the intervention targets. This is the first instance of causal identifiability from non-paired interventions for deep neural network embeddings.
  arXiv  Detail & Related papers  (2023-06-04T02:32:12Z)
• Learning to Bound Counterfactual Inference in Structural Causal Models from Observational and Randomised Data [64.96984404868411]
  We derive a likelihood characterisation for the overall data that leads us to extend a previous EM-based algorithm. The new algorithm learns to approximate the (unidentifiability) region of model parameters from such mixed data sources. It delivers interval approximations to counterfactual results, which collapse to points in the identifiable case.
  arXiv  Detail & Related papers  (2022-12-06T12:42:11Z)
• Bayesian Networks for the robust and unbiased prediction of depression and its symptoms utilizing speech and multimodal data [65.28160163774274]
  We apply a Bayesian framework to capture the relationships between depression, depression symptoms, and features derived from speech, facial expression and cognitive game data collected at thymia.
  arXiv  Detail & Related papers  (2022-11-09T14:48:13Z)
• MissDAG: Causal Discovery in the Presence of Missing Data with Continuous Additive Noise Models [78.72682320019737]
  We develop a general method, which we call MissDAG, to perform causal discovery from data with incomplete observations. MissDAG maximizes the expected likelihood of the visible part of observations under the expectation-maximization framework. We demonstrate the flexibility of MissDAG for incorporating various causal discovery algorithms and its efficacy through extensive simulations and real data experiments.
  arXiv  Detail & Related papers  (2022-05-27T09:59:46Z)
• Scalable Intervention Target Estimation in Linear Models [52.60799340056917]
  Current approaches to causal structure learning either work with known intervention targets or use hypothesis testing to discover the unknown intervention targets. This paper proposes a scalable and efficient algorithm that consistently identifies all intervention targets. The proposed algorithm can be used to also update a given observational Markov equivalence class into the interventional Markov equivalence class.
  arXiv  Detail & Related papers  (2021-11-15T03:16:56Z)
• MIRACLE: Causally-Aware Imputation via Learning Missing Data Mechanisms [82.90843777097606]
  We propose a causally-aware imputation algorithm (MIRACLE) for missing data. MIRACLE iteratively refines the imputation of a baseline by simultaneously modeling the missingness generating mechanism. We conduct extensive experiments on synthetic and a variety of publicly available datasets to show that MIRACLE is able to consistently improve imputation.
  arXiv  Detail & Related papers  (2021-11-04T22:38:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.