explainx.ai0k
TrendingAI News TodayPathwaysSkills
Pricing
explainx.ai

Upskill in AI — 16 free pathways, live workshops & bootcamps, and 50+ courses from practitioners. Plus the skills, tools, and MCP servers to practice on.

follow us

follow on google

Add explainx.ai as a preferred source

corporate training

support@explainx.ai

get started

Find your pathTake Free Evaluation

community

Join the community

learn

mind: share how you thinkpathways — start freeworkshopsbootcampscoursescompare Explainxcertificationsmock testsexplainx universitycorporate traininglearn skills & mcp

discover

skillsmcp serversexplainx mcpestacktoolsmdx readeragentsllmsdesignsdictionarypeopleagi trackerfelony benchranks

company

aboutvisionmissionteaminstructorsteach on explainxpartnershipscommunityhackathonscareers

content

daily AI newsstate of AI — live resultsblogreleasespromptsgeneratorsresource libraryfor LLMsexplainx.ai kids

solutions

all solutionsdeveloper upskillingmarketing upskillingproduct manager upskillingleadership upskilling

newsletter · weekly

Get AI news, tools, and insights in your inbox.

supportcontactprivacytermsdata rightshow we create contentsubmission guidelines

© 2026 AISOLO Technologies Pvt Ltd

explainx.ai

On this page

  • TL;DR
  • What Sutton actually argued in 2019
  • What is new in November 2026
  • Sutton’s longer-standing LLM critiques (context)
  • Tworek and the neolab wave
  • The scaling optimists’ side in The Decoder’s account
  • Jayden Teoh’s nuance — ideas do not have to “scale forever”
  • What this means for what you build this month
  • Chess, Go, and speech — why Sutton’s essay still gets misread
  • Altman’s math example and the limits of anecdotal scaling proof
  • Classroom and hiring effects
  • Synthetic data, world models, and robotics
  • Related reading
← Back to blog

explainx / blog

Richard Sutton on LLM Scaling: Bitter Lesson Pushback in November 2026

AI Research, Richard Sutton, LLM Scaling, Reinforcement Learning

Part of AI Research

Richard Sutton says brute-force compute alone is not enough for intelligence. explainx.ai maps the November scaling debate versus Oak Lab and frontier CEOs.

Nov 8, 2026·8 min read·Yash Thakker
add explainx.ai
go deep
Richard Sutton on LLM Scaling: Bitter Lesson Pushback in November 2026

Richard Sutton — author of the 2019 Bitter Lesson and 2024 Turing Award co-laureate for reinforcement learning — posted on X around November 8, 2026 that “brute force computation is not enough for intelligence,” that “clever new methods are needed,” and that “the science of AI is far from finished.” The Decoder published a Sunday piece tying the post to Jerry Tworek’s critique of transformer-only scaling and to counter-quotes from Sam Altman and Dario Amodei. For builders, the fight is not academic nostalgia. It is about whether today’s recipe — massive pretraining on web text, then alignment passes — is a plateau or a runway.

explainx.ai already covered Sutton’s Oak Lab startup bet on algorithms that learn from experience. This article tracks the November public flare-up, not a new Oak release.

Weekly digest3.6k readers

Catch up on AI

Curated AI updates on agents, skills, and MCP — delivered to your inbox. Unsubscribe anytime.

TL;DR

table · 2 cols
QuestionShort answer
Is Sutton anti-scale?No — his essay favors methods that gain from more compute, not hand-built knowledge alone.
Is Sutton anti-LLM?Mostly anti-static-LLM — finite internet data, weights frozen after training, limited continual learning.
Who agrees publicly?Researchers The Decoder names, including Jerry Tworek and Jayden Teoh (with nuance).
Who disagrees in the piece?Altman and Amodei, cited as scaling optimists leading OpenAI and Anthropic.
New product to install?No — commentary and neolab context only.
Relation to Oak Lab?Same intellectual lineage; see the Oak Lab guide.

What Sutton actually argued in 2019

Reward-hacking shortcut under an obstacle, echoing Tworek’s claim that transformer scaling misread the Bitter LessonReward-hacking shortcut under an obstacle, echoing Tworek’s claim that transformer scaling misread the Bitter Lesson

The Bitter Lesson is short and blunt. Sutton’s opening claim: over 70 years, general methods that leverage computation beat approaches that embed human domain knowledge — by a large margin. Chess, Go, speech, and vision each show researchers clinging to handcrafted structure until search and learning at scale win.

