forecast

Continual learning may be verifiable and solvable by amnesiac models

Because online learning has clean verifiable proxies, models a year or two smarter than current ones might crack continual learning even without persistent memory, and it was not obvious in advance that continual learning would be harder than Navier-Stokes.

forecastpending

Speaker

Dwarkesh Patel

Evidence Quote

“non-online-learning models a year or two smarter than the ones currently solving Millennium Prize problems won’t be able to crack it, even if they are amnesiacs”

Source

Dwarkesh Patel Podcast - The avalanche that hit math is coming for AI development— Dwarkesh Patel Podcast
Created: 11/17/2026, 6:27:26 AM

Your notes

Loading notes...