用更少数据和时间,实现大模型激活值的可解释分解与跨模型对比。
Inference-Time Decomposition of Activations (ITDA): A Scalable Approach to Interpreting Large Language Models
- 基于推理时贪心构建激活字典,无需复杂训练。
- 仅需1%时间和数据即可训练,支持70B/405B大模型。
- 支持跨模型比较,性能优于传统相似性度量方法。
稀疏自编码器(SAEs)是分解大语言模型(LLM)激活以获得可解释潜在表示的常用方法,但其训练成本高,学术界多依赖开源SAE,仅覆盖至270亿参数以下模型,且潜在表示不支持跨模型迁移。本文提出推理时激活分解(ITDA),利用相对表示相似性度量,通过在提示数据集上贪心构建激活字典,选择当前字典难以近似的激活项。ITDA训练仅需SAE 1%的时间和数据,可在单个消费级显卡上训练Llama-3.1 70B和405B模型。在部分目标模型上重建性能接近SAE,通常略有下降,但其字典支持跨模型比较;基于ITDA字典的简单杰卡德相似性指数,优于现有方法如CKA、SVCCA和相对表示相似性度量。ITDA为资源受限或需跨模型分析场景提供低成本替代方案。代码已公开于https://github.com/pleask/itda。
原文摘要 · Abstract (English)
Sparse autoencoders (SAEs) are a popular method for decomposing Large Langage Models (LLM) activations into interpretable latents. However, due to their substantial training cost, most academic research uses open-source SAEs which are only available for a restricted set of models of up to 27B parameters. SAE latents are also learned from a dataset of activations, which means they do not transfer between models. Motivated by relative representation similarity measures, we introduce Inference-Time Decomposition of Activations (ITDA) models, an alternative method for decomposing language model activations. To train an ITDA, we greedily construct a dictionary of language model activations on a dataset of prompts, selecting those activations which were worst approximated by matching pursuit on the existing dictionary. ITDAs can be trained in just 1% of the time required for SAEs, using 1% of the data. This allowed us to train ITDAs on Llama-3.1 70B and 405B on a single consumer GPU. ITDAs can achieve similar reconstruction performance to SAEs on some target LLMs, but generally incur a performance penalty. However, ITDA dictionaries enable cross-model comparisons, and a simple Jaccard similarity index on ITDA dictionaries outperforms existing methods like CKA, SVCCA, and relative representation similarity metrics. ITDAs provide a cheap alternative to SAEs where computational resources are limited, or when cross model comparisons are necessary. Code available at https://github.com/pleask/itda.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。