Small Reward Models via Backward Inference
On the map: LLM alignment / RLHF / preference optimisation → Reward modeling and RLHF
Abstract (arXiv)
Reward models (RMs) play a central role throughout the language model (LM) pipeline, particularly in non-verifiable domains. However, the dominant LLM-as-a-Judge paradigm relies on the strong reasoning capabilities of large models, while alternative approaches require reference responses or explicit rubrics, limiting flexibility and broader accessibility. In this work, we propose FLIP (FLipped Inference for Prompt reconstruction), a reference-free and rubric-free reward modeling approach that reformulates reward modeling through backward inference: inferring the instruction that would most plausibly produce a given response. The similarity between the inferred and the original instructions is then used as the reward signal. Evaluations across four domains using 13 small language models show that FLIP outperforms LLM-as-a-Judge baselines by an average of 79.6%. Moreover, FLIP substantially improves downstream performance in extrinsic evaluations under test-time scaling via parallel sampling and GRPO training. We further find that FLIP is particularly effective for longer outputs and robust to common forms of reward hacking. By explicitly exploiting the validation-generation gap, FLIP enables reliable reward modeling in downscaled regimes where judgment methods fail. Code available at https://github.com/yikee/FLIP.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in Reward modeling and RLHF, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 47 of its 73 references that are in the map. First posted on arXiv 14 Feb 2026.
Builds on
47 of 73 references.
Closest ancestors · 4
Same direction, newest first
- 2025Checklists Are Better Than Reward Models For Aligning Language Models24 Jul
- 2025RewardBench 2: Advancing Reward Model Evaluation2 Jun
- 2024Skywork-Reward: Bag of Tricks for Reward Modeling in LLMs24 Oct
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Model29 May
Other references · 43
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
- 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
- 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,970
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,928
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,767
- 2024A Survey on LLM-as-a-Judgecited by 1,384
- 2022Solving Quantitative Reasoning Problems with Language Modelscited by 1,359
31 more
- 2022Large Language Models Are Human-Level Prompt Engineerscited by 1,020
- 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 946
- 2023Quantifying Language Models' Sensitivity to Spurious Features in Prompt Design or: How I learned to start worrying about prompt formattingcited by 778
- 2024WildChat: 1M ChatGPT Interaction Logs in the Wildcited by 598
- 2024Generative Verifiers: Reward Modeling as Next-Token Predictioncited by 465
- 2025Rubrics as Rewards: Reinforcement Learning Beyond Verifiable Domainscited by 328
- 2023Evaluating Large Language Models at Evaluating Instruction Followingcited by 290
- 2025Small Language Models are the Future of Agentic AIcited by 254
- 2025Generalizing Verifiable Instruction Followingcited by 178
- 2024Optimization-based Prompt Injection Attack to LLM-as-a-Judgecited by 123
- 2025Preference Leakage: A Contamination Problem in LLM-as-a-judgecited by 119
- 2024Is LLM-as-a-Judge Robust? Investigating Universal Adversarial Attacks on Zero-shot LLM Assessmentcited by 117
- 2024Trust or Escalate: LLM Judges with Provable Guarantees for Human Agreementcited by 99
- 2023The Generative AI Paradox: "What It Can Create, It May Not Understand"cited by 97
- 2025Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignmentcited by 91
- 2025RLPR: Extrapolating RLVR to General Domains without Verifierscited by 83
- 2024Enhancing LLM Reasoning via Critique Models with Test-Time and Training-Time Supervisioncited by 60
- 2025One Token to Fool LLM-as-a-Judgecited by 56
- 2024Extracting Prompts by Inverting LLM Outputscited by 40
- 2025BLEUBERI: BLEU is a surprisingly effective reward for instruction followingcited by 17
- 2024Better Alignment with Instruction Back-and-Forth Translationcited by 16
- 2024Does Safety Training of LLMs Generalize to Semantically Related Natural Prompts?cited by 15
- 2025Beyond Multi-Token Prediction: Pretraining LLMs with Future Summariescited by 14
- 2025Better Language Model Inversion by Compactly Representing Next-Token Distributionscited by 9
- 2024HREF: Human Response-Guided Evaluation of Instruction Following in Language Modelscited by 8
- 2023Gen-Z: Generative Zero-Shot Text Classification with Contextualized Label Descriptionscited by 7
- 2025Position: Enough of Scaling LLMs! Lets Focus on Downscalingcited by 5
- 2024REInstruct: Building Instruction Data from Unlabeled Corpuscited by 4
- 2024Time-Reversal Provides Unsupervised Feedback to LLMscited by 3
- 2025Reverse Engineering Human Preferences with Reinforcement Learningcited by 3
- 2025An Invariant Latent Space Perspective on Language Model Inversioncited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2025Inference-Time Reward Hacking in Large Language Models
- 2025Sailing by the Stars: A Survey on Reward Models and Learning Strategies for Learning from Rewards
- 2024Self-Generated Critiques Boost Reward Modeling for Language Models
- 2026From Curiosity to Caution: Mitigating Reward Hacking for Best-of-N with Pessimism
- 2024RewardBench: Evaluating Reward Models for Language Modeling
- 2026Robust Reward Modeling for Large Language Models via Causal Decomposition
- 2024RRM: Robust Reward Model Training Mitigates Reward Hacking
- 2025Tiny Reward Models