arXiv:2606. 17516v1 Announce Type: cross Abstract: Causal discovery from observational data remains challenging due to the need to recover directed structure and latent confounding without interventions.
By Patrick Bl\"obaum, Krishnakumar Balasubramanian, Shiva Prasad Kasiviswanathan
arXiv:2608. 03868v1 Announce Type: cross Abstract: Causal Discovery (CD) from observational data faces two fundamental challenges.
By Abhinav Thorat, Ravi Kumar Kolla, Vishak K Bhat, Harsh Vardhan Singh Chauhan, Niranjan Pedanekar
arXiv:2606. 23880v1 Announce Type: new Abstract: From climate teleconnections to gene regulation, modern time-series datasets encompass tens or hundreds of interacting variables, making causal discovery increasingly challenging.
By Mohammad Fesanghary, Abhinav Havaldar
arXiv:2607. 11508v1 Announce Type: cross Abstract: Causal discovery, the process of recovering underlying causal structures from observational data, is a fundamental pursuit across scientific disciplines.
By Jie Qiao, Ruichu Cai, Zijian Li, Weilin Chen, Pengfei Hua, Boyan Xu, Zhengming Chen, Zhifeng Hao, Peng Cui
arXiv:2609.06941v1 Announce Type: new
Abstract: Causal effect estimation asks how an outcome would change under an intervention, and medicine, economics, and public policy all treat it as a foundatio...
By Haohao Zhou
The paper argues that the causality of language models may be unnecessary or suboptimal when system behavior—extra dominant factors beyond data distribution—is treated as a first‑principle Bayesian feature. It introduces the SBD framework, incorporating system behavior into the evidence lower bound, and demonstrates a counter‑intuitive Causality Tax where ignoring these factors leads to structural error. Using a non‑causal variational family called Green Shell, the authors show through theoretical bounds, implicit measurements, and Neural Tangent Kernel analysis that this approach yields tighter error bounds and improved generalization compared to causal models.
By Xianzhi Zeng, Jiangneng Li, Gao Cong
Large language models increasingly operate as tool-using agents, where small format, argument, or function-call errors can invalidate otherwise plausible responses. We study inference-time feed-forward network (FFN) intervention for improving structured outputs without retraining model weights.
TabCausal is a causal discovery foundation model that learns to map datasets directly to causal graphs by pretraining across diverse causal environments. It uses a dynamic task construction strategy to expose the model to varied graph priors, mechanisms, noise models, dimensions, sample sizes, and intervention regimes, improving transferability from observational and mixed‑interventional data. On large synthetic benchmarks and a new protocol‑guided semantic benchmark, TabCausal outperforms many classical baselines and shows robust structure recovery, especially when interventional evidence is available.
By Zi-Rong Li, Si-Yang Liu, Tian-Zuo Wang, Han-Jia Ye
arXiv:2607. 11183v2 Announce Type: cross Abstract: Large language models increasingly operate as tool-using agents, where small format, argument, or function-call errors can invalidate otherwise plausible responses.
By Sheng Xu, Junhua Wang, Boyuan Huang, Ke Jia, Jiadun Zhu, Zhen Chen
arXiv:2606. 19610v1 Announce Type: cross Abstract: Recent work on Kan-Do-Calculus (KDC) has established that the boundary between passive observation and active intervention in causal inference is a category-theoretic bi-adjunction, with interventions modeled by left Kan extensions and conditioning by right Kan extensions.
By Sridhar Mahadevan
arXiv:2603. 10254v2 Announce Type: replace Abstract: Synthetic tabular data generation addresses data scarcity and privacy constraints in a variety of domains.
By Davide Tugnoli, Andrea De Lorenzo, Marco Virgolin, Giovanni Cin\`a
The paper evaluates four main approaches to scalable nonlinear causal discovery—differentiable, amortized, score‑matching, and combinatorial search—highlighting their distinct accuracy‑runtime trade‑offs. It introduces SPADE, a spline‑based score‑evaluation method that compiles and reuses sufficient statistics, reducing combinatorial search complexity from O(nd³) to O(nd²+d³). Empirical results show SPADE dramatically extends the scalability‑accuracy frontier, solving large‑scale problems with high structural accuracy on both synthetic and real‑world data.
By Hendrik Suhr, Sascha Xu, Jilles Vreeken