Signals 4 · free daily AI digest

Audit Where Hacks Pay: Budgeted Strong-Verifier Audits Against Reward Hacking in GRPO

Paper recorded by Signals 4 on 2026-10-26 in cs.AI. Abstract reproduced from arXiv; link to the original below.

Published 2026-10-26 on arXiv · recorded by Signals 4 on 2026-10-27

Category: cs.AI · 人工智能 · first seen 2026-10-27

Abstract

Reinforcement learning with verifiable rewards trains on cheap checks, such as unit tests, that a policy can learn to game, while a stronger check is too expensive to run on every rollout. We study how to spend a limited strong-verifier budget in GRPO, separating which weakly passing rollouts to audit from what reward a caught hack receives. At a fixed policy state with centered advantages, the ex

Read on arXiv →

#160 most recent of 960 cs.AI papers we have recorded · ↑ newer: Can JEV Support Clinical Trial Criteria Assessment? · ↓ older: SceneBloom: Agentic Indoor Environment Generation with Realistic and D
Cite this page: Audit Where Hacks Pay: Budgeted Strong-Verifier Audits Against Reward Hacking in GRPO: the #160 most recent of 960 cs.AI papers we have recorded (as of 2026-10-26). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/audit-where-hacks-pay-budgeted-strong-verifier-audits-against-reward-hacking-in-.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.AI papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions