用稀疏自编码器提取语言模型中的偏好特征,实现轻量高效奖励建模。
SparseRM: A Lightweight Preference Modeling with Sparse Autoencoder
- 通过稀疏自编码器分解模型表征,识别出可解释的偏好方向。
- 仅用不到1%参数量,性能优于多数主流奖励模型。
- 适合资源受限场景下的大模型对齐,易于集成到现有流程。
奖励模型(RMs)是大语言模型后训练的核心组件,作为人类偏好评估的代理,指导模型对齐。然而,在资源有限的情况下,依赖大规模偏好标注且微调大模型成本高昂,使得构建可靠奖励模型仍具挑战。为此,我们提出SparseRM,利用稀疏自编码器(SAE)从模型表征中提取与偏好相关的信息,构建轻量且可解释的奖励模型。SparseRM首先使用SAE将大模型表征分解为可解释的方向,捕捉偏好相关特征;随后将表征投影到这些方向上,计算各偏好特征的强度得分;最后通过简单奖励头聚合得分以预测偏好分。在三个偏好建模任务上的实验表明,SparseRM在性能上超越多数主流奖励模型,同时参数量不足1%。此外,其可无缝集成至下游对齐流程,展现出高效对齐的巨大潜力。
原文摘要 · Abstract (English)
Reward models (RMs) are a core component in the post-training of large language models (LLMs), serving as proxies for human preference evaluation and guiding model alignment. However, training reliable RMs under limited resources remains challenging due to the reliance on large-scale preference annotations and the high cost of fine-tuning LLMs. To address this, we propose SparseRM, which leverages Sparse Autoencoder (SAE) to extract preference-relevant information encoded in model representations, enabling the construction of a lightweight and interpretable reward model. SparseRM first employs SAE to decompose LLM representations into interpretable directions that capture preference-relevant features. The representations are then projected onto these directions to compute alignment scores, which quantify the strength of each preference feature in the representations. A simple reward head aggregates these scores to predict preference scores. Experiments on three preference modeling tasks show that SparseRM achieves superior performance over most mainstream RMs while using less than 1% of trainable parameters. Moreover, it integrates seamlessly into downstream alignment pipelines, highlighting its potential for efficient alignment.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。