arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.01207cs.LGcs.AIstat.ME
收藏

利用大语言模型高效发现因果图

Efficient Causal Graph Discovery Using Large Language Models

Mila, Université de Montréal(蒙特利尔大学Mila研究所);Mila, McGill University(麦吉尔大学Mila研究所)

Thomas Jiralerspong, Xiaoyin Chen, Yash More, Vedant Shah, Yoshua Bengio

AI总结:

本文提出一种利用大语言模型进行完整因果图发现的新框架,通过广度优先搜索方法提高效率,并展示其在不同规模真实因果图上的最佳性能。

摘要:

我们提出了一种利用大语言模型(LLMs)进行完整因果图发现的新框架。尽管先前基于大语言模型的方法使用成对查询方法,这需要二次数量的查询,很快在更大的因果图中变得不切实际。相比之下,所提出的框架使用广度优先搜索(BFS)方法,使其仅需线性数量的查询。我们还展示了所提出的方法可以在有观察数据时轻松整合,以提高性能。除了更节省时间和数据外,所提出的框架在不同规模的真实因果图上实现了最先进的结果。结果展示了所提出方法在发现因果关系方面的有效性和效率,展示了其在不同领域因果图发现任务中的广泛适用潜力。

英文摘要:

We propose a novel framework that leverages LLMs for full causal graph discovery. While previous LLM-based methods have used a pairwise query approach, this requires a quadratic number of queries which quickly becomes impractical for larger causal graphs. In contrast, the proposed framework uses a breadth-first search (BFS) approach which allows it to use only a linear number of queries. We also show that the proposed method can easily incorporate observational data when available, to improve performance. In addition to being more time and data-efficient, the proposed framework achieves state-of-the-art results on real-world causal graphs of varying sizes. The results demonstrate the effectiveness and efficiency of the proposed method in discovering causal relationships, showcasing its potential for broad applicability in causal graph discovery tasks across different domains.

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

↑