NOTREKS:基于分数的结构学习中的边际独立性
NOTREKS: Marginal Independence in Score-based Structure Learning
Fabian Bleile · Sarah Lumpp · Mathias Drton
中文摘要
基于分数的结构学习通过在结构方程模型上优化数据依赖的目标函数来估计因果图。研究如何将选定变量对边际独立的先验知识纳入此类因果发现方法。在忠实性假设下,边际独立的变量对不能通过trek路径相连,因此该知识成为图上的无trek约束,称为NOTREKS信息。引入幂级数trek(PSTrek)惩罚用于基于梯度的优化,并引入trek约束用于基于顺序的搜索,分析此类信息在有限样本下为何有帮助以及如何限制搜索空间。数值实验展示了NOTREKS信息在因果发现中的帮助程度。特别地,使用带有oracle NOTREKS信息的合成基准,表明这些约束可以同时改善结构恢复和基于调整的效应识别。
关键要点
- 01问题:如何将变量对边际独立的先验知识融入基于分数的因果结构学习。
- 02方法:提出PSTrek惩罚用于梯度优化,trek约束用于基于顺序的搜索。
- 03理论:在忠实性下边际独立对不能由trek连接,形成无trek约束并限制搜索空间。
- 04结果:合成基准实验显示约束可改善结构恢复与基于调整的效应识别。
解读
尚无解读。
原始英文摘要
arXiv:2611.24015v1 Announce Type: new Abstract: Score-based structure learning estimates causal graphs by optimizing a data-dependent objective over structural equation models. We study how prior knowledge that selected pairs of variables are marginally independent can be incorporated into such causal discovery methods. Under faithfulness, marginally independent pairs cannot be connected by a trek, so the knowledge becomes a graphical no-trek constraint, which we call NOTREKS information. We introduce a power-series trek (PSTrek) penalty for gradient-based optimization and a trek constraint for order-based search, and we analyze why such information helps in finite samples and how it restricts the search space. Our numerical experiments illustrate to what extent NOTREKS information helps in causal discovery. In particular, using synthetic benchmarks with oracle NOTREKS information, we show that these constraints can improve both structural recovery and adjustment-based effect identification.