The Causal Information Bottleneck and Optimal Causal Variable Abstractions

• URL: http://arxiv.org/abs/2410.00535v3
• Date: Tue, 11 Feb 2025 13:59:11 GMT
• Title: The Causal Information Bottleneck and Optimal Causal Variable Abstractions
• Authors: Francisco N. F. Q. Simoes, Mehdi Dastani, Thijs van Ommen,
• Abstract summary: The Information Bottleneck (IB) method is a widely used approach to construct variable abstractions. Traditional methods like IB are purely statistical and ignore underlying causal structures, making them ill-suited for causal tasks. We propose the Causal Information Bottleneck (CIB) which compresses a set of chosen variables while maintaining causal control over a target variable.
• Score: 0.19799527196428243
• License:
• Abstract: To effectively study complex causal systems, it is often useful to construct abstractions of parts of the system by discarding irrelevant details while preserving key features. The Information Bottleneck (IB) method is a widely used approach to construct variable abstractions by compressing random variables while retaining predictive power over a target variable. Traditional methods like IB are purely statistical and ignore underlying causal structures, making them ill-suited for causal tasks. We propose the Causal Information Bottleneck (CIB), a causal extension of the IB, which compresses a set of chosen variables while maintaining causal control over a target variable. This method produces abstractions of (sets of) variables which are causally interpretable, give us insight about the interactions between the abstracted variables and the target variable, and can be used when reasoning about interventions. We present experimental results demonstrating that the learned abstractions accurately capture causal relations as intended.

Related papers

• Structural Entropy Guided Probabilistic Coding [52.01765333755793]
  We propose a novel structural entropy-guided probabilistic coding model, named SEPC. We incorporate the relationship between latent variables into the optimization by proposing a structural entropy regularization loss. Experimental results across 12 natural language understanding tasks, including both classification and regression tasks, demonstrate the superior performance of SEPC.
  arXiv  Detail & Related papers  (2024-12-12T00:37:53Z)
• Targeted Cause Discovery with Data-Driven Learning [66.86881771339145]
  We propose a novel machine learning approach for inferring causal variables of a target variable from observations. We employ a neural network trained to identify causality through supervised learning on simulated data. Empirical results demonstrate the effectiveness of our method in identifying causal relationships within large-scale gene regulatory networks.
  arXiv  Detail & Related papers  (2024-08-29T02:21:11Z)
• On the Identification of Temporally Causal Representation with Instantaneous Dependence [50.14432597910128]
  Temporally causal representation learning aims to identify the latent causal process from time series observations. Most methods require the assumption that the latent causal processes do not have instantaneous relations. We propose an textbfIDentification framework for instantanetextbfOus textbfLatent dynamics.
  arXiv  Detail & Related papers  (2024-05-24T08:08:05Z)
• Causal Entropy and Information Gain for Measuring Causal Control [0.22252684361733285]
  We introduce causal versions of entropy and mutual information, termed causal entropy and causal information gain. These quantities capture changes in the entropy of a variable resulting from interventions on other variables. Fundamental results connecting these quantities to the existence of causal effects are derived.
  arXiv  Detail & Related papers  (2023-09-14T13:25:42Z)
• Structural restrictions in local causal discovery: identifying direct causes of a target variable [0.9208007322096533]
  Learning a set of direct causes of a target variable from an observational joint distribution is a fundamental problem in science. Here, we are only interested in identifying the direct causes of one target variable, not the full DAG. This allows us to relax the identifiability assumptions and develop possibly faster and more robust algorithms.
  arXiv  Detail & Related papers  (2023-07-29T18:31:35Z)
• A Causal Ordering Prior for Unsupervised Representation Learning [27.18951912984905]
  Causal representation learning argues that factors of variation in a dataset are, in fact, causally related. We propose a fully unsupervised representation learning method that considers a data generation process with a latent additive noise model.
  arXiv  Detail & Related papers  (2023-07-11T18:12:05Z)
• Systematic Evaluation of Causal Discovery in Visual Model Based Reinforcement Learning [76.00395335702572]
  A central goal for AI and causality is the joint discovery of abstract representations and causal structure. Existing environments for studying causal induction are poorly suited for this objective because they have complicated task-specific causal graphs. In this work, our goal is to facilitate research in learning representations of high-level variables as well as causal structures among them.
  arXiv  Detail & Related papers  (2021-07-02T05:44:56Z)
• Variational Causal Networks: Approximate Bayesian Inference over Causal Structures [132.74509389517203]
  We introduce a parametric variational family modelled by an autoregressive distribution over the space of discrete DAGs. In experiments, we demonstrate that the proposed variational posterior is able to provide a good approximation of the true posterior.
  arXiv  Detail & Related papers  (2021-06-14T17:52:49Z)
• Latent Causal Invariant Model [128.7508609492542]
  Current supervised learning can learn spurious correlation during the data-fitting process. We propose a Latent Causal Invariance Model (LaCIM) which pursues causal prediction.
  arXiv  Detail & Related papers  (2020-11-04T10:00:27Z)
• Causal learning with sufficient statistics: an information bottleneck approach [3.720546514089338]
  Methods extracting causal information from conditional independencies between variables of a system are common. We capitalize on the fact that the laws governing the generative mechanisms of a system often result in substructures embodied in the generative functional equation of a variable. We propose to use the Information Bottleneck method, a technique commonly applied for dimensionality reduction, to find underlying sufficient sets of statistics.
  arXiv  Detail & Related papers  (2020-10-12T00:20:01Z)

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.