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

数据驱动的电路发现用于语言模型的可解释性

Data-driven Circuit Discovery for Interpretability of Language Models

George Mason University(乔治·马歇尔大学);Tel Aviv University(特拉维夫大学)

Daking Rai, Mor Geva, Ziyu Yao

AI总结:

本文提出数据驱动电路发现方法,通过数据聚类发现多个电路,而非单一电路,提升模型内部机制的可解释性。

摘要:

电路发现旨在通过局部化和解释一个计算子图来解释语言模型(LMs)如何实现特定任务。现有电路发现方法是假设驱动的;它们首先用数据集非正式地定义一个任务,然后在该数据集上应用电路发现算法以获得单一电路。这强加了两个假设:即LM通过单一电路实现任务,且数据集充分代表了人类理解的任务。我们系统地在四个先前研究的任务上测试这些假设,并发现即使保留任务语义的微小数据集变化,也会产生边缘重叠低和跨数据集忠实度低的电路。更引人注目的是,当应用于包含两个不同任务的混合数据集时,这两个任务各自发现的电路具有接近零的跨忠实度,现有方法仍会返回一个在两个任务上都有高忠实度的单一电路。这表明当前方法发现的是数据集特定的电路,而不是通用任务电路。我们提出了数据驱动电路发现(DCD),一种新的发现框架,它摒弃了这两个假设:而不是为数据集返回单一电路,DCD首先通过模型如何处理这些示例的方式对数据集中的示例进行聚类,并为每个组发现单独的电路。这使不同的机制能够分别出现,而不是合并到单一电路中;每个电路解释其组,而不是整个任务。实验显示,DCD为每个数据集发现多个电路,每个电路比现有方法发现的单一电路更忠实于其组。广泛而言,DCD让数据揭示LM中的机制结构,而不是依赖于人类定义的任务边界,这些边界可能与模型如何组织其计算不一致。

英文摘要:

Circuit study aims to explain how language models (LMs) implement a task by localizing and interpreting a circuit: a computational subgraph responsible for a specific model's behavior. Existing methods for circuit localization are largely hypothesis-driven: they define a task through a dataset, assume that all examples in the task are implemented by the same mechanism, and apply circuit discovery to obtain a single circuit. This workflow does not account for mechanistic diversity within a task, where different examples may rely on different mechanisms. We first show that when a dataset mixes tasks processed through distinct mechanisms, current circuit discovery can combine these mechanisms into a single circuit while retaining faithfulness comparable to circuits discovered on each task separately. Across four tasks and three models, we further provide evidence for such mechanistic diversity within individual tasks. To account for this diversity, we propose Data-driven Circuit Discovery (DCD), which modifies the circuit-discovery workflow by adding a grouping step before the discovery. The grouping step aims to partition the dataset into subsets of examples that rely on similar mechanisms. We instantiate this step with clustering over per-example attribution patterns (DCD-Cluster). Across four tasks and three models, DCD-Cluster decomposes the dataset into multiple subsets whose circuits exhibit distinct faithfulness patterns, providing useful hypotheses about mechanistic differences among examples.

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

↑