用领域知识提升小样本下的因果效应估计准确率
Knowledge-Informed Local Causal Discovery of Optimal Adjustment Sets
- 将先验知识直接嵌入局部因果发现流程,动态扩展可识别节点
- 在数据稀缺时仍能识别出纯数据方法无法发现的最优调整集
- 适合生物网络等结构复杂、数据少的领域使用
局部因果发现是全局结构学习的可扩展替代方案,但在数据稀疏场景下难以识别有效调整集,原因包括有限样本不确定性、局部邻域不完整和未解决的马尔可夫等价性。尽管许多应用领域具备结构化背景知识,但其在局部因果发现中的整合仍有限。本文提出b-LOAD,即知识引导的LOAD算法扩展,将先验边约束直接融入局部结构学习过程,并利用Meek规则动态扩展发现边界,生成受知识约束的部分有向图。该策略防止由先验知识引入的相关节点被局部搜索排除。理论证明,在背景知识可靠的前提下,该过程单调细化可接受等价类,扩大可识别因果查询范围,实现仅凭观测条件独立信息无法识别的最优调整集恢复。实验表明,相较于纯数据驱动与标准知识增强基线,b-LOAD在数据稀疏和结构复杂场景下显著提升下游因果效应估计性能。真实生物网络实验显示,局部针对性先验知识带来最大收益,且在中等结构噪声下仍具优势。这些发现表明,b-LOAD是一种将碎片化领域知识转化为更可靠因果效应估计的可扩展方法。
原文摘要 · Abstract (English)
Local causal discovery is a scalable alternative to global structure learning. However, it can struggle to identify valid adjustment sets in data-scarce settings because of finite-sample uncertainty, incomplete local neighborhoods, and unresolved Markov equivalence. Although many application domains provide structured background knowledge, its integration into local causal discovery remains limited. We propose b-LOAD, a knowledge-informed extension of the LOAD algorithm for local discovery of optimal adjustment sets. b-LOAD incorporates prior edge constraints directly into the local structure-learning procedure and uses Meek's rules to expand the discovery frontier dynamically, yielding a knowledge-constrained partially directed graph over the relevant local subgraph. This strategy helps prevent structurally relevant nodes introduced by prior knowledge from being excluded by local search. We prove that, under sound background knowledge, the procedure monotonically refines the admissible equivalence class and can enlarge the set of identifiable causal queries, enabling recovery of optimal adjustment sets that are not identifiable from observational conditional-independence information alone. Empirically, b-LOAD improves downstream causal effect estimation relative to purely data-driven and standard knowledge-augmented baselines, particularly in data-scarce and structurally complex regimes. Results on real-world biological networks show that locally targeted prior knowledge provides the largest gains and remains beneficial under moderate structural noise. These findings position b-LOAD as a scalable approach for converting fragmented domain knowledge into more reliable causal-effect estimation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。