dorsal/arxiv
View SchemaSilence the Judge: Reinforcement Learning with Self-Verifier via Latent Geometric Clustering
| Authors | Nonghai Zhang, Weitao Ma, Zhanyu Ma, Jun Xu, Jiuchong Gao, Jinghua Hao, Renqing He, Jingwen Xu |
|---|---|
| Categories | |
| ArXiv ID | 2601.08427vv1 |
| URL | https://arxiv.org/abs/2601.08427 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Group Relative Policy Optimization (GRPO) significantly enhances the reasoning performance of Large Language Models (LLMs). However, this success heavily relies on expensive external verifiers or human rules. Such dependency not only leads to significant computational costs and training latency, but also yields sparse rewards that hinder optimization efficiency. To address these challenges, we propose Latent-GRPO, a framework that derives intrinsic rewards directly from latent space geometry. Crucially, our empirical analysis reveals a compelling geometric property: terminal token representations of correct reasoning trajectories form dense clusters with high intra-class similarity, whereas incorrect trajectories remain scattered as outliers. In light of this discovery, we introduce the Iterative Robust Centroid Estimation (IRCE) algorithm, which generates dense, continuous rewards by mitigating magnitude fluctuations via spherical projection and estimating a robust ``truth centroid'' through iterative aggregation. Experimental results on multiple datasets show that our method maintains model performance while achieving a training speedup of over 2x compared to baselines. Furthermore, extensive results demonstrate strong generalization ability and robustness. The code will be released soon.
{
"annotation_id": "087ca91b-472f-4160-8f70-c15efd00f557",
"date_created": "2026-02-17T05:53:16.199000Z",
"date_modified": "2026-02-17T05:53:16.199000Z",
"file_hash": "f6bd2208ad6e6102a560bf137b1d807899c0da55c0c2bf1750ec2084f5c0bd6b",
"private": false,
"record": {
"abstract": "Group Relative Policy Optimization (GRPO) significantly enhances the reasoning performance of Large Language Models (LLMs). However, this success heavily relies on expensive external verifiers or human rules. Such dependency not only leads to significant computational costs and training latency, but also yields sparse rewards that hinder optimization efficiency. To address these challenges, we propose Latent-GRPO, a framework that derives intrinsic rewards directly from latent space geometry. Crucially, our empirical analysis reveals a compelling geometric property: terminal token representations of correct reasoning trajectories form dense clusters with high intra-class similarity, whereas incorrect trajectories remain scattered as outliers. In light of this discovery, we introduce the Iterative Robust Centroid Estimation (IRCE) algorithm, which generates dense, continuous rewards by mitigating magnitude fluctuations via spherical projection and estimating a robust ``truth centroid\u0027\u0027 through iterative aggregation. Experimental results on multiple datasets show that our method maintains model performance while achieving a training speedup of over 2x compared to baselines. Furthermore, extensive results demonstrate strong generalization ability and robustness. The code will be released soon.",
"arxiv_id": "2601.08427",
"authors": [
"Nonghai Zhang",
"Weitao Ma",
"Zhanyu Ma",
"Jun Xu",
"Jiuchong Gao",
"Jinghua Hao",
"Renqing He",
"Jingwen Xu"
],
"categories": [
"cs.CL",
"cs.LG"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Silence the Judge: Reinforcement Learning with Self-Verifier via Latent Geometric Clustering",
"url": "https://arxiv.org/abs/2601.08427",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "733c2688-1558-420b-b9e2-686b347a78dc",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}