跳到正文
arXiv cs.AI· Qi Wang, Yun Qu, Lizhou Cai, Heming Zou, Haoang Chi, Yiqin Lv, Xiang Li, Haiyan Feng, Mengyu Ge, Yize Geng, Yuhang Jiang, Yixiu Mao, Xiangyang Ji·· 2 小时前AI 评分36

走向 AGI 的扩展是否取决于 System-1 让 System-2 执行什么?

Does Scaling Toward AGI Depend on What System-1 Lets System-2 Execute?

AI 导读

清华大学等机构研究者在 arXiv 论文中提出“条件交互”框架:由轻量的 System-1 预测器评估候选交互效用,System-2 仅执行通过自适应阈值的交互,并用结果更新 System-1。在理想筛选与执行成本相同条件下,执行算力可降至约 1/ρ_u(ρ_u 为效用相关交互的密度);论文提出 ρ_u 可作为扩展效率的可测坐标,认为“有效算力”比总算力更适合描述 scaling。

正文 · 原文

Authors:Qi Wang, Yun Qu, Lizhou Cai, Heming Zou, Haoang Chi, Yiqin Lv, Xiang Li, Haiyan Feng, Mengyu Ge, Yize Geng, Yuhang Jiang, Yixiu Mao, Xiangyang Ji

View PDF HTML (experimental)

Abstract:Progress toward artificial general intelligence (AGI) has largely relied on scaling a resource-intensive executive, System-2, through larger models, more data and compute, longer reasoning, and more agents. We ask whether the next stage may come instead from co-designing it with System-1, a lightweight, semantically aware predictor that evaluates candidate interactions before execution, so that System-2 acts only on those worth their cost. Our answer is a qualified yes. We study \textit{conditional interaction}, a predict--gate--execute--update loop: System-1 estimates each candidate's utility, System-2 executes those admitted by an adaptive threshold, and the outcomes update System-1. The loop spans training, test-time reasoning, adaptive decision-making, and agentic tool use, with utility and cost defined by the application. Under ideal screening and equal execution costs, execution compute falls by a factor approaching $1/\rho_u$, where $\rho_u$ is the density of utility-relevant interactions (cost-weighted when costs differ); prediction errors, exploration, and distribution shift reduce the saving. We bound selection regret by predictor error and the utility margin. These results motivate our central hypothesis: $\rho_u$ is a measurable coordinate of scaling efficiency and makes informative compute a better description of scaling than total compute.
Subjects: Artificial Intelligence (cs.AI)
Cite as: arXiv:2610.39497 [cs.AI]
  (or arXiv:2610.39497v1 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2610.39497

arXiv-issued DOI via DataCite

Submission history

From: Yun Qu [view email]
[v1] Thu, 29 Oct 2026 07:00:32 UTC (3,514 KB)

来源:arXiv cs.AI · arxiv.org