Judging in Latent Space: Efficient Generative Reward Modeling via Semantics-Preserving Compression
Summary
LatentGRM 提出了一种基于语义分块与压缩重建的潜在评估框架,通过在连续隐空间中完成 rubric 引导的成对偏好判断,将评估轨迹压缩 8.9–9.2 倍并把推理时间减少 6.1–7.0 倍,同时保持与显式 SFT 评委相当的偏好准确率。
View Cached Full Text
Cached at: 10/12/26, 02:37 AM
Paper page - Judging in Latent Space: Efficient Generative Reward Modeling via Semantics-Preserving Compression
Source: https://huggingface.co/papers/2610.09788
Abstract
Rewardmodelingoftenrequiresjointlyrepresentingandreasoningovermultipleevaluationcriteria,yetverbalizingthisprocesstokenbytokencanincursubstantialinferencecost.Recentworkonlatentreasoningsuggeststhatcontinuousstatesmaysupportthiscomputationmorecompactly.WeintroduceLatentGRM,alatentevaluationframeworkbuiltonsemanticchunking,compression,andreconstruction.Byusingthestructureofrubric-guidedevaluationstoguidecompression,LatentGRMlearnscompactcontinuoustrajectoriesthatsupportautonomouspairwisejudgmentswithoutgeneratingtextualassessments.Aseparateinterpreterreconstructsevaluationtextfromthesetrajectories,providinganofflineviewoftheinformationretainedundercompression.Undermatchedtrainingdataandbackbones,LatentGRMachievescompetitiveaggregatepreferenceaccuracyrelativetoexplicitSupervisedFine-Tuning(SFT)judgesatboth4Band8Bscales.Acrossfourbenchmarkdomains,LatentGRM-8Bcompressesevaluationtrajectoriesby8.9--9.2xandreducestotaljudgeinferencetimeby6.1--7.0xatvote@5.Controlledrubricinterventionsshowthatcriterion-dependentpreferenceinformationiscarriedthroughthelatentsequence.Together,theseresultsdemonstratethatcontinuouslatentevaluationcansubstantiallyreduceinferencecostwhilepreservingcompetitivejudgmentquality.
View arXiv pageView PDFGitHub1Add to collection
Get this paper in your agent:
hf papers read 2610\.09788
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2610.09788 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2610.09788 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2610.09788 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
Judging in Latent Space: Efficient Generative Reward Modeling via Semantics-Preserving Compression
The paper introduces LatentGRM, a latent evaluation framework that performs rubric-guided reward modeling in continuous latent space via semantics-preserving chunk compression, achieving competitive preference accuracy against SFT judges while compressing evaluation trajectories 8.9–9.2× and reducing inference time 6.1–7.0× at 4B/8B scales.
MetaRubric: Learning to Reward for Rubric-Based Reinforcement Learning
MetaRubric 通过交替进行证据感知的策略优化与响应引导的评分标准适配,解决基于评分标准的强化学习中「空洞奖励(Vacuous Credit)」问题,在 PubMedQA 上比静态评委 GRPO 提升 6.00–20.40 个百分点。
Sep-Latent: Separator Tokens as Natural Compression Anchors for Implicit Reasoning
本文提出 Sep-Latent,一种自适应隐式推理框架,利用分隔符 token 作为语义锚点并通过注意力衰减机制压缩推理逻辑,在 GSM8k-Aug 上以仅 5.4 个 token 达到 56.8% 准确率,显著优于固定长度的隐式推理模型。
Expert-Guided Rubrics as Dense Reward Signals for Reinforcement Learning in Non-Verifiable Domains
该论文提出将少量专家(SME)评判转化为密集奖励信号,并与检索指标结合成适用于GRPO的混合奖励,以解决非可验证领域(如金融服务检索)中稀疏奖励导致的梯度消失问题,实验显示Recall@3提升最多6%、MRR@3提升6.7%。
Rubrics from the Task, Verdicts from Evidence: Pointwise Rubric Rewards with Tool-Augmented Judges
本文提出 ReVeR,一种点式(pointwise)rubric 奖励模型,仅通过分析指令本身生成硬性规则与分级原则,并借助工具增强的独立评判来评估响应,避免了从候选响应中推导标准所引入的偏置。实验表明 ReVeR 在偏好准确率、测试时扩展及下游策略优化方面优于成对 rubric 奖励模型。