A Recursive Decomposition Framework for Causal Structure Learning in the Presence of Latent Variables

• URL: http://arxiv.org/abs/2605.10651v1
• Date: Mon, 11 May 2026 14:36:52 GMT
• Title: A Recursive Decomposition Framework for Causal Structure Learning in the Presence of Latent Variables
• Abstract summary: Constraint-based causal discovery is widely used for learning causal structures, but heavy reliance on conditional independence (CI) testing makes it computationally expensive in high-dimensional settings.<n>We show that divide-and-conquer strategies can be theoretically generalized beyond causal sufficiency to settings with latent variables.
• Score: 10.358342291086073
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Constraint-based causal discovery is widely used for learning causal structures, but heavy reliance on conditional independence (CI) testing makes it computationally expensive in high-dimensional settings. To mitigate this limitation, many divide-and-conquer frameworks have been proposed, but most assume causal sufficiency, i.e., no latent variables. In this paper, we show that divide-and-conquer strategies can be theoretically generalized beyond causal sufficiency to settings with latent variables. Specifically, we propose a recursive decomposition framework, termed DiCoLa, that enables divide-and-conquer causal discovery in the presence of latent variables. It recursively decomposes the global learning task into smaller subproblems and integrates their solutions through a principled reconstruction step to recover the global structure. We theoretically establish the soundness and completeness of the proposed framework. Extensive experiments on synthetic data demonstrate that our approach significantly improves computational efficiency across a range of causal discovery algorithms, while experiments on a real-world dataset further illustrate its practical effectiveness.

Related papers

• CDFM: Towards a General-Purpose Causal Discovery Foundation Model [62.32138962508216]
  Causal discovery is the process of recovering underlying causal structures from observational data.<n>We formulate the Causal Discovery Foundation Model (CDFM) as a unified, general-purpose framework for zero-shot structural inference.<n>CDFM consistently outperforms traditional algorithms, driving a paradigm shift toward a general-purpose causal discovery foundation model.
  arXiv  Detail & Related papers  (2026-07-13T12:58:28Z)
• 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)
• Identifiable Multimodal Causal Representation Learning under Partial Latent Sharing [4.400865943835067]
  Causal representation learning seeks to uncover meaningful latent variables and their corresponding causal structure from observational data.<n>Proving identifiability in CRL is intrinsically difficult, and we address in this work an even more challenging setting: multimodality.<n>We consider multimodal observed data with a latent partially shared structure. Each modality is generated, through non linear mixing functions, from a specific subset of causal latent variables.<n>Our identifiability results, furthermore, apply to the undercomplete scenario where we have, for each modality, more observed than latent variables.
  arXiv  Detail & Related papers  (2026-05-18T21:34:29Z)
• All Circuits Lead to Rome: Rethinking Functional Anisotropy in Circuit and Sheaf Discovery for LLMs [61.02007370456733]
  We show that a single task can be supported by multiple, structurally distinct circuits or sheaves that are simultaneously faithful, sparse, and complete.<n>We propose a Distributive Circuit Hypothesis and provide a theoretical analysis demonstrating that non-unique, low-overlap circuit explanations arise naturally from high-dimensional superposition.
  arXiv  Detail & Related papers  (2026-05-12T19:21:23Z)
• Causal Discovery for Cross-Sectional Data Based on Super-Structure and Divide-and-Conquer [9.740161937852067]
  We propose a novel framework that relaxes the strict requirements on Super-Structure construction while preserving the algorithmic benefits of divide-and-conquer.<n>We instantiate the framework in a concrete causal discovery algorithm and rigorously evaluate its components on synthetic data.<n>Our results establish that accurate, scalable causal discovery is achievable even under minimal assumptions about the initial Super-Structure.
  arXiv  Detail & Related papers  (2026-02-03T16:18:17Z)
• Efficient Causal Structure Learning via Modular Subgraph Integration [4.803851977437455]
  We introduce VISTA, a modular framework that decomposes the global causal structure learning problem into local subgraphs based on Blankets.<n>The framework is model-agnostic, imposing no assumptions on the inductive biases of base learners, is compatible with arbitrary data settings, and fully supports parallelization.<n>Extensive experiments on both synthetic and real datasets consistently demonstrate the effectiveness of VISTA.
  arXiv  Detail & Related papers  (2026-01-28T20:13:20Z)
