Efficient computation of counterfactual bounds
From MaRDI portal
Publication:6577658
DOI10.1016/J.IJAR.2023.109111MaRDI QIDQ6577658
Rafael Cabañas, Dario Filippo Azzimonti, Alessandro Antonucci, M. Zaffalon, David E. Huber
Publication date: 24 July 2024
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
counterfactualsimprecise probabilitycredal networkspartial identifiabilitycausal analysisexpectation maximisationstructural causal models
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of propositional and relational credal networks
- Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks
- On the convergence properties of the EM algorithm
- Note on the consistency of the maximum likelihood estimate for nonidentifiable distributions
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- Probabilities of causation: Three counterfactual interpretations and their identification
- Credal networks
- Thirty years of credal networks: specification, algorithms and complexity
- Approximate credal network updating by linear programming with applications to decision making
- Bounds on Treatment Effects From Studies With Imperfect Compliance
- Probabilistic Inference in Credal Networks: New Complexity Results
- Causality for Machine Learning
- Approximating counterfactual bounds while fusing observational, biased and randomised data sources
- A General Method for Deriving Tight Symbolic Bounds on Causal Effects
Related Items (1)
This page was built for publication: Efficient computation of counterfactual bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6577658)
