arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2510.14488cs.LGcs.AI
收藏

从Guess2Graph:在有限样本中,不可靠专家何时以及如何安全地提升因果发现?

From Guess2Graph: When and How Can Unreliable Experts Safely Boost Causal Discovery in Finite Samples?

Cornell Tech(康奈尔科技);Amazon(亚马逊);Karlsruhe Institute of Technology(卡尔斯鲁厄理工学院)

Sujai Hiremath, Dominik Janzing, Philipp Faller, Patrick Blöbaum, Elke Kirschbaum, Shiva Prasad Kasiviswanathan, Kyra Gan

AI总结:

本文提出Guess2Graph框架,利用专家猜测指导统计检验顺序而非替代,在有限样本中保持统计一致性并提升因果发现性能,PC-Guess与gPC-Guess两种实例均验证了有效性。

摘要:

因果发现算法在样本有限时往往表现不佳。虽然将专家知识(包括来自大语言模型的知识)作为约束条件整合进来有望提升性能,但现有方法的保证需要完美的预测或不确定性估计,这使得它们在实际应用中不可靠。我们提出了Guess2Graph(G2G)框架,该框架利用专家猜测来指导统计检验的顺序,而非取代它们。这保持了统计一致性,同时实现了性能提升。我们开发了G2G的两种实例:PC-Guess,它增强了PC算法;以及gPC-Guess,一种学习增强的变体,旨在更好地利用高质量专家输入。理论上,无论专家错误如何,两者都保持正确性,且当专家“优于随机”时,gPC-Guess在有限样本中被证明优于其非增强对应方法。实证上,两者都随专家准确率单调提升,其中gPC-Guess取得了显著更强的增益。

英文摘要:

Causal discovery algorithms often perform poorly with limited samples. While integrating expert knowledge (including from LLMs) as constraints promises to improve performance, guarantees for existing methods require perfect predictions or uncertainty estimates, making them unreliable for practical use. We propose the Guess2Graph (G2G) framework, which uses expert guesses to guide the sequence of statistical tests rather than replacing them. This maintains statistical consistency while enabling performance improvements. We develop two instantiations of G2G: PC-Guess, which augments the PC algorithm, and gPC-Guess, a learning-augmented variant designed to better leverage high-quality expert input. Theoretically, both preserve correctness regardless of expert error, with gPC-Guess provably outperforming its non-augmented counterpart in finite samples when experts are "better than random." Empirically, both show monotonic improvement with expert accuracy, with gPC-Guess achieving significantly stronger gains.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