mlsanityData to 7 Oct 2026

SparseRM: A Lightweight Preference Modeling with Sparse Autoencoder

arXiv 2511.07896 ↗First posted 11 Nov 2025cs.AI cs.CLcited by 7

On the map: LLM alignment / RLHF / preference optimisation → Reward modeling and RLHF

Abstract (arXiv)

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.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Placed in Reward modeling and RLHF, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 13 of its 38 references that are in the map. First posted on arXiv 11 Nov 2025.

Builds on

13 of 38 references.

Closest ancestors · 3

Same direction, newest first

  1. 2025Inference-Time Scaling for Generalist Reward Modeling3 Apr
  2. 2022Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback12 Apr
  3. 2019Fine-Tuning Language Models from Human Preferences18 Sep

Other references · 10

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2024The Llama 3 Herd of Modelscited by 14,192
  3. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  5. 2024OpenAI o1 System Cardcited by 1,220
  6. 2024Gemma: Open Models Based on Gemini Research and Technologycited by 889
  7. 2024DeepSeek-V3 Technical Reportcited by 724
  8. 2024Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 2cited by 381
  9. 2024Llama Scope: Extracting Millions of Features from Llama-3.1-8B with Sparse Autoencoderscited by 133
  10. 2025Enhancing LLM Reasoning with Iterative DPO: A Comprehensive Empirical Investigationcited by 36

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 7.

7 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Limited Preference Data? Learning Better Reward Model with Latent Space Synthesis
  2. 2024Towards a Unified View of Preference Learning for Large Language Models: A Survey
  3. 2026Preference Instability in Reward Models: Detection and Mitigation via Sparse Autoencoders
  4. 2024Soft Preference Optimization: Aligning Language Models to Expert Distributions
  5. 2024Beyond Bradley-Terry Models: A General Preference Model for Language Model Alignment
  6. 2025SAFER: Probing Safety in Reward Models with Sparse Autoencoder
  7. 2025PIRA: Preference-Oriented Instruction-Tuned Reward Models with Dual Aggregation
  8. 2025Latent Preference Coding: Aligning Large Language Models via Discrete Latent Codes