Two methods, in Sutton’s account, scale especially well: search and learning. That is why his 2026 X-line is not “algorithms do not matter.” It is closer to: the algorithms we are over-investing in today may be the wrong general methods.

In explainx.ai’s small-model economics thread, Hacker News commenters already fought over how to read the Bitter Lesson — scale vs cost vs task fit. November’s Sutton post reopens the same parse error at lab-founder scale.

What is new in November 2026

The Decoder’s November 8 story is a synthesis piece, not a paper drop. Its news value is timing:

  1. Sutton’s X post restates that compute without new methods is insufficient.
  2. Social uptake on X reportedly made the line a community flashpoint the same weekend.
  3. Tworek is quoted framing misread Bitter Lesson theology as damaging — “reward-hacked the brains of a whole generation of scientists” in The Decoder’s paraphrase.
  4. Jayden Teoh adds a moderation angle: promising ideas were dismissed for not looking “Bitter Lesson enough,” even when they later enabled cleaner general methods.
  5. Frontier Radar #5 is cited as tracking 45 neolabs betting on gaps Sutton and Tworek describe.

None of that replaces peer review. It does tell builders what senior researchers are arguing about in public while METR acceleration thresholds and frontier model launches dominate product news.

Sutton’s longer-standing LLM critiques (context)

The Decoder reminds readers Sutton did not spring from nowhere:

  • He has criticized scaling LLMs alone as insufficient for continual intelligence.
  • He has called reliance on synthetic data a “big mistake” in summarized accounts — the real world is vastly larger than any simulation.
  • He wants agents with world models that keep learning without catastrophic forgetting — aligned with Oak Lab’s public story in our July coverage.

If you build agents that loop for days, that is the tension: static weights versus runtime learning. explainx.ai’s harness reliability work shows how brittle long-horizon agent stacks are even without solving Sutton’s continual-learning problem.

Tworek and the neolab wave

Rising scaling curve with green points along it, framing the compute-versus-algorithm argumentRising scaling curve with green points along it, framing the compute-versus-algorithm argument

The Decoder places Tworek as an ex-OpenAI researcher now running Core Automation, hunting algorithms beyond pretraining plus reinforcement learning. That sits in the same bucket as Sutton’s Oak Lab, John Carmack’s Keen lineage, and other “neolabs” explainx.ai has tracked when founders leave frontier labs to chase non-transformer-default paths.

For practitioners, neolabs matter as option value: most production code still calls frontier APIs or open-weight transformers. Neolabs are where failure modes get explored early — continual learning, world models, planning at low watts — even when shipping calendars stay on GPT-class and Claude-class models.

The scaling optimists’ side in The Decoder’s account

The Decoder quotes Sam Altman arguing LLM scaling is not exhausted and pointing to a model that reportedly disproved a math conjecture humans had not cracked. It quotes Dario Amodei describing scaling as a “rainbow with no end.” The piece notes both men lead companies whose economics assume frontier scaling continues — disclosure that matters when you weigh quotes.

Builders should read those lines as strategic commitments, not as falsified science. Altman’s example, if accurately reported, is evidence that current stacks still surprise on some closed domains. Sutton’s counter is that surprise on math benches does not equal continual learning in the open world.

Jayden Teoh’s nuance — ideas do not have to “scale forever”

The Decoder summarizes Jayden Teoh arguing that ideas once seen as un-Bitter-Lesson were later replaced by cleaner general methods — without making the original ideas “wrong.” Research culture, in that telling, over-punishes heterodox work because scaling theology became social law.

That matters if you fine-tune, distill, or invent architectures that will not train at trillion-parameter scale on day one. The community may still adopt your trick as a stepping stone — a pattern visible in open-weight license and merge culture even when headline labs stay centralized.

What this means for what you build this month

Sutton’s November post will not change your Tuesday API bill. It should change how you read roadmap claims:

| If you mostly consume APIs | Keep evaluating models on your evals, not on scaling slogans alone. | | If you train or fine-tune | Treat static datasets as a ceiling; plan for refresh and regression. | | If you build agents | Separate harness engineering (agent skills, MCP) from learning at runtime — today’s default is still prompt plus tools, not Sutton-style continual RL. | | If you pick small models | Cost wins in local MLX stacks remain real even if frontier scaling continues. |

