INQUIRING LINE

Can smarter system architecture replace hand-crafted AI reward functions — or do some problems need them no matter what?

Can system-level engineering fixes replace hand-designed reward heuristics entirely?

This explores whether restructuring the *system* around a model — how tasks are decomposed, how rollouts are organized, how evaluation is gated — can do the work we normally assign to carefully hand-tuned reward functions.


This explores whether restructuring the *system* around a model — how tasks are decomposed, how rollouts are organized, how evaluation is gated — can substitute for hand-designed reward heuristics. The corpus says: surprisingly often, yes — but not universally, and the interesting part is *which* reward problems dissolve under better engineering versus which ones are irreducibly about the reward signal itself.

The strongest evidence for substitution comes from cases where structure manufactures a reward signal that used to be hand-built. Tree-GRPO uses the branching shape of its rollouts to turn a single end-of-trajectory reward into step-by-step process signals, by comparing sibling subtrees — eliminating the separate process reward model and step-level annotations people used to design by hand Can tree structure alone convert outcome rewards into process supervision?. MAKER goes further: by decomposing a task into minimal subtasks with per-step voting, it hits million-step reliability using small non-reasoning models, inverting the usual instinct to throw sophisticated reward shaping at hard problems Can extreme task decomposition enable reliable execution at million-step scale?. And the Darwin Gödel Machine swaps formal correctness proofs for plain empirical benchmarking, letting a system improve itself through trial and error rather than a designed objective Can AI systems improve themselves through trial and error?.

A second pattern is subtler: engineering doesn't replace the reward, it changes how the reward is *applied* so hand-tuning becomes unnecessary. DRO keeps rubrics but uses them as gates that accept or reject whole rollout groups rather than converting rubric scores into dense reward numbers — the structural move is what prevents reward hacking, not a cleverer reward formula Can rubrics and dense rewards work together without hacking?. AgentCompass makes the same bet on the evaluation side: decoupling benchmark, harness, and environment surfaces reward-hacking that scalar scores hide How can separating evaluation components make reward-hacking visible?. Even the harness-repository work shows that reorganizing *representation* — mapping runtime behavior to code — lets a weak planner match a strong one, a capability gain bought with engineering rather than reward design Can explicit behavior maps help weaker planners compete with stronger models?.

But the corpus also draws a hard line. Some failures are baked into the reward's mathematics and no amount of plumbing fixes them: binary correctness rewards *provably* wreck calibration by rewarding confident wrong guesses, and the fix is a reward-level one — adding a Brier scoring term — not a system rearrangement Does binary reward training hurt model calibration?. Where the reward target is genuinely subjective, you still need to *design* what counts as good, though checklist decomposition converts that design into verifiable sub-criteria rather than a hand-tuned holistic score Can breaking down instructions into checklists improve AI reward signals?. And reward models themselves get better not from engineering around them but from letting them reason before scoring Can reward models benefit from reasoning before scoring?.

The reframe worth leaving with: several problems that *look* like they need a hand-designed reward heuristic turn out to be measurement artifacts that better instrumentation exposes as illusory. The exploration–exploitation trade-off — long treated as a fundamental tension to be balanced by reward tuning — shows near-zero correlation once you measure hidden states instead of token-level statistics; it was an artifact of *how* you looked, not a real trade-off to engineer around Is the exploration-exploitation trade-off actually fundamental?. Even the mechanism of RL is more structural than we design for: updates concentrate in a sparse, nearly identical subnetwork across seeds without anyone regularizing for it Does reinforcement learning update only a small fraction of parameters?. So the honest answer is a split: system-level engineering can replace most reward heuristics that were really compensating for bad structure or bad measurement — but it cannot replace the ones encoding what you actually want the model to value.


Sources 11 notes

Can tree structure alone convert outcome rewards into process supervision?

Tree-GRPO uses branching structure to transform trajectory-level outcome rewards into step-level preference signals through sibling subtree comparison, eliminating the need for separate process reward models or step-level annotation while scaling with computational budget.

Can extreme task decomposition enable reliable execution at million-step scale?

MAKER solves million-step tasks with zero errors by decomposing into minimal subtasks, applying voting at each step, and flagging correlated errors. Surprisingly, small non-reasoning models suffice when decomposition is extreme enough, inverting the standard approach to hard problems.

Can AI systems improve themselves through trial and error?

DGM replaces formal proofs with empirical benchmarking and maintains an evolutionary archive of agent variants, achieving 2.5× improvement on SWE-bench and 2.2× on Polyglot by discovering capabilities like better code editing and context management.

Can rubrics and dense rewards work together without hacking?

DRO shows that using rubrics to accept or reject rollout groups—rather than converting rubric scores into dense rewards—prevents reward hacking. This separation preserves the categorical strength of rubrics while letting token-level rewards optimize within valid answers.

How can separating evaluation components make reward-hacking visible?

AgentCompass shows that separating Benchmark, Harness, and Environment into independent components enables comprehensive trajectory analysis that exposes reward-hacking and other failure modes invisible in scalar scores. This architectural shift makes evaluation both reproducible and diagnostically transparent.

Show all 11 sources
Can explicit behavior maps help weaker planners compete with stronger models?

A behavior-to-code mapping representation improved win rates by 10–19 points while reducing planner tokens by 8–13%. Weaker planners using this mapping matched stronger models' code localization across all precision and recall metrics.

Does binary reward training hurt model calibration?

Binary correctness rewards incentivize high-confidence guessing because they don't penalize confident wrong answers. Adding the Brier score as a second reward term mathematically guarantees joint optimization of accuracy and calibration without trade-off.

Can breaking down instructions into checklists improve AI reward signals?

RLCF and RaR methods decompose instruction quality into verifiable sub-criteria, improving performance on benchmarks like FollowBench and HealthBench. This decomposition principle reduces overfitting to superficial artifacts that plague holistic reward models.

Can reward models benefit from reasoning before scoring?

Three independent teams (RRM, RM-R1, DeepSeek-GRM) discovered that adding chain-of-thought reasoning before reward scoring enables adaptive test-time compute scaling for evaluation. Reasoning-based approaches raise the capability ceiling of reward models beyond what outcome-based evaluation achieves.

Is the exploration-exploitation trade-off actually fundamental?

Hidden-state analysis using Effective Rank metrics shows near-zero correlation between exploration and exploitation, revealing the trade-off emerges only at token level. VERL demonstrates simultaneous enhancement achieving 21.4% accuracy gains on Gaokao 2024.

Does reinforcement learning update only a small fraction of parameters?

Across seven RL algorithms and ten LLM families, RL induces intrinsic parameter sparsity of 5–30% without explicit regularization. Critically, these sparse updates are nearly full-rank and nearly identical across random seeds, indicating structural rather than arbitrary parameter selection.

Papers this line draws on 8

The research behind the notes this line reads — ranked by how closely each paper relates.

Research prompt for your LLMexpand ↓

Copy into ChatGPT or Claude to take this line of inquiry further — it asks the model to find newer work and re-test which earlier constraints still hold.

You are an ML research analyst. Still-open question: can system-level engineering fixes — how tasks are decomposed, rollouts organized, evaluation gated — replace hand-designed reward heuristics entirely?

What a curated library found — and when (dated claims, not current truth; findings span ~2024–2026):
- Tree-GRPO uses the branching shape of rollouts to convert a single end-of-trajectory reward into step-wise process signals, eliminating the separate process reward model and hand-annotated step labels (~2025).
- MAKER decomposes a task into minimal subtasks with per-step voting, hitting million-step reliability using small non-reasoning models — no sophisticated reward shaping (~2025).
- Darwin Gödel Machine swaps formal correctness proofs for plain empirical benchmarking (~2025).
- DRO keeps rubrics but uses them as accept/reject gates on whole rollout groups; the structural move — not a cleverer formula — is what blocks reward hacking (~2025).
- BUT some limits are reward-mathematical: binary correctness rewards provably degrade calibration; the fix is a Brier scoring term, not plumbing. And exploration–exploitation shows near-zero correlation once you measure hidden states — a token-level measurement artifact (~2025).

Anchor papers (verify; mind their dates): Tree Search for LLM Agent RL, arXiv:2509.21240 (2025); Solving a Million-Step LLM Task, arXiv:2511.09030 (2025); Darwin Gödel Machine, arXiv:2505.22954 (2025); Beyond the Exploration-Exploitation Trade-off, arXiv:2509.23808 (2025).

Your task:
(1) Re-test each constraint: for every finding, judge whether newer models, training, tooling, orchestration (memory, multi-agent), or evaluation have relaxed or overturned it. Separate the durable question from the perishable limitation; cite what resolved it, and say where a constraint still holds.
(2) Surface the sharpest CONTRADICTING or SUPERSEDING work from the last ~6 months — especially disagreement over whether reward-level fixes (calibration, subjectivity) are truly irreducible to engineering.
(3) Propose 2 research questions assuming the regime may have moved.

Cite arXiv IDs; flag anything you cannot ground in a real paper.