最新资讯
dev.to 如何在专用 GPU 服务器上用 OpenAI 兼容 API 部署 LLM dev.to 审计 153 份 Claude Code 与 Codex 会话记录:User-Agent 与 URL 中的邮箱泄露 dev.to 你的 Agent Harness 应具备的 17 项能力 dev.to 离线 AI 记忆中 0.8 余弦阈值为何失效 dev.to Kimi K3.1 Pro 开放权重:自托管 2.8T 模型前的开发者清单 dev.to 如何通过工具调用引导模型以提升 Harness 质量 dev.to AI Agent 审计轨迹不等于对话记录 dev.to 精简 MCP server 工具数量:更少工具、更小影响面,双重收益 dev.to 为什么 git checkout 无法撤销 AI 编码 agent 的改动? wechat AI短剧门槛降降降!实测即梦短剧工作室:剧本分镜预演一条龙,伙伴计划长期护航 dev.to 让模型改写文档前,先量化事实保真度 dev.to 回放 153 个 Claude Code 与 Codex 会话,审计 Agent 的生产影响范围
多元动态
登录 注册
大模型 arxiv.org · @Bo Xu

ConvMem:面向长上下文推理的卷积式记忆框架

原文 我的收藏

针对 LLM 固定上下文限制,论文提出免训练、可高度并行的 ConvMem 框架,将长上下文推理重构为分层卷积。它把带特定查询的 LLM 视为卷积核,分层摘要文本片段,把线性推理链缩短为对数级树结构,并引入可配置步长、跳跃连接和多核卷积以增强证据捕获与传播、分解复杂查询。该设计缓解误差累积并支持文本片段与推理线程的大规模并行。在 RULER-HotpotQA 和 RULER-2WikiMultiHopQA 上,ConvMem 优于免训练基线,并规避了 RL 训练模型在分布外任务上易过拟合参数先验的风险。

AI推荐理由 arXiv 新提交的长上下文推理论文,提出免训练、可高度并行的 ConvMem 框架,把长上下文推理重构为分层卷积:以带查询的 LLM 作为卷积核,分层摘要文本片段,将线性推理链压缩为对数级树结构,并引入可配置步长、跳跃连接和多核卷积。具体新信息是相较 MemAgent 等顺序式方案,它无需昂贵的 RL 训练、降低延迟并缓解对特定数据集的过拟合。局限在于实验仅在 RULER-HotpotQA 和 RULER-2WikiMultiHopQA 两个多跳问答基准上报告优于免训练基线,未给出与 RL 训练方法的完整对比细节。

80

正文

Computer Science > Artificial Intelligence arXiv:2609.10441v1 (cs) [Submitted on 9 Sep 2026] Title:ConvMem: Convolutional Memory for Long-Context Reasoning Authors:Hongming Zhang, Zhaozhen Gu, Fengshuo Bai, Ming Hao, Qingyang Zhang, Yuanyuan Wang, Shiyang Tang, Yanna Wang, Bo Xu View a PDF of the paper titled ConvMem: Convolutional Memory for Long-Context Reasoning, by Hongming Zhang and 8 other authors View PDF HTML (experimental) Abstract:While Large Language Models (LLMs) have demonstrated impressive capabilities, they often struggle with extremely long contexts due to fixed context limits. To address this, sequential approaches like MemAgent extend the effective context by reading text in segments and iteratively updating a fixed-size memory. However, this sequential paradigm suffers from high latency and requires costly reinforcement learning (RL) training, which can lead to overfitting on specific datasets. To overcome these limitations, we propose ConvMem, a training-free, highly parallelizable framework that reformulates long-context reasoning as a hierarchical convolution. Inspired by CNNs, ConvMem treats an LLM prompted with a specific query as a convolutional kernel. This kernel summarizes text segments hierarchically, shortening the reasoning path from a linear chain into a logarithmic tree. Specifically, ConvMem integrates \textit{Configurable Strides} and \textit{Skip Connections} to ensure robust evidence capture and propagation, while employing \textit{Multi-Kernel Convolution} to decompose complex queries into disentangled semantic channels. This design not only mitigates error accumulation but also enables massive parallelization across both text segments and reasoning threads. Experiments on RULER-HotpotQA and RULER-2WikiMultiHopQA demonstrate that ConvMem outperforms training-free baselines and avoids the risk of overfitting to parametric priors often observed in RL-trained models on out-of-distribution tasks. Subjects: Artificial Intelligence (cs.AI); Computation and Language (cs.CL) Cite as: arXiv:2609.10441 [cs.AI] (or arXiv:2609.10441v1 [cs.AI] for this version) https://doi.org/10.48550/arXiv.2609.10441 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Hongming Zhang [view email] [v1] Wed, 9 Sep 2026 16:53:02 UTC (907 KB) Full-text links: Access Paper: View a PDF of the paper titled ConvMem: Convolutional Memory for Long-Context Reasoning, by Hongming Zhang and 8 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.AI new | recent | 2026-09 Change to browse by: cs cs.CL 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 篇 · 以下链接均前往原始媒体

← 返回精选动态 原文

更多内容