Chess, Go, and speech — why Sutton’s essay still gets misread

The 2019 essay is not abstract philosophy. Sutton walks chess, Go, speech, and vision in sequence. Each time, teams invested in human structure until search plus learning at scale won — often bitterly, for the researchers who bet on craftsmanship.

That history is why Tworek’s “reward hacked” line lands: the community may be repeating the premature human-structure phase, but this time with transformer scaling as the structure. Sutton’s November post says the next chapter still needs new methods, not only more FLOPs on the same architecture.

Readers who only know Sutton from memes should read the original once. It is short, dated March 13, 2019, and free on incompleteideas.net.

Altman’s math example and the limits of anecdotal scaling proof

The Decoder reports Altman citing a model that disproved a math conjecture. Treat that as an existence proof for surprises, not as proof that scaling laws have no knee:

  • A single benchmark win does not show continual learning in production agents.
  • Math domains with generatable training data are the easy regime Sutton himself separates from messy real-world interaction.
  • Corporate leaders have structural incentives to emphasize runway; Sutton has structural incentives to emphasize unexplored algorithm space.

Good engineering keeps both ideas in head at once: ship with frontier APIs while watching neolab outputs for something that changes your fine-tuning or RL stack.

Classroom and hiring effects

Jayden Teoh’s point — ideas dismissed for not “looking Bitter Lesson enough” — has HR-shaped consequences. Labs may filter research proposals that do not mention scale in the first paragraph. Startups may over-rotate to MoE width because investors recognize the vocabulary.

If you hire researchers or staff applied scientists, ask for problem-first pitches, not scale-first pitches. If you are junior, document small ideas that unlocked big runs — Teoh’s argument is that those stepping stones deserve credit even when a later general method supersedes them.

Synthetic data, world models, and robotics

Green chip beneath a cloud outline, contrasting cloud-scale LLM training with embodied world modelsGreen chip beneath a cloud outline, contrasting cloud-scale LLM training with embodied world models

The Decoder ties Sutton’s synthetic-data skepticism to robotics world models as a place scaling optimists still invest — Altman is quoted calling world models useful while favoring more LLM scaling. That split is the practical debate: language priors versus sensorimotor experience.

Readers following Gemini robotics or NVIDIA embodied stacks should hear Sutton as warning that internet text is a thin slice of state space — not as telling you to uninstall your simulator.

Related reading

  • Richard Sutton Oak Lab — algorithms beyond static LLM training
  • Small models, Luna economics, Bitter Lesson HN thread
  • METR and Anthropic acceleration thresholds
  • Open-weight licenses and merge culture
  • Agent skills complete guide
  • Harness leaderboard reliability
  • MLX on Apple Silicon local LLM guide

Sutton quotes and third-party paraphrases are accurate as of November 8, 2026, per The Decoder and the 2019 Bitter Lesson essay on incompleteideas.net — not as a verified full-text archive of Sutton’s X post.

Spotted something out of date? Let us know.

People in this article

  • Dario Amodei →Co-founder and CEO of Anthropic
  • Sam Altman →Co-founder and CEO of OpenAI
Explore people in AI →
Yash Thakker

Written by

Yash Thakker

Yash is an AI expert with over 300K learners. Join his workshops →

View Yash Thakker in People in AI →

Related posts

Jul 14, 2026

Richard Sutton’s Oak Lab — New Algorithms for AGI Beyond Static LLM Training

The father of reinforcement learning left John Carmack's Keen to launch Oak Lab — algorithms that learn from runtime experience, not curated datasets. Sutton's OaK architecture targets continual world models and 20W planning. explainx.ai explains the AGI neolab wave and the Bitter Lesson tension.

Oct 23, 2026

General Reasoning RLCR: Training a 120B Model as an Agent Organisation

On October 23, 2026 London lab General Reasoning introduced Reinforcement Learning from Collective Rewards (RLCR) and its first long-horizon model, Avalon-M1-Mini (120B). explainx.ai explains the idea, what the team says it found, and which parts still need the technical report and released weights to check.

Oct 22, 2026

Perplexity JOLT: Train the Teacher to Teach, Match GRPO With 6.5x Fewer Tokens

Perplexity Research published JOLT, a post-training method where one model acts as a privileged teacher and an unprivileged student, and the teacher is trained to give guidance the student can use. JOLT+ adds outcome rewards and beats GRPO in every reported setting.