• Mixture of Ranks with Degradation-Aware Routing for One-Step Real-World Image Super-Resolution [76.66229730098759]
  In real-world image super-resolution (Real-ISR), existing approaches mainly rely on fine-tuning pre-trained diffusion models.<n>We propose a Mixture-of-Ranks (MoR) architecture for single-step image super-resolution.<n>We introduce a fine-grained expert partitioning strategy that treats each rank in LoRA as an independent expert.
  arXiv  Detail & Related papers  (2025-11-20T04:11:44Z)
• Step-Aware Policy Optimization for Reasoning in Diffusion Large Language Models [57.42778606399764]
  Diffusion language models (dLLMs) offer a promising, non-autoregressive paradigm for text generation.<n>Current reinforcement learning approaches often rely on sparse, outcome-based rewards.<n>We argue that this stems from a fundamental mismatch with the natural structure of reasoning.
  arXiv  Detail & Related papers  (2025-10-02T00:34:15Z)
• The Curse of CoT: On the Limitations of Chain-of-Thought in In-Context Learning [56.574829311863446]
  Chain-of-Thought (CoT) prompting has been widely recognized for its ability to enhance reasoning capabilities in large language models (LLMs)<n>We demonstrate that CoT and its reasoning variants consistently underperform direct answering across varying model scales and benchmark complexities.<n>Our analysis uncovers a fundamental hybrid mechanism of explicit-implicit reasoning driving CoT's performance in pattern-based ICL.
  arXiv  Detail & Related papers  (2025-04-07T13:51:06Z)
• Discovering and Reasoning of Causality in the Hidden World with Large Language Models [109.62442253177376]
  We develop a new framework termed Causal representatiOn AssistanT (COAT) to propose useful measured variables for causal discovery.<n>Instead of directly inferring causality with Large language models (LLMs), COAT constructs feedback from intermediate causal discovery results to LLMs to refine the proposed variables.
  arXiv  Detail & Related papers  (2024-02-06T12:18:54Z)
• A Versatile Causal Discovery Framework to Allow Causally-Related Hidden Variables [28.51579090194802]
  We introduce a novel framework for causal discovery that accommodates the presence of causally-related hidden variables almost everywhere in the causal network. We develop a Rank-based Latent Causal Discovery algorithm, RLCD, that can efficiently locate hidden variables, determine their cardinalities, and discover the entire causal structure over both measured and hidden ones. Experimental results on both synthetic and real-world personality data sets demonstrate the efficacy of the proposed approach in finite-sample cases.
  arXiv  Detail & Related papers  (2023-12-18T07:57:39Z)
• Advancing Counterfactual Inference through Nonlinear Quantile Regression [77.28323341329461]
  We propose a framework for efficient and effective counterfactual inference implemented with neural networks. The proposed approach enhances the capacity to generalize estimated counterfactual outcomes to unseen data. Empirical results conducted on multiple datasets offer compelling support for our theoretical assertions.
  arXiv  Detail & Related papers  (2023-06-09T08:30:51Z)
• Learning a Structural Causal Model for Intuition Reasoning in Conversation [20.243323155177766]
  Reasoning, a crucial aspect of NLP research, has not been adequately addressed by prevailing models. We develop a conversation cognitive model ( CCM) that explains how each utterance receives and activates channels of information. By leveraging variational inference, it explores substitutes for implicit causes, addresses the issue of their unobservability, and reconstructs the causal representations of utterances through the evidence lower bounds.
  arXiv  Detail & Related papers  (2023-05-28T13:54:09Z)
• A Recursive Markov Boundary-Based Approach to Causal Structure Learning [22.38302412440357]
  We propose a novel recursion-based method for causal structure learning. It significantly reduces the required number of conditional independence tests. Our experimental results show that the proposed algorithm outperforms state-of-the-art both on synthetic and real-world structures.
  arXiv  Detail & Related papers  (2020-10-10T13:26:22Z)
• Polynomial-Time Exact MAP Inference on Discrete Models with Global Dependencies [83.05591911173332]
  junction tree algorithm is the most general solution for exact MAP inference with run-time guarantees. We propose a new graph transformation technique via node cloning which ensures a run-time for solving our target problem independently of the form of a corresponding clique tree.
  arXiv  Detail & Related papers  (2019-12-27T13:30:29Z)

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.