Paper Overview
Field: AI Authors: Amartya Roy, Sonali Parbhoo Published: 2026-05-28 arXiv: 2605.27567
Problem
Causal discovery is a cornerstone of scientific reasoning, yet whether large language models can perform it reliably remains an open question. Recent benchmarks show that even fine-tuned models plateau on simple causal graphs and degrade as complexity grows — but why they fail has not been established.
Key Findings
- The failure is fundamental. Supervised fine-tuning (SFT), direct preference optimization (DPO), and in-context learning all produce predictors that cannot distinguish between causal graphs generating similar observational data.
- Kernel obstruction theorem. Any attempt to distinguish such graphs would require the model's internal representations to grow unboundedly, violating the very conditions under which these methods work. The limitation is intrinsic to the learning paradigm itself — not any particular model or dataset.
- A frozen language model serves as an interventional oracle, answering targeted queries.
- An external Bayesian loop concentrates belief over candidate causal graphs in logarithmic rounds.
- Because decisions operate outside the space where the kernel obstruction applies, A-CBO is provably convergent, while the underlying model remains unchanged.
Proposed Solution: A-CBO
The authors propose Agentic Causal Bayesian Optimization (A-CBO):
Results
On a new Extended Corr2Cause benchmark (24 variables, 18K test samples), A-CBO significantly outperforms fine-tuning and preference-optimization baselines.
---
*Auto-collected on 2026-05-29.*