paper-with-me

홈 › Papers

Sparse Reward Subsystem in Large Language Models

2026-02-01 · Guowei Xu, Mert Yuksekgonul, James Zou arxiv

Recent studies show that LLM hidden states encode reward-related information, such as answer correctness and model confidence. However, existing approaches typically fit black-box probes on the full hidden states, offering little insight into how this information is structured across neurons. In this paper, we show that reward-related information is concentrated in a sparse subset of neurons. Using simple probing, we identify two types of neurons: value neurons, whose activations predict state value, and dopamine neurons, whose activations encode step-level temporal difference (TD) errors. Together, these neurons form a sparse reward subsystem within LLM hidden states. These names are drawn by analogy with neuroscience, where value neurons and dopamine neurons in the biological reward subsystem also encode value and reward prediction errors, respectively. We demonstrate that value neurons are robust and transferable across diverse datasets and models, and provide causal evidence that they encode reward-related information. Finally, we show applications of the reward subsystem: value neurons serve as effective predictors of model confidence, and dopamine neurons can function as a process reward model (PRM) to guide inference-time search.

📄 PDF Abstract BibTeX arXiv:2602.00986

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Compositional Reinforcement Learning for Discrete-Time Stochastic Control Systems

2022-08-06 · Abolfazl Lavaei, Mateo Perez, Milad Kazemi, Fabio Somenzi 외

We propose a compositional approach to synthesize policies for networks of continuous-space stochastic control systems with unknown dynamics using model-free reinforcement learning (RL). The approach is based on implicit…

Q-Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Faster Maximum Feasible Subsystem Solutions for Dense Constraint Matrices

2021-02-10 · Fereshteh Fakhar Firouzeh, John W. Chinneck, Sreeraman Rajan

Finding the largest cardinality feasible subset of an infeasible set of linear constraints is the Maximum Feasible Subsystem problem (MAX FS). Solving this problem is crucial in a wide range of applications such as machi…

Binary ClassificationCompressive Sensing

YNU-HPCC at SemEval-2019 Task 6: Identifying and Categorising Offensive Language on Twitter

2019-06-01 · SEMEVAL 2019 6 · Chengjin Zhou, Jin Wang, Xue-jie Zhang

This document describes the submission of team YNU-HPCC to SemEval-2019 for three Sub-tasks of Task 6: Sub-task A, Sub-task B, and Sub-task C. We have submitted four systems to identify and categorise offensive language.…

Deep Learning

PixL2R: Guiding Reinforcement Learning Using Natural Language by Mapping Pixels to Rewards

2020-07-30 · ICML Workshop LaReL 2020 7 · Prasoon Goyal, Scott Niekum, Raymond J. Mooney

Reinforcement learning (RL), particularly in sparse reward settings, often requires prohibitively large numbers of interactions with the environment, thereby limiting its applicability to complex problems. To address thi…

reinforcement-learningReinforcement Learning (RL)Robot Manipulation

Online Intrinsic Rewards for Decision Making Agents from Large Language Model Feedback

2024-10-30 · Qinqing Zheng, Mikael Henaff, Amy Zhang, Aditya Grover 외

Automatically synthesizing dense rewards from natural language descriptions is a promising paradigm in reinforcement learning (RL), with applications to sparse reward problems, open-ended exploration, and hierarchical sk…

Decision MakingLanguage ModelingLanguage ModellingLarge Language Model+2