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: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:2607. 11510v1 Announce Type: new Abstract: Causal discovery from observational tabular data remains fundamentally challenging, primarily due to the heterogeneity of underlying causal mechanisms and the high-dimensional combinatorial search space of Directed Acyclic Graphs (DAGs).
By Yikang Chen, Zhengkang Guan, Haoyuan Qian, Peng Cui, Yi Yang, Kun Kuang
The paper introduces Actionable Case-Based Feature Importance (A‑CBFI), a framework that integrates structural causal models with counterfactual recourse for tabular machine learning. A‑CBFI isolates synergistic interaction bottlenecks and releases suppressive structural locks, concentrating over 98.3% of intervention effort on diagnosed root causes. Empirical tests in finance and healthcare show a 76.9% reduction in active human intervention while keeping recourse costs comparable to exhaustive causal methods.
By Sejong Oh
arXiv:2607. 09695v1 Announce Type: new Abstract: This paper addresses the challenging problem of dynamic feature drift in federated learning, where data distributions evolve across clients and over time -- a common scenario in real-world applications like financial technology.
By Kaijie Chen, Alex Johnson, Maria Garcia, Wei Zhang, Daniel Kim
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