HCP-DCNet: A Hierarchical Causal Primitive Dynamic Composition Network for Self-Improving Causal Understanding

Abstract

The ability to understand and reason about cause and effect -- encompassing interventions, counterfactuals, and underlying mechanisms -- is a cornerstone of robust artificial intelligence. While deep learning excels at pattern recognition, it fundamentally lacks a model of causality, making systems brittle under distribution shifts and unable to answer ``what-if'' questions. This paper introduces the \emph{Hierarchical Causal Primitive Dynamic Composition Network (HCP-DCNet)}, a unified framework that bridges continuous physical dynamics with discrete symbolic causal inference. Departing from monolithic representations, HCP-DCNet decomposes causal scenes into reusable, typed \emph{causal primitives} organized into four abstraction layers: physical, functional, event, and rule. A dual-channel routing network dynamically composes these primitives into task-specific, fully differentiable \emph{Causal Execution Graphs (CEGs)}. Crucially, the system employs a \emph{causal-intervention-driven meta-evolution} strategy, enabling autonomous self-improvement through a constrained Markov decision process. We establish rigorous theoretical guarantees, including type-safe composition, routing convergence, and universal approximation of causal dynamics. Extensive experiments across simulated physical and social environments demonstrate that HCP-DCNet significantly outperforms state-of-the-art baselines in causal discovery, counterfactual reasoning, and compositional generalization. This work provides a principled, scalable, and interpretable architecture for building AI systems with human-like causal abstraction and continual self-refinement capabilities.

Figures (2)

• Figure 1: System architecture of HCP-DCNet. Raw multimodal observations are processed by the Perception Engine into structured causal queries. The Primitive Library (Sec. III) supplies a hierarchical set of reusable causal primitives. The Dual-Channel Router (Sec. IV) dynamically selects and composes these primitives into a Causal Execution Graph (CEG) specification by fusing symbolic constraints from the Knowledge Graph with subsymbolic attentional patterns. This specification is executed by the differentiable Hybrid CEG Engine (Sec. V) to generate causal graphs and counterfactual predictions. The Meta-Evolution Controller (Sec. VI) closes the loop by analyzing performance from the Performance Log, proposing improvements to the primitive library and router, and updating the knowledge graph—enabling continual self-optimization. Arrows indicate the primary flow of data and control.
• Figure 2: Experimental results comparing HCP-DCNet with state-of-the-art baselines across four key metrics. (a) Causal Graph Accuracy measured by Structural Hamming Distance (SHD, lower is better). HCP-DCNet achieves significantly lower SHD, indicating more accurate causal structure discovery. (b) Counterfactual Prediction Accuracy (CF-Acc, higher is better). HCP-DCNet shows superior performance in counterfactual reasoning tasks. (c) Compositional Generalization Score (CG-Score, higher is better) on novel combinations of causal primitives. HCP-DCNet demonstrates strong out-of-distribution generalization. (d) Inference Time in milliseconds (lower is better). While HCP-DCNet has higher computational cost due to its hierarchical routing, it remains practical for real-time applications. Error bars represent standard deviation over 5 random seeds. Ablation studies (HCP w/o Meta) highlight the importance of meta-evolution for optimal performance.

Theorems & Definitions (44)

• Definition 1: Causal Primitive
• Definition 2: Hierarchical Primitive Layers
• Remark 1
• Definition 3: Causal Primitive Algebra
• Definition 4: Causal Type System
• Theorem 3.1: Type-Safe Composition
• proof : Proof Sketch
• Remark 2
• Definition 5: Primitive Implementation
• Remark 3