EML-CD: Causal Mechanism Recovery via EML Symbolic Trees in Structure Learning

• URL: http://arxiv.org/abs/2606.05942v1
• Date: Thu, 04 Jun 2026 09:45:42 GMT
• Title: EML-CD: Causal Mechanism Recovery via EML Symbolic Trees in Structure Learning
• Abstract summary: We propose a framework that integrates the operator (capable of composing functions from a single binary operator) into causal structure learning.<n>-CD represents each edge mechanism as a gated binary tree and automatically discovers closed-form causal equations.<n> Analytical Jacobians can be directly computed from the output equations, enabling quantitative understanding of causal effects.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Neural network (NN)-based nonlinear causal discovery methods recover DAG structure but leave each causal mechanism as a black box. Waxman et al. argued that extracting causal mechanisms from NN weights is ill-posed. We propose EML-CD, a framework that integrates the EML operator (capable of composing elementary functions from a single binary operator) into causal structure learning, with interpretable mechanism recovery as the primary objective. EML-CD represents each edge mechanism as a gated EML binary tree and automatically discovers closed-form causal equations. Analytical Jacobians can be directly computed from the output equations, enabling quantitative understanding of causal effects. On real data (Sachs protein signaling, d=11), EML-CD achieves SHD=11.2 +/- 0.4 (5-seed mean; baselines are single deterministic runs), on par with PC/GES within seed variance and below CAM, while attaching closed-form equations to each detected edge (precision 0.756, recall 0.365). In a controlled bivariate test with known mechanisms, EML-CD recovers 10 of 11 elementary function families faithfully (held-out shape correlation >= 0.96; only high-frequency sine is partial). On a symbolic synthetic benchmark, EML-CD attains a substantially lower and more stable held-out mechanism f-MSE than a fixed SINDy dictionary (mean 3.67 vs. 7644, the latter inflated by catastrophic extrapolation on one seed), although its structure recovery (SHD 14.0) only matches the dictionary and stays below specialized optimizers; on the Causal Chambers light-tunnel subset, a depth-2 model improves F1 over linear OLS-BIC (0.444 vs. 0.273).

Related papers

• The Dark Regulome: Disentangling Predictability from Regulation in Genomic Foundation Models [0.0]
  High-grade gliomas integrate into neural circuits through functional synapses with neurons.<n>The regulatory program written across the dark genome is the natural substrate to probe.<n>We introduce a residualization-and-permutation diagnostic that separates predictability-driven from regulation-driven RIS variance.
  arXiv  Detail & Related papers  (2026-06-05T02:20:12Z)
• Convergence Theory for Iterative LLM-Based Neural Architecture Search: A Parametric Cross-Entropy Framework with Closed-Form Proxy Reliability [48.83701310501069]
  Large language models (LLMs) are increasingly used as generators in iterative neural architecture search (NAS)<n>We model iterative LLM-NAS as a parametric Cross-Entropy (CE) method over executable programs.<n>We prove six results: (1) iterative LLM fine-tuning on elite architectures is equivalent to the CE update restricted to the LLM family; (2) expected architecture quality is monotonically non-decreasing across cycles; and (3) elite-set probability converges to a fixed point at a geometric rate.
  arXiv  Detail & Related papers  (2026-05-28T15:45:19Z)
• Influence-Guided Symbolic Regression: Scientific Discovery via LLM-Driven Equation Search with Granular Feedback [56.69850045068714]
  We introduce textitInfluence-Guided Regression (IGSR), a method that frames equation discovery as an iterative two-step process.<n>We demonstrate IGSRs effectiveness on a diverse suite of benchmarks, including LLM-SRBench, pharmacological PKPD models, an epidemiological simulation, and real-world genomic data.
  arXiv  Detail & Related papers  (2026-05-27T23:48:01Z)
• CasualSynth: Generating Structurally Sound Synthetic Data [44.80087038178069]
  Large Language Models (LLMs) generate realistic synthetic data but offer no guarantee that their outputs respect the causal mechanisms governing the target domain.<n>We introduce Causal Synth, a framework that decouples causal structure generation from semantic realization, yielding synthetic data that is both causally valid and linguistically rich.
  arXiv  Detail & Related papers  (2026-05-17T16:21:01Z)
• Rethinking Molecular OOD Generalization via Target-Aware Source Selection [10.102858221967791]
  SCOPE-BENCH is a benchmark built on cluster-level partitioning in an explicit physicochemical descriptor space.<n>POMA is a framework that formulates knowledge transfer as a retrieve-compose-adapt pipeline.<n> Evaluations show that prediction errors of state-of-the-art 3D molecular models surge by up to 8.0x on SCOPE-BENCH with a mean of 5.9x.
  arXiv  Detail & Related papers  (2026-05-13T16:09:46Z)
• PRIM: Meta-Learned Bayesian Root Cause Analysis [6.537088094470879]
  We introduce PRIM (Prior-fitted Root cause Identification with Meta-learning), a causal meta-learning approach.<n> PRIM implicitly identifies changes in the data-generating mechanism between baseline and anomalous periods.<n>It infers distributional differences without explicit statistical testing, and implicitly learns causal structure without model fitting at test time.
  arXiv  Detail & Related papers  (2026-05-09T08:14:09Z)
• Hardware-Efficient Neuro-Symbolic Networks with the Exp-Minus-Log Operator [0.0]
  Sheffer operator, eml(x, y) = exp(x) - ln(y), was shown by Odwolek (2026) to be sufficient to express every standard elementary function as a binary tree of identical nodes.<n>We embed primitives inside conventional DNN architectures, yielding a hybrid-EML model in which the trunk learns distributed representations and the head is a depth-bounded, weight-sparse tree.<n>We derive the forward equations, prove computational-cost bounds, analyse inference and training acceleration relative to multilayer perceptrons (MLPs) and physics-informed neural networks
  arXiv  Detail & Related papers  (2026-04-15T13:34:10Z)
• MAT-Cell: A Multi-Agent Tree-Structured Reasoning Framework for Batch-Level Single-Cell Annotation [81.82645086402366]
  We propose MAT-Cell, a neuro-symbolic reasoning framework that reframes single-cell analysis into constructive, verifiable proof generation.<n> MAT-Cell injects symbolic constraints through adaptive Retrieval-Augmented Generation (RAG) to ground neural reasoning in biological axioms and reduce transcriptomic noise.<n>It significantly outperforms state-of-the-art (SOTA) models and maintains robust per-formance in challenging scenarios.
  arXiv  Detail & Related papers  (2026-04-07T04:56:06Z)
• Learning Identifiable Structures Helps Avoid Bias in DNN-based Supervised Causal Learning [56.22841701016295]
  Supervised Causal Learning (SCL) is an emerging paradigm in this field.<n>Existing Deep Neural Network (DNN)-based methods commonly adopt the "Node-Edge approach"
  arXiv  Detail & Related papers  (2025-02-15T19:10:35Z)
• MIRACLE: Causally-Aware Imputation via Learning Missing Data Mechanisms [82.90843777097606]
  We propose a causally-aware imputation algorithm (MIRACLE) for missing data. MIRACLE iteratively refines the imputation of a baseline by simultaneously modeling the missingness generating mechanism. We conduct extensive experiments on synthetic and a variety of publicly available datasets to show that MIRACLE is able to consistently improve imputation.
  arXiv  Detail & Related papers  (2021-11-04T22:38:18Z)

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.