← Dwarkesh Podcast

The next big breakthrough will be AIs learning on the job

第2026-06-26期2026-06-26English会员内容
收听本集00:00 / 19:53
阅读设置
按你的习惯阅读
正文字号
下载播客精读
把这一篇,带走慢慢读

英文 · 精读 · 当前版本

下载功能还未开放

正文语言

精读 · 按主题梳理核心观点、论证与案例。

§01The puzzle: computer use is verifiable but slow

Patel begins with a detour that turns out to be the spine of the argument: why has progress on computer use been so slow, given how obviously verifiable it is? Ordering the Etsy item, booking the venue, filing the taxes — success or failure is unambiguous, and yet the domain has advanced much more slowly than coding or math, which are equally verifiable.

He lists the standard explanations — less high-quality multimodal data during pretraining, video eating the context window faster — and then names the one he thinks is underrated: verifiability is not sufficient. A domain must also be grindable, in the specific sense that you can run many parallel rollouts against a deterministic, replayable simulator. Coding qualifies because you can hand a thousand agents identical containers with a repo and a missing feature.

Computer use does not, at least not trivially. A thousand agents cannot all try the same Amazon checkout flow, because the bots get detected and shut down. The workaround is cloning Slack, Gmail and the rest, which Patel calls labor-intensive and unscalable today — though he expects it to become tractable once models can rebuild complex applications faithfully, a procedure that doubles as an excellent RL objective for coding.

The generalization he draws is the important part: unless a domain admits a very replayable training target, models struggle to progress in it. The underlying reason is sample inefficiency during training, which is where the previous monologue left off.

好对话,值得读完整。

免费试读到此结束。开通书架会员,继续阅读全文,解锁中英对照与电子书下载。