mlsanityData to 14 Oct 2026

AutoRule: Reasoning Chain-of-thought Extracted Rule-based Rewards Improve Preference Learning

arXiv 2506.15651 ↗First posted 18 Jun 2025cs.LG cs.AI cs.CLcited by 14

On the map: LLM reasoning → Reinforcement learning for reasoning

also in 1 more
Abstract (arXiv)

Rule-based rewards offer a promising strategy for improving reinforcement learning from human feedback (RLHF), but current approaches often rely on manual rule engineering. We present AutoRule, a fully automated method for extracting rules from preference feedback and formulating them into rule-based rewards. AutoRule extraction operates in three stages: it leverages a reasoning model to interpret user preferences, identifies candidate rules from the reasoning chain of these interpretations, and synthesizes them into a unified rule set. Leveraging the finalized rule set, we employ language-model verifiers to compute the fraction of rules satisfied by each output, using this metric as an auxiliary reward alongside the learned reward model during policy optimization. Training a Llama-3-8B model with AutoRule results in a 28.6% relative improvement in length-controlled win rate on AlpacaEval2.0, and a 6.1% relative gain in second-turn performance on a held-out MT-Bench subset, compared to a GRPO baseline trained with the same learned reward model but without the rule-based auxiliary reward. Our analysis confirms that the extracted rules exhibit good agreement with dataset preference. We find that AutoRule demonstrates reduced reward hacking compared to a learned reward model when run over two episodes. Finally, our case study suggests that the extracted rules capture unique qualities valued in different datasets. The extracted rules are provided in the appendix, and the code is open-sourced at https://github.com/cxcscmu/AutoRule.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Placed in Reinforcement learning for reasoning, one of 17 directions in LLM reasoning. Builds on 12 of its 26 references that are in the map. First posted on arXiv 18 Jun 2025.

Builds on

12 of 26 references.

Closest ancestors · 4

Same direction, newest first

  1. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning22 Jan
  2. 2024OpenRLHF: An Easy-to-use, Scalable and High-performance RLHF Framework20 May
  3. 2022Constitutional AI: Harmlessness from AI Feedback15 Dec
  4. 2017Proximal Policy Optimization Algorithms20 Jul

Other references · 8

  1. 2023GPT-4 Technical Reportcited by 18,396
  2. 2024The Llama 3 Herd of Modelscited by 14,715
  3. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  4. 2022Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedbackcited by 3,720
  5. 2020Learning to summarize from human feedbackcited by 2,588
  6. 2023Gemini: A Family of Highly Capable Multimodal Modelscited by 872
  7. 2022Improving alignment of dialogue agents via targeted human judgementscited by 531
  8. 2025Reward Shaping to Mitigate Reward Hacking in RLHFcited by 88

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 6; 2026: 8.

14 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2026CoRe: Combined Rewards with Vision-Language Model Feedback for Preference-Aligned Reinforcement Learning
  2. 2026A Regret Minimization Framework on Preference Learning in Large Language Models
  3. 2026From Reward-Free Representations to Preferences: Rethinking Offline Preference-Based Reinforcement Learning
  4. 2021Interpretable Preference-based Reinforcement Learning with Tree-Structured Reward Functions
  5. 2025Repairing Reward Functions with Feedback to Mitigate Reward Hacking
  6. 2026Reinforcement Learning from Human Feedback: A Statistical Perspective
  7. 2023Direct Preference-based Policy Optimization without Reward Modeling
  8. 2023Query-Policy Misalignment in Preference-Based Reinforcement Learning