mlsanityData to 14 Oct 2026

Context-Specific Independence in Bayesian Networks

arXiv 1302.3562 ↗First posted 13 Feb 2013cs.AIcited by 43

Not on the map. Why?

Abstract (arXiv)

Bayesian networks provide a language for qualitatively representing the conditional independence properties of a distribution. This allows a natural and compact representation of the distribution, eases knowledge acquisition, and supports effective inference algorithms. It is well-known, however, that there are certain independencies that we cannot capture qualitatively within the Bayesian network structure: independencies that hold only in certain contexts, i.e., given a specific assignment of values to certain variables. In this paper, we propose a formal notion of context-specific independence (CSI), based on regularities in the conditional probability tables (CPTs) at a node. We present a technique, analogous to (and based on) d-separation, for determining when such independence holds in a given network. We then focus on a particular qualitative representation scheme - tree-structured CPTs - for capturing CSI. We suggest ways in which this representation can be used to support effective inference algorithms. In particular, we present a structural decomposition of the resulting network which can improve the performance of clustering algorithms, and an alternative algorithm based on cutset conditioning.

Key facts. Cited by 43 papers in the map (data through 14 Oct 2026). First posted on arXiv 13 Feb 2013.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 11; 2022: 8; 2023: 5; 2024: 10; 2025: 5; 2026: 4.

43 papers.

Sort:

By area:

  1. 2023Explaining Predictive Uncertainty with Information Theoretic Shapley Valuescited by 36
  2. 2022Causal Inference Using Tractable Circuitscited by 12
  3. 2024Fine-Grained Causal Dynamics Learning with Quantization for Improving Robustness in Reinforcement Learningcited by 11
  4. 2021Context-Specific Causal Discovery for Categorical Data Using Staged Treescited by 10
  5. 2024SkiLD: Unsupervised Skill Discovery Guided by Factor Interactionscited by 9
  6. 2021Staged trees and asymmetry-labeled DAGscited by 8
  7. 2021Context-Specific Representation Abstraction for Deep Option Learningcited by 8
  8. 2021Causal Effect Identification with Context-specific Independence Relations of Control Variablescited by 8
  9. 2022Structural Learning of Simple Staged Treescited by 7
  10. 2022Highly Efficient Structural Learning of Sparse Staged Treescited by 6
  11. 2023Causal Imitability Under Context-Specific Independence Relationscited by 6
  12. 2024Efficient Monte Carlo Tree Search via On-the-Fly State-Conditioned Action Abstractioncited by 6
31 more
  1. 2024Pointwise Mutual Information as a Performance Gauge for Retrieval-Augmented Generationcited by 6
  2. 2025Null Counterfactual Factor Interactions for Goal-Conditioned Reinforcement Learningcited by 6
  3. 2024Automated Discovery of Functional Actual Causes in Complex Environmentscited by 4
  4. 2024On Discovery of Local Independence over Continuous Variables via Neural Contextual Decompositioncited by 4
  5. 2021Graphical Models with Attention for Context-Specific Independence and an Application to Perceptual Groupingcited by 3
  6. 2022cegpy: Modelling with Chain Event Graphs in Pythoncited by 3
  7. 2024On the Expressive Power of Tree-Structured Probabilistic Circuitscited by 3
  8. 2025Algorithmic causal structure emerging through compressioncited by 3
  9. 2021Structure Learning of Contextual Markov Networks using Marginal Pseudo-likelihoodcited by 2
  10. 2021Scalable Bayesian Network Structure Learning with Splinescited by 2
  11. 2022Influence-Augmented Local Simulators: A Scalable Solution for Fast Deep RL in Large Networked Systemscited by 2
  12. 2023Learning and interpreting asymmetry-labeled DAGs: a case study on COVID-19 fearcited by 2
  13. 2021Context-Specific Likelihood Weightingcited by 1
  14. 2021Explaining Deep Tractable Probabilistic Models: The sum-product network casecited by 1
  15. 2021flip-hoisting: Exploiting Repeated Parameters in Discrete Probabilistic Programscited by 1
  16. 2021NOTMAD: Estimating Bayesian Networks with Sample-Specific Structures and Parameterscited by 1
  17. 2022Principled Diverse Counterfactuals in Multilinear Modelscited by 1
  18. 2024The diameter of a stochastic matrix: A new measure for sensitivity analysis in Bayesian networkscited by 1
  19. 2022First-Order Context-Specific Likelihood Weighting in Hybrid Probabilistic Logic Programscited by 0
  20. 2022Beyond Conjugacy for Chain Event Graph Model Selectioncited by 0
  21. 2023Context-specific kernel-based hidden Markov model for time series analysiscited by 0
  22. 2023Learning Minimalistic Tsetlin Machine Clauses with Markov Boundary-Guided Pruningcited by 0
  23. 2024Scalable Structure Learning for Sparse Context-Specific Systemscited by 0
  24. 2024Context-Specific Refinements of Bayesian Network Classifierscited by 0
  25. 2025BayesL: a Logical Framework for the Verification of Bayesian Networkscited by 0
  26. 2025stCEG: An R Package for Modelling Events over Spatial Areas Using Chain Event Graphscited by 0
  27. 2025On the Granularity of Causal Effect Identifiabilitycited by 0
  28. 2026Partially Observed Structural Causal Modelscited by 0
  29. 2026Causal Modeling of Selection in Evolutioncited by 0
  30. 2026Algebraic Signatures for Structural Learning in Probability Tensorscited by 0
  31. 2026Causal Modeling of Adverse Pregnancy Outcomes via Adaptive LLM Proposalscited by 0