From Local to Cluster: A Unified Framework for Causal Discovery with Latent Variables
arXiv cs.AI / 4/27/2026
💬 OpinionIdeas & Deep AnalysisModels & Research
Key Points
- The paper addresses how latent variables complicate causal discovery, noting that existing local and cluster-level approaches each have key limitations (e.g., needing known clusters or assuming causal sufficiency).
- It introduces L2C (Local to Cluster Causal Abstraction), which automatically discovers how micro variables should be partitioned into clusters using local causal patterns rather than requiring manual cluster assignments.
- L2C uses a cluster reduction theorem to compress each cluster to at most three nodes without losing causal information, then performs local causal discovery to learn direct causes, effects, and V-structures under latent-variable settings.
- At the macro level, it constructs a cluster graph and applies cluster-level calculus to perform causal inference, explicitly avoiding causal-sufficiency assumptions by handling latent variables locally.
- Theoretical results claim soundness, atomic completeness, and computational efficiency, and experiments on both synthetic and real data report accurate cluster recovery and improved macro causal effect identification versus baselines.
Related Articles

Legal Insight Transformation: 7 Mistakes to Avoid When Adopting AI Tools
Dev.to

Legal Insight Transformation: Traditional vs. AI-Driven Research Compared
Dev.to

Legal Insight Transformation: A Beginner's Guide to Modern Research
Dev.to
I tested the same prompt across multiple AI models… the differences surprised me
Reddit r/artificial

The five loops between AI coding and AI engineering
Dev.to