What problem does it solve?
Training language models with RLHF or RLAIF requires reliable scalar rewards or preference pairs, but building reward models from scratch is costly and LLM-as-judge scoring is noisy and inconsistent across scales. This Skill provides decision trees and code patterns for constructing pointwise, pairwise tournament, and preference-pair rewards with the OpenJudge library.
Core Features & Use Cases
- Strategy Selection: Decision trees map your RL algorithm (GRPO, REINFORCE, DPO, IPO) and task type (verifiable vs subjective) to the right reward strategy—pointwise, pairwise tournament, or listwise ranking.
- Pointwise Multi-Dimension Rewards: Combine graders like CorrectnessGrader, HarmfulnessGrader, and CodeExecutionGrader with WeightedSumAggregator, plus score normalization for training stability.
- Pairwise Tournaments & Preference Pairs: Use GRPOTournamentEvaluationStrategy for net-win-rate rewards on subjective tasks, and LISTWISE-mode LLMGrader to generate (chosen, rejected) pairs for DPO with position-bias debiasing.
- Use Case: While training a chat model with GRPO on instruction-following tasks, run all-pairs comparison across each group of rollouts to compute net win rates as relative rewards, avoiding unreliable absolute scoring.
Quick Start
Ask the AI to build a GRPO reward function for subjective tasks using OpenJudge's pairwise tournament strategy with debiasing enabled.