ImageNet Moment for Reinforcement Learning? [Prof. Jakob Foerster]
Summary
Foerster’s diagnosis is that deep reinforcement learning lost the hardware lottery because environments ran on CPUs while agents trained on GPUs. Putting both together on the GPU accelerates experimentation by orders of magnitude; Chris Lu reports a basic speedup of around 4,000×. If broader environments transfer, RL could finally become “a winner in the hardware lottery.”
GPU-native simulation could turn the looming real-data wall into a compute-only scaling opportunity. Foerster proposes learning in approximate environments that may run 10,000× faster, then transferring the resulting algorithms to expensive real settings such as Dota. JAX’s
jitandvmapmake millions of parallel instances practical, lowering the infrastructure advantage of the largest labs.More throughput is already simplifying RL algorithms, not merely making old ones faster. The lab’s PQN approach removes target networks and replay buffers, while black-box evolution strategies were unusually well suited to discovering policy objectives. The learned objective recovered clipping and rollback, added other unexplained features, and displayed “cautious optimism” toward unexpectedly good outcomes.
Automated algorithm discovery becomes dangerous when benchmarks quietly turn from measures into targets. Foerster calls targeting ARC “a terrible idea”: developers should pursue the broad space of human-solvable reasoning problems, leave ARC untouched during development, and use it only periodically alongside other measures. Otherwise LLM-driven program search will industrialize Goodhart’s law rather than produce transferable intelligence.
Foerster’s bet is to spend abundant compute discovering algorithms that remain sample-efficient in unfamiliar domains. Humans play chess creatively because they cannot simulate trillions of steps; evolution likewise used an “extraordinarily sample-inefficient process” to produce agents that adapt quickly. The meta-layer aims to number-crunch general learning rules, exploration strategies and imagination—not policies overfit to one game.
Multi-agent systems may supply both the architecture and the test-time compute needed for genuinely agentic AI. Foerster sees language, reasoning and theory of mind as products of interaction, and expects stronger agents to set subgoals, self-improve and reorganize into teams. “Multi-agent learning has been the future forever,” but reasoning-capable agents could now make decentralized swarm intelligence the next platform.
The episode’s governance call is that AI concentration poses a larger alignment problem than AI-versus-human conflict. Foerster accepts centralized resources only under transparent, democratically governed, CERN-like institutions, arguing that “this technology belongs to everyone, including people we don’t like.” His preferred end state is holistic alignment: personal AI representatives participating in a democratic network where superintelligence arises only through humans and their assistants.
Deep dive
1. Deep RL lost the hardware lottery, not its underlying promise
Foerster’s diagnosis: deep learning mapped cleanly onto GPUs, while deep RL split CPU-based environments from GPU-based agents. That mismatch created infrastructure and algorithmic complexity, slowing experimentation enough to make reinforcement learning appear fundamentally brittle.
The host’s pushback — worth keeping: changing an architecture or parameter can still break an RL system. Foerster attributes that sensitivity to researchers “hill climbing” on a tiny collection of environments because each run delivered a costly, sparse and noisy scientific signal.
Faster loops matter because researchers themselves are doing meta-learning. Foerster’s premise is that orders of magnitude more experience can improve the gradient guiding algorithm design, producing methods that are more robust and ultimately more sample-efficient in the physical world.
2. Synthetic environments turn the data wall into compute-only scaling
Foerster warns that the supply of readily available real-world data may run out. His alternative is “compute-only scaling”: use imperfect but blazing-fast simulations to discover learning procedures whose progress transfers into downstream tasks where physical experience is slow or expensive.
Dota carries the argument: an approximate version running 10,000× faster need not reproduce every detail if algorithms developed inside it generalize to the real game. Where source code is unavailable, Chris Lu suggests learning a GPU-resident dynamics model, as demonstrated by generated-game systems such as Genie.
This does not eliminate embodiment’s bottleneck; real agents must still gather physical experience. The bet is narrower and explicitly hedged: massive synthetic experience might discover algorithms that use scarce real-world interactions far more effectively.
3. JAX makes hyperscale experimentation accessible to small labs
Lu traces the approach to Model-Free Opponent Shaping, which had to learn across another agent’s entire training trajectory. With little more than free Google Colab compute, the team wrote simple environments in PyTorch and discovered how effective GPU-resident simulation could be.
JAX widened that opening. Its NumPy-like interface eased environment implementation,
jitcompiled programs for the GPU, andvmaptransformed a function for one environment into millions of parallel instances.Branch-heavy programs remain a weaker fit, but the lab’s Kinetix work showed how far the abstraction can stretch: a general physics simulator and renderer implemented entirely in JAX.
Lu estimates a basic speedup of around 4,000× even with relatively naïve JAX, with further gains possible through lower-level kernels. Foerster’s larger point is access: a small lab can now run experiments once reserved for heavily resourced organizations.
4. Hyperscale RL is producing simpler and stranger learning rules
Speed removes machinery as well as latency. Foerster highlights PQN, essentially parallel Q-learning across many agents and transitions: “No more target networks, no more replay buffers.” He hopes cleaner algorithms will also become more understandable and robust.
Mirror Learning supplied the theoretical starting point: if a drift penalty between the data-collecting policy and updated policy satisfies certain properties, repeated policy updates converge toward an optimal policy. PPO’s clipping rule is only one member of that larger design space.
The team parameterized alternative drift functions as neural networks. Although meta-gradients were the sophisticated consensus choice, black-box evolution strategies “swallow the bitter lesson,” estimating higher-order effects from samples and proving unusually well matched to GPU hyperscale.
The visualized DPO objective recovered PPO-like clipping but added a “too good to be true” response: a very large advantage constrained movement away from the reference policy, while a small advantage permitted more. It also rediscovered rollback: whereas the PPO objective leaves an over-deviated negative-advantage policy gradient-free, the discussion says DPO pushes it back toward the reference policy.
5. Learned objectives need interpretation before they can escape the JAX box
Foerster and Lu could not explain every learned feature, particularly several additional features beyond the familiar clipping behavior. Their honest conclusion is that whether those features encode something real remains an open research problem.
Human interpretation can turn a black-box objective into a symbolic, one-line Python rule. That matters because representative JAX environments are not the real world; a compact expression can transfer into other simulators, learned world models and downstream codebases.
Follow-up work made the objective time-dependent. It explicitly favored exploration early and became more conservative later, but the team has not found a satisfactory parametric description of the resulting manifold of drift functions.
LLMs offer two possible bridges: fit black-box objectives with symbolic code, or mutate programs directly while JAX supplies rapid fitness feedback. That creates a “virtuous cycle” between automated discovery, human interpretation and new theory.
6. ARC should measure general reasoning, never become the product target
Foerster’s warning is categorical: “The ARC challenge as a target for the community is a terrible idea.” ARC brilliantly exposes missing capabilities, but methods engineered around its tasks corrupt the very evidence it was designed to provide.
The host sharpens the objection: test-time training and active fine-tuning may solve ARC effectively under human supervision without delivering developer-aware generalization to a new task. Foerster agrees that solving one benchmark is not equivalent to spanning human reasoning.
His first remedy is procedural: work on broad human-level reasoning, never use ARC during method development, and perhaps consult it once a year alongside other human-solvable problems where LLMs struggle.
The more ambitious remedy makes benchmark generation a first-class research problem. If generated challenges genuinely span the relevant problem space, hill climbing them could improve broad capability; if LLM judges define “interesting,” automated search may simply exploit their inaccuracies.
7. Creativity is constrained search, while evolution is the meta-optimizer
Foerster treats creativity as the generator of worthwhile problems, curricula and candidate solutions; reasoning then explores and resolves them. Whether deduction feels creative depends less on its formal label than on “how are we doing it.”
Chess is his clean comparison. A human cannot simulate trillions of moves, so play requires intuition, imagination and unusual pathways; DeepMind’s chess-targeted approach could instead turn the challenge into brute-force number crunching, though Foerster says such methods have not really transferred to other domains.
The proposed compromise uses abundant samples to sharpen intuitions about general algorithms—planning, exploration and imagination—rather than overfitting policies to individual tasks. That is how Foerster hopes the meta-layer can deliver both compute scaling and human-like sample efficiency.
His evolutionary analogy supplies the causal story: humans are sample-efficient products of an “extraordinarily sample-inefficient process called evolution.” Meta-optimization spent vast historical computation producing an agent that can adapt to new situations.
8. Swarm intelligence links autonomy, alignment and open access
Foerster’s long-running hypothesis is that “intelligence is an emergent phenomenon of multi-agent interactions.” Other agents create the hardest environment, forcing theory of mind, language, teaching, coordination and cooperation beyond what interaction with static objects demands.
He sketches successive platforms: DNA and evolution, single cells, multicellular organisms, lifetime-learning animals, and finally groups that enabled the reasoning and cognitive skills distinctive to humans. Multi-agent AI could become the next platform, deploying test-time compute through rewiring, division of labor and renewed search.
Reward hacking is not uniquely artificial. Foerster points to scientific p-hacking around the
p < 0.05acceptance signal; every shaped reward invites exploitation. Today’s LLMs primarily imitate and are designed with limited agency, but agentic pre-training could explicitly teach goal pursuit.Strong agentic systems would likely set subgoals, improve their learning processes and form student-teacher teams, making apparent autonomy difficult to avoid. Foerster therefore prefers a decentralized swarm to a monolithic AGI, which he finds “quite dystopian.”
9. The central alignment conflict is over who holds the keys
Foerster’s open-source paper answered a discourse focused on open-model risks while neglecting closed-model concentration. Decentralized access, in his framing, preserves agency, democratic balance and innovation; closed systems risk accumulating extraordinary power under a small set of private actors.
The host grants that frontier AI may require centralized expertise and capital. Foerster separates scale from control: he supports CERN-style pooled resources when data, alignment methods and governance are transparent and publicly accountable—not when a private “Manhattan Project” serves maximum profit.
On catastrophic risk, Foerster insists that scale matters. Open dual-use systems may cause malicious use but also expose vulnerabilities and distribute defensive capacity; a runaway “paperclip maximizer” or profit maximizer could threaten Western democracies or the species itself.
His moral premise is expansive: AI learned from humanity’s collective cultural output, so “this technology belongs to everyone, including people we don’t like.” Equal access helps preserve international balance rather than reserving collective intelligence for a narrow Western elite.
10. Public infrastructure must preserve individual agency
Foerster concedes that open research currently depends on industry players such as Meta, one reason he spends half his time there. Longer term, he wants a CERN-like coalition pooling academic resources so tens of thousands of researchers can pursue an open moonshot.
His preferred destination goes beyond releasing model weights. In “holistic alignment,” each person has an AI representative, and superintelligence emerges only through a democratically governed network of humans and assistants—turning today’s race into a coordination problem AI itself might help solve.
Developers, he argues, should not be liable for deliberate misuse of an open model any more than hammer makers are liable for assaults. Otherwise society gets a censorious “hammering service” that decides which pictures users may hang rather than tools whose users retain responsibility.
The closing analogy is institutional: Google Search privatized the index to humanity’s “collective memory,” and closed AI now risks capturing its “collective intelligence infrastructure.” A model that says “computer says no” resembles a typewriter vetoing its author; Foerster sees open source as the immediate escape.