Causal Bayesian Networks (CBNs) are a powerful tool for reasoning under uncertainty about complex real-world problems. Such problems evolve over time, responding to external shocks as they occur. To support decision-making, CBNs require a cause-and-effect map of the variables under consideration, known as the network's structure. Learning the graphical structure of a causal model from data remains challenging; learning it from time-series data is even harder because dependencies may arise at different time lags. We construct a method that jointly learns a temporal ordering and a dominant lag for each selected ordered variable pair. Our contribution is a decomposable BIC-style objective score for mixed data that combines node-specific sample sizes with a penalty favouring recent lags. We optimise this objective using a Tabu search augmented with change-lag moves and greedy per-child lag tuning, while its node-wise decomposition supports cached and parallel neighbourhood evaluation. We establish acyclicity and complexity results and derive recovery limits when effects are distributed across multiple lags. In simulations, we show that the proposed method outperforms an inflexible lag-1 score-based learner in most evaluated settings, whereas most specialised methods achieve higher recovery accuracy on data that satisfy their assumptions. On a real-world UK COVID-19 dataset, the method learnt an expected short-lag-skewed structure; nevertheless, 46.8% of selected edges had lags greater than one, showing that longer delays can be retained when their improved fit offsets the penalty. Under its no-contemporaneous-edges and causal-sufficiency assumptions, the method provides a computationally tractable subroutine for edge-specific single-lag optimisation, complementing score-based causal discovery methods.
The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳));Tsinghua-Berkeley Shenzhen Institute(清华-伯克利深圳学院);Tsinghua Shenzhen International Graduate School(清华大学深圳国际研究生院);Graduate School, Tsinghua University(清华大学研究生院)
Linear Causal Discovery with Interventional Constraints
纳入因果知识和机制对于完善因果模型和改进下游任务(例如设计新治疗方法)至关重要。在本文中,我们引入了一个新的概念,在因果发现,称为介入约束,这从根本上不同于介入数据。虽然干预性数据需要变量的直接扰动,但干预性约束以因果效应的不等式约束的形式对高层次的因果知识进行编码。例如,在Sachs数据集中(Sachs et al.\ 2005年),Akt已被证明是由PIP3激活,这意味着PIP3对Akt发挥积极的因果作用。现有的因果发现方法允许强制执行结构约束(例如,需要从PIP3到Akt的因果路径),但它们仍然可能产生不正确的因果结论,例如学习“PIP3抑制Akt”。干预约束通过明确约束变量对之间的总因果效应来弥合这一差距,确保学习模型尊重已知的因果影响。为了形式化干预约束,我们提出了一个度量来量化线性因果模型的总因果效应,并将问题制定为约束优化任务,使用两阶段约束优化方法求解。我们在真实世界的数据集上评估了我们的方法,并证明了整合干预性约束不仅提高了模型的准确性,确保了与已有发现的一致性,使模型更易于解释,而且还有助于发现新的因果关系,否则识别成本很高。
Causal Discovery from Time-Series Data with Short-Term Invariance-Based Convolutional Neural Networks
Faculty of Computing(计算机学院);Harbin Institute of Technology(哈尔滨工业大学);The Artificial Intelligence Institute(人工智能研究所);The Department of Computer Science(计算机科学系);The University of North Carolina at Chapel Hill(北卡罗来纳大学教堂山分校)
Causal Ensemble Agent: Hierarchical Causal Discovery with LLM-guided Expert Reweighting
The University of Melbourne(墨尔本大学);MBZUAI(穆罕默德·本·扎耶德人工智能大学);Peking University(北京大学);Adelaide University(阿德莱德大学);Hong Kong Baptist University(香港浸会大学);The University of Sydney(悉尼大学);Carnegie Mellon University(卡内基梅隆大学)
The Robustness of Differentiable Causal Discovery in Misspecified Scenarios
School of Mathematics, Southeast University, Nanjing 210096, China(数学学院,东南大学,南京210096,中国);School of Cyber Science and Engineering, Southeast University, Nanjing 210096, China(网络科学与工程学院,东南大学,南京210096,中国)
Exploring Multi-Modal Data with Tool-Augmented LLM Agents for Precise Causal Discovery
University of Houston(德克萨斯大学休斯顿分校);NEC Laboratories America(NEC美国实验室);Florida International University(佛罗里达国际大学);North Carolina State University(北卡罗来纳州立大学)
Learning to Defer for Causal Discovery with Imperfect Experts
University of Oxford(牛津大学);Mila – Quebec Artificial Intelligence Institute(米拉-魁北克人工智能研究所);Université de Montréal(蒙特利尔大学);ServiceNow Research(ServiceNow研究院);University of Amsterdam(阿姆斯特丹大学);Université Laval(拉瓦尔大学)
Can Large Language Models Help Experimental Design for Causal Discovery?
The Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州));MBZUAI(穆罕默德·本·扎耶德人工智能大学);Hong Kong Baptist University(香港浸会大学);The University of Sydney(悉尼大学);Carnegie Mellon University(卡内基梅隆大学)
Differentiable Causal Discovery For Latent Hierarchical Causal Models
University of California San Diego(加利福尼亚大学圣迭戈分校);Carnegie Mellon University(卡内基梅隆大学);Mohamed bin Zayed University of Artificial Intelligence(穆罕默德·本·扎耶德人工智能大学)
REX: Causal discovery based on machine learning and explainability techniques
BBVA Madrid, Spain(西班牙BBVA马德里);Instituto de Ciencia de Datos e Inteligencia Artificil (DATAI)(数据与人工智能研究所);University of Navarra(纳瓦拉大学);Tecnun, University of Navarra(纳瓦拉大学技术学院)
School of Computer Science and Technology, Anhui University(安徽大学计算机科学与技术学院);University of South Australia(澳大利亚南岸大学);School of Hong Kong Polytechnic University, Department of Computing(香港理工大学计算机学院);School of Computer Science and Information Technology, Hefei University of Technology(合肥工业大学计算机科学与信息技术学院)
针对基于约束方法的级联错误及全局评分方法受局部等价类影响的问题,本文提出 HLCD 混合算法,结合 OR 规则候选骨架、评分剪枝与结构评分定向,并在 14 个数据集上验证其优于 7 种现有方法。