最新资讯
stackoverflow.blog 欢迎来到芯片时代:半导体制造、AI 数据中心与芯片设计的未来 www.youtube.com AI Agent 总犯同样的错:CentralAgent AI 将记忆重构为经验系统 pub.towardsai.net Netflix 科学家建议重采样 LLM 评判:5 次仅将误差棒缩小 13% pub.towardsai.net Jev 作为 LLM 前的静默层:构建提示感知的模型路由器 reddit.com OpenAI 称 Astra 仅满足 10% 安全任务标准 dev.to FreeToken:在自有 GPU 上运行前沿 MoE 模型及其内存需求 dev.to 当 AI Agent 说“完成”时,究竟完成了什么? dev.to 部署 Underdog Bark 3.0 Pro:逐字转写、自定义后端与分块设置 dev.to 为艰难对话构建 AI:五个 Agent、一条安全正则与一位盲评监督者 techcrunch.com Palo Alto Networks 洽谈以 5 亿美元收购 AI Agent 安全初创公司 Clutch theinformation.com 黄仁勋被要求就涉华间谍指控向国会作简报 www.infoq.com Edera 推出 Object Capability Bounded Authority,试图将凭证与 AI Agent 工作负载隔离
多元动态
登录 注册
大模型 arxiv.org · @Andrew Gordon Wilson

模型增长、递归与边界算子如何影响 scaling 指数

原文 我的收藏

论文提出与传统认知相反的观点:架构干预可以改变预训练中的 scaling 指数,从而在算力增加时带来性能的指数级改善。作者以 looped transformer 的架构形式为锚点,指出循环(递归深度)可通过在训练中增加循环次数实现模型增长,且带或不带权重共享的模型增长对 scaling 指数改变最大。摘要称,一个 7.4B 的模型增长架构在 CORE 上以约 20 倍更少算力达到 GPT-3 13B 的水平,且算力效率收益随规模扩大而增加;在普通 transformer 中使用边界算子(归一化并注入较早的块)也能带来递增的算力效率收益,但幅度较小。

AI推荐理由 论文主张架构干预可改变预训练 scaling 指数,而非仅改变常数项,并以 looped transformer 的递归深度作为模型增长机制。摘要给出具体锚点:7.4B 的模型增长架构在 CORE 上以约 20 倍更少算力匹配 GPT-3 13B,且算力效率收益随规模增大;在普通 transformer 中加入边界算子也有较小但递增的效率收益。该结论若成立对训练算力规划影响较大,但摘要未给出完整实验设置与对照细节,需查原文核实。

80

正文

Computer Science > Machine Learning arXiv:2609.19107v1 (cs) [Submitted on 16 Sep 2026] Title:How Model Growth, Recursion, and Boundary Operators Influence Scaling Exponents Authors:Zixi Chen, Akshay Vegesna, Samip Dahal, Andrew Gordon Wilson View a PDF of the paper titled How Model Growth, Recursion, and Boundary Operators Influence Scaling Exponents, by Zixi Chen and 3 other authors View PDF HTML (experimental) Abstract:Scaling laws predict how loss decreases with increases in computation. We show, contrary to conventional wisdom, that architectural interventions can modify scaling exponents in pre-training, leading to exponential improvements in performance with increases in computation. As an anchoring point, we consider the architectural formulation of looped transformers. Although not typically used in this way, looping, also known as recursive depth, provides a mechanism for model growth, by increasing the number of loops during training. Model growth, with and without shared weights, provides the biggest changes to the scaling exponents. In particular, a 7.4B model growth architecture matches GPT-3 13B on CORE with roughly $20\times$ less compute, and has compute efficiency gains that increase with scale. Moreover, simply using a boundary operator in a vanilla transformer, which normalizes and injects an earlier block, also provides increasing compute-efficiency gains, although to a lesser extent. In the data-constrained, multi-epoch setting, standard looping has a useful regularizing effect, where we find it is compute-optimal to increase the number of loops with scale. These results can be understood through the lens of computational depth: for a given computational budget, we wish to increase the usable depth of the transformer, which can lead to efficiency gains that increase with scale. Subjects: Machine Learning (cs.LG) Cite as: arXiv:2609.19107 [cs.LG] (or arXiv:2609.19107v1 [cs.LG] for this version) https://doi.org/10.48550/arXiv.2609.19107 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Zixi Chen [view email] [v1] Wed, 16 Sep 2026 17:36:13 UTC (1,275 KB) Full-text links: Access Paper: View a PDF of the paper titled How Model Growth, Recursion, and Boundary Operators Influence Scaling Exponents, by Zixi Chen and 3 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.LG new | recent | 2026-09 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) IArxiv recommender toggle IArxiv Recommender (What is IArxiv?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

来源报道 · 1 篇 · 以下链接均前往原始媒体

← 返回精选动态 原文

更多内容