arXiv CS
open access
Intra-Rubric Reward Divergence: Mitigating Rubric Hacking through Latent Dimension Recovery and Balancing
Rubric hacking limits both performance and training robustness in rubric-based reinforcement learning. By decomposing rubrics into sub-dimensions, we reveal the Intra-Rubric Reward Divergence: as the total rubric score increases, certain sub-dimension scores systematically decrease, suggesting the m
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- CodeSkill: Latent Skill Abstraction for Long-Horizon Code Agents#1117955
- QUBRIC: Co-Designing Queries and Rubrics for RL Beyond Verifiable Rewards#793710
- QUBRIC: Co-Designing Queries and Rubrics for RL Beyond Verifiable Rewards#789706
- RubricEM: Meta-RL with Rubric-guided Policy Decomposition beyond Verifiable Rewards#1387058
- SINDy-RL for interpretable and efficient model-based reinforcement learning#248603
Record · ID 1381251
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive