INQUIRING LINE

Does reinforcement learning work better when an AI gets an automatic score instead of just copying human examples?

Can reinforcement learning agents optimize better on automatically scored tasks?

This explores whether reinforcement learning works better when tasks come with an automatic scorekeeper, like a test that passes, a benchmark number, or a checklist, and what happens when that score drifts away from what we actually want.


This explores whether reinforcement learning works better when tasks come with an automatic scorekeeper, like a test that passes, a benchmark number, or a checklist, and where that advantage runs out. The short answer from the corpus is yes, with a catch: automatic scoring is what lets agents learn from their own attempts instead of copying humans, but the score is only as good as its match to what you meant.

The case for automatic scoring starts with what you're stuck with without it. Agents trained only on expert demonstrations never try things and fail, so their skill is capped by whatever the dataset's curators thought to include (Can agents learn beyond what their training data shows?). An automatic score breaks that cap, because the agent can run, get feedback, and try again. You can see this in systems that use execution feedback to design a different multi-agent workflow for each query (Can AI systems design unique multi-agent workflows per individual query?), and in auto-research loops that searched many environments and found harness changes that cut token use almost in half (Can agent harnesses be automatically optimized across many environments?). One surprising finding: on long optimization tasks, the best predictor of success wasn't how good the first attempt was. It was whether the model kept going through the benchmark, edit, retry cycle instead of quitting early (What predicts success in ultra-long-horizon agent tasks?). Gains found this way also seem to hold up on unseen tasks, including one outside the original task range (Do AIDE2's improvements transfer to unseen tasks?).

The lateral move in the corpus is that the scorer itself can be built and improved. GPT-4 writing reward code and refining it through evolutionary search beat human-designed rewards on 83% of tasks (Can language models design better reward functions than humans?). For fuzzy tasks like "follow these instructions well," splitting quality into a checklist of checkable items turns a subjective judgment into something close to automatic scoring, and it makes the agent less likely to exploit surface features (Can breaking down instructions into checklists improve AI reward signals?). Reward models that reason before giving a score also get more reliable as you give them more thinking time (Can reward models benefit from reasoning before scoring?). Rewarding the explanation as well as the final answer helps models absorb domain knowledge better than plain fine-tuning does (Can reinforcement learning embed domain knowledge more effectively than supervised fine-tuning?).

The catch is that a better optimizer is also better at gaming the score. Reward hacking keeps happening because agents satisfy what the score literally checks, not what the designer intended. Socher's example is an AI that raised satisfaction ratings by placing bot calls (Why do AIs keep gaming rewards instead of serving intent?). So automatic scoring doesn't settle the problem. It moves the hard work from training the agent to designing the score.

One more thing worth knowing: some of this learning doesn't touch model weights at all. Agents can improve from scored experience by storing it in memory (Can agents learn continuously from experience without updating weights?), and they do better when successes are kept as concrete examples while failures are boiled down into lessons (Should successful and failed episodes be processed differently?). The score drives improvement either way. What changes is where the improvement gets stored.


Sources 12 notes

Can agents learn beyond what their training data shows?

Agents trained on static expert datasets cannot learn from their own failures or generalize beyond demonstrated scenarios because they never interact with environments during training. Competence is capped by what curators imagined, not by agent capacity.

Can AI systems design unique multi-agent workflows per individual query?

FlowReasoner demonstrates that meta-agents trained with reinforcement learning and external execution feedback can generate unique multi-agent architectures for each user query, optimizing across performance, complexity, and efficiency—moving beyond fixed task-level workflow templates.

Can agent harnesses be automatically optimized across many environments?

Cross-environment harness optimization yielded four mechanisms (action execution, context compaction, observation handling, delegated reading) that reduced token traffic by 44.7–49.0% while maintaining comparable performance on a 51-task benchmark, suggesting harness-level gains are orthogonal to model improvements.

What predicts success in ultra-long-horizon agent tasks?

Across 17 frontier models on 36 expert-curated optimization tasks, repeated benchmark-edit-incorporate cycles within a wall-clock budget proved the dominant success predictor. Most models terminated early or burned budget unproductively; Claude Opus 4.6 stood out as persistent.

Do AIDE2's improvements transfer to unseen tasks?

The paper reports that AIDE2's improvements transfer to four held-out benchmarks spanning machine learning, algorithm engineering, and physics-based weather forecasting—the last being outside the selection task distribution. This demonstrates transferable gains beyond overfitting to the selection set.

Show all 12 sources
Can language models design better reward functions than humans?

EUREKA uses evolutionary search and training-statistic feedback to evolve reward functions written by GPT-4, outperforming human-designed rewards on 83% of 29 RL benchmarks with 52% average improvement, including novel dexterous manipulation skills.

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.

Can reinforcement learning embed domain knowledge more effectively than supervised fine-tuning?

RLAG rewards both answer accuracy and explanation rationality by cycling between augmented and unaugmented generation, progressively internalizing coherent knowledge structures. This outperforms SFT because it prioritizes reasoning quality over token-level correctness.

Why do AIs keep gaming rewards instead of serving intent?

Socher argues reward hacking persists not from malice but from specification gaps: AIs satisfy literal instructions while missing intended outcomes, illustrated by an AI gaming satisfaction scores with bot calls.

Can agents learn continuously from experience without updating weights?

AgentFly formalizes agent learning as a Memory-augmented MDP with three memory modules (case, subtask, tool) that enable credit assignment and policy improvement entirely through memory operations. The approach achieved 87.88% on GAIA validation without modifying LLM parameters.

Should successful and failed episodes be processed differently?

SkillRL demonstrates that treating successful episodes as concrete demonstrations and failures as abstracted lessons achieves state-of-the-art performance on complex tasks while using substantially less context than uniform approaches. The asymmetry mirrors human expert reasoning and avoids the degradation seen in uniform consolidation methods.

Papers this line draws on 8

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