Multi-Domain Empirical Bayes for Linearly-Mixed Causal Representations

• URL: http://arxiv.org/abs/2603.18404v2
• Date: Sat, 21 Mar 2026 06:34:03 GMT
• Title: Multi-Domain Empirical Bayes for Linearly-Mixed Causal Representations
• Abstract summary: Causal representation learning aims to learn low-dimensional causal latent variables from high-dimensional observations.<n>In this paper, we explore the use of empirical Bayes (EB) to estimate causal representations.<n>We propose an EB $f$-modeling algorithm that improves the quality of learned causal variables by exploiting invariant structure within and across domains.
• Score: 25.271622796201815
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Causal representation learning (CRL) aims to learn low-dimensional causal latent variables from high-dimensional observations. While identifiability has been extensively studied for CRL, estimation has been less explored. In this paper, we explore the use of empirical Bayes (EB) to estimate causal representations. In particular, we consider the problem of learning from data from multiple domains, where differences between domains are modeled by interventions in a shared underlying causal model. Multi-domain CRL naturally poses a simultaneous inference problem that EB is designed to tackle. Here, we propose an EB $f$-modeling algorithm that improves the quality of learned causal variables by exploiting invariant structure within and across domains. Specifically, we consider a linear measurement model and interventional priors arising from a shared acyclic SCM. When the graph and intervention targets are known, we develop an EM-style algorithm based on causally structured score matching. We further discuss EB $g$-modeling in the context of existing CRL approaches. In experiments on synthetic data, our proposed method achieves more accurate estimation than other methods for CRL.

Related papers

• Causal Ensemble Agent: Hierarchical Causal Discovery with LLM-guided Expert Reweighting [95.24017293537025]
  Causal Ensemble Agent (CEA) is a novel framework that aggregates structural insights from statistical discovery experts across different graph levels.<n>CEA achieves the strongest overall performance across a wide range of causal discovery methods.
  arXiv  Detail & Related papers  (2026-06-09T09:09:07Z)
• Group Interventions on Deep Networks for Causal Discovery in Subsystems [9.239779358333182]
  Causal discovery uncovers complex relationships between variables, enhancing predictions, decision-making, and insights into real-world systems.<n>We introduce gCDMI, a novel multi-group causal discovery method that leverages group-level interventions on trained deep neural networks.<n>We evaluate our method on simulated datasets, demonstrating its superior performance compared to existing methods.
  arXiv  Detail & Related papers  (2025-10-27T22:26:20Z)
• Causal Discovery for Linear DAGs with Dependent Latent Variables via Higher-order Cumulants [7.808674222118538]
  Existing methods assume mutually independent latent confounders or cannot properly handle models with causal relationships among observed variables.<n>We propose a novel algorithm that identifies causal DAGs in LvLiNGAM, allowing causal structures among latent variables, among observed variables, and between the two.
  arXiv  Detail & Related papers  (2025-10-16T15:15:20Z)
• Causal Mechanism Estimation in Multi-Sensor Systems Across Multiple Domains [34.02899134427814]
  We present a novel three-step approach to inferring causal mechanisms from heterogeneous data collected across multiple domains.<n>By leveraging the principle of Causal Transfer Learning (CTL), CICME is able to reliably detect domain-invariant causal mechanisms when provided with sufficient samples.<n>We show that CICME leverages the benefits of applying causal discovery on the pooled data and repeatedly on data from individual domains, and it even outperforms both baseline methods under certain scenarios.
  arXiv  Detail & Related papers  (2025-07-23T10:35:37Z)
• On the Identifiability of Causal Abstractions [15.785002371773139]
  Causal representation learning enhances machine learning models' robustness and generalizability.<n>We focus on a family of CRL methods that uses contrastive data pairs in the observable space to identify the latent causal model.<n>We introduce a theoretical framework that calculates the degree to which we can identify a causal model, given a set of possible interventions.
  arXiv  Detail & Related papers  (2025-03-13T19:34:05Z)
• Multi-View Causal Discovery without Non-Gaussianity: Identifiability and Algorithms [59.15672758767244]
  Causal discovery is a difficult problem that typically relies on strong assumptions on the data-generating model, such as non-Gaussianity.<n>Here, we leverage this multi-view structure to achieve causal discovery with weak assumptions.<n>We propose several multi-view causal discovery algorithms, inspired by single-view algorithms.
  arXiv  Detail & Related papers  (2025-02-27T14:06:14Z)
• DCID: Deep Canonical Information Decomposition [84.59396326810085]
  We consider the problem of identifying the signal shared between two one-dimensional target variables. We propose ICM, an evaluation metric which can be used in the presence of ground-truth labels. We also propose Deep Canonical Information Decomposition (DCID) - a simple, yet effective approach for learning the shared variables.
  arXiv  Detail & Related papers  (2023-06-27T16:59:06Z)
• A step towards the applicability of algorithms based on invariant causal learning on observational data [0.0]
  In this paper, we show how to apply Invariant Causal Prediction (ICP) efficiently integrated with causal discovery methods. We also show how to apply ICP efficiently integrated with our method for causal discovery.
  arXiv  Detail & Related papers  (2023-04-05T08:15:57Z)
• GEC: A Unified Framework for Interactive Decision Making in MDP, POMDP, and Beyond [101.5329678997916]
  We study sample efficient reinforcement learning (RL) under the general framework of interactive decision making. We propose a novel complexity measure, generalized eluder coefficient (GEC), which characterizes the fundamental tradeoff between exploration and exploitation. We show that RL problems with low GEC form a remarkably rich class, which subsumes low Bellman eluder dimension problems, bilinear class, low witness rank problems, PO-bilinear class, and generalized regular PSR.
  arXiv  Detail & Related papers  (2022-11-03T16:42:40Z)
• Learning Neural Causal Models with Active Interventions [83.44636110899742]
  We introduce an active intervention-targeting mechanism which enables a quick identification of the underlying causal structure of the data-generating process. Our method significantly reduces the required number of interactions compared with random intervention targeting. We demonstrate superior performance on multiple benchmarks from simulated to real-world data.
  arXiv  Detail & Related papers  (2021-09-06T13:10:37Z)
• Counterfactual Maximum Likelihood Estimation for Training Deep Networks [83.44219640437657]
  Deep learning models are prone to learning spurious correlations that should not be learned as predictive clues. We propose a causality-based training framework to reduce the spurious correlations caused by observable confounders. We conduct experiments on two real-world tasks: Natural Language Inference (NLI) and Image Captioning.
  arXiv  Detail & Related papers  (2021-06-07T17:47:16Z)

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.