Skip to content

Eat Your Precision: Precision Objective Mitigates Reward Hacking in Rubric-based RL

Paper · arXiv 2610.33512 · daily list of October 27, 2026

Hyun Ryu, Jong-Heon Kim, Yiqing Xie, Seungone Kim, Carolyn Rose, Eunho Yang · Carnegie Mellon University

Collected · snapshot shipped with the site build, not a live feed

Abstract · as written by the authors

Rubric-based rewards enable effective reinforcement learning on non-verifiable tasks. However, because these rewards are typically defined as a weighted measure of rubric coverage, models are trained primarily to maximize a recall objective. As a result, RL-trained models produce responses that are more complete but also more verbose and contain more unnecessary or factually incorrect content, leading them to be less preferred than responses from the base model. To address this issue, we present the FORK reward, which jointly optimizes recall and a novel precision objective, which requires each unit of a model response to be both necessary and factually correct, as measured by rubric-driven necessity credits and a factual-correctness grader, respectively. Our experimental results show that FORK outperforms existing rubric-based RL methods and achieves Pareto-optimal performance that balances rubric coverage and overall response quality. Compared to the original recall-based reward, FORK substantially improves precision and reduces response length while achieving similar rubric coverage, which leads to significantly higher win rate compared to the base policy (e.g., from 10.6% to 68.0% on RubricHub-Medical and from 22.1% to 74.1% on HealthBench).

This is the original abstract from arXiv. It has not been summarised, translated or rewritten.

Terms in plain language

Automatic

Made by matching the words of the title and abstract against a fixed list of definitions. It does not read the paper and does not change the abstract above.

RL
training by trial and error: good actions earn a reward, and the model adjusts to earn more.

Questions about this paper

Where can I read the full paper?

On arXiv, under the identifier 2610.33512: the abstract page is https://arxiv.org/abs/2610.33512 and the PDF is https://arxiv.org/pdf/2610.33512. The text on this page is the authors' abstract, not a summary.

Is there code for this paper?

Yes. The paper's page on Hugging Face links the repository github.com/JHKim631/FORK, which had 0 stars when we collected it.

What do the upvotes mean?

19 signed-in Hugging Face users upvoted it on the daily list of October 27, 2026. Upvotes measure attention from that community, not peer review.

What are the plain-language terms under the abstract?

Short notes on the technical words of the title and abstract, in everyday English, taken from a fixed list of definitions that we wrote. They are made automatically by matching words, so a note can miss a term or give a meaning that does not fit this paper. The abstract above them is the authors’ text and is not changed.