Paper Overview
Field: AI Authors: Amartya Roy, Sonali Parbhoo arXiv: 2605.27567
Key Points
- The problem: Causal discovery is a cornerstone of scientific reasoning, but recent benchmarks show even fine-tuned LLMs plateau on simple causal graphs and degrade as complexity grows — with no established explanation of why.
- Core result: The failure is proven to be fundamental. Supervised fine-tuning (SFT), direct preference optimization (DPO), and in-context learning all yield predictors that cannot distinguish between causal graphs generating similar observational data.
- Kernel obstruction theorem: Any attempt to separate such graphs would require the model's internal representations to grow unboundedly, violating the very conditions under which these training methods work. The limitation is intrinsic to the learning paradigm, not to any particular model or dataset.
- Proposed solution — Agentic Causal Bayesian Optimization (A-CBO):
- A frozen language model serves as an interventional oracle, answering targeted queries.
- An external Bayesian loop concentrates belief over candidate causal graphs in log rounds.
- Because decisions operate outside the space where the kernel obstruction applies, A-CBO is provably convergent while the underlying model stays unchanged.
- Empirical validation: On a new Extended Corr2Cause benchmark (24 variables, 18K test samples), A-CBO significantly outperforms fine-tuning and preference-optimization baselines.
Takeaway
Instead of trying to train causal reasoning into LLMs — which the theorem shows is fundamentally blocked — A-CBO repositions the LLM as a queryable interventional oracle within an external Bayesian optimization loop, achieving provable convergence and stronger causal-discovery performance.
---
*Auto-collected on 2026-05-29*