最新资讯
dev.to 银行 77 意图分类最便宜 LLM:GPT-6.1 Terra 每次成功任务 $0.000727 theinformation.com Chesky的副业:Airbnb向CEO新设AI实验室出售IP theverge.com OpenAI 宣布数据中心项目不再与公职人员签署保密协议 dev.to NVIDIA 发布四个开放 Cosmos 3 仿真模型 dev.to 真实 MCP 客户端击穿我们服务器的五种方式 theverge.com Airbnb 正在开发 AI 旅行 agent,计划 2027 年上半年推出 wechat 这可能是美国AI最魔幻的一天。 nytimes.com 美众议院共和党领袖要求 Nvidia 黄仁勋闭门简报 pub.towardsai.net 忘掉我:为记忆而设计的系统中的删除难题 marktechpost.com Google 发布 Gemini Omni 1.2 Flash:15 秒视频,每秒 0.07 美元 unite.ai Airbnb 计划推出覆盖规划、预订与客服的 AI 旅行 agent techcrunch.com Airbnb 称将于 2027 年上半年推出 AI 旅行代理
多元动态
登录 注册
大模型 arxiv.org ·

遵循潜在路线图:用锚点词元为扩散大语言模型实现可撤销解码

原文 我的收藏

该 arXiv 论文提出免训练框架 ASRD(Anchor Supervised Revocable Decoding),针对扩散大语言模型(dLLM)可撤销解码中错误传播与局部错误强化两个问题,在嵌入空间将解码上下文解耦为经时序一致性识别的可信 Anchor Tokens 与不确定候选,并引入 Anchor-Guided Generation(向掩码位置注入熵加权锚点信号以校正注意力)和 Anchor-Perturbed Verification(对不确定候选施加正交扰动以打散脆弱局部共识并重新掩码)两种机制。摘要称在数学与代码基准上相较近期 remasking 基线准确率最高提升 6.4%,推理吞吐最高加速 7.2 倍,代码已公开。

AI推荐理由 arXiv 论文(v5,2026-09-16 修订),来源可信、摘要信息密度高。提出免训练的 ASRD 框架,在嵌入空间将解码上下文解耦为通过时序一致性识别的可信 Anchor Tokens 与不确定候选,并用 Anchor-Guided Generation 与 Anchor-Perturbed Verification 两个机制缓解扩散 LLM 可撤销解码中的错误传播与局部错误强化。摘要报告在数学与代码基准上准确率最高提升 6.4%、吞吐最高加速 7.2 倍,并给出代码链接。局限:仅摘要级证据,未提供具体基准、模型规模与复现细节,提升幅度需以论文正文核实。

78

正文

Computer Science > Computation and Language arXiv:2606.16847 (cs) [Submitted on 15 Jun 2026 (v1), last revised 16 Sep 2026 (this version, v5)] Title:Follow the Latent Roadmap: Navigating Revocable Decoding for Diffusion LLMs with Anchor Tokens Authors:Yizhen Yao, Qinglin Zhu, Runcong Zhao, Xiangxiang Dai, Yanzheng Xiang, Yulan He, Lin Gui View a PDF of the paper titled Follow the Latent Roadmap: Navigating Revocable Decoding for Diffusion LLMs with Anchor Tokens, by Yizhen Yao and 6 other authors View PDF HTML (experimental) Abstract:Diffusion Large Language Models (dLLMs) offer a promising avenue for parallel generation but face a trade-off between decoding speed and quality. While revocable decoding strategies attempt to mitigate errors by verifying and remasking tokens, they typically operate within a mixed-quality context. This leads to two critical failures: \textit{Error Propagation}, where new tokens absorb toxic information from erroneous context, and \textit{Local Error Reinforcement}, where errors mutually reinforce each other to evade detection. To alleviate these challenges, we propose ASRD (Anchor Supervised Revocable Decoding), a training-free framework that operates within the embedding space. ASRD explicitly decouples the decoding context into trusted \textit{Anchor Tokens}, which are identified via temporal consistency, and uncertain candidates. Leveraging a dynamic Anchor Tokens Cache, we introduce two complementary mechanisms: (1) Anchor-Guided Generation, which injects entropy-weighted anchor signals into masked positions to implicitly rectify attention toward the reliable global skeleton; and (2) Anchor-Perturbed Verification, which applies orthogonal perturbations to uncertain candidate tokens, destabilizing and remasking errors driven by fragile local consensus. Extensive experiments on math and coding benchmarks demonstrate that ASRD outperforms recent remasking baselines, achieving accuracy improvements of up to 6.4\% while accelerating inference throughput by up to 7.2$\times$.The code is available at this https URL. Comments: Subjects: Computation and Language (cs.CL); Artificial Intelligence (cs.AI) Cite as: arXiv:2606.16847 [cs.CL] (or arXiv:2606.16847v5 [cs.CL] for this version) https://doi.org/10.48550/arXiv.2606.16847 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Yizhen Yao [view email] [v1] Mon, 15 Jun 2026 15:23:47 UTC (604 KB) [v2] Sat, 20 Jun 2026 11:33:42 UTC (604 KB) [v3] Tue, 14 Jul 2026 09:40:22 UTC (604 KB) [v4] Wed, 2 Sep 2026 11:15:54 UTC (696 KB) [v5] Wed, 16 Sep 2026 12:28:19 UTC (697 KB) Full-text links: Access Paper: View a PDF of the paper titled Follow the Latent Roadmap: Navigating Revocable Decoding for Diffusion LLMs with Anchor Tokens, by Yizhen Yao and 6 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.CL new | recent | 2026-06 Change to browse by: cs cs.AI 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?) 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 篇 · 以下链接均前往原始媒体

← 返回精选动态 原文

更多内容