arXiv:2602.01719cs.CL2026-02中稿 · ICLR被引 14

通过信息增益优化长文本压缩,提升大模型在长上下文中的效率与准确率。

COMI: Coarse-to-fine Context Compression via Marginal Information Gain

  • 基于边际信息增益动态分配压缩比例,兼顾语义相关性与多样性。
  • 在32倍压缩下,自然问题问答任务上准确率提升约25点。
  • 适合需要高效处理长文本的大模型应用,如智能客服、文档摘要。

大语言模型在各类任务中表现卓越,但在长上下文场景下仍受限于计算效率低下和信息冗余。上下文压缩方法通过显著缩短输入长度并消除冗余来缓解此问题。我们提出COMI,一种粗粒度到细粒度的自适应上下文压缩框架,在高压缩率下联合优化语义相关性与多样性。引入边际信息增益(MIG),定义为单元对查询的相关性减去与其他单元的语义冗余,指导压缩过程以优先保留既相关又低冗余的信息。该框架分两阶段运行:(1) 粗粒度分组重分配,将上下文划分为组,并根据组间MIG动态分配压缩率,使压缩预算与信息价值分布一致;(2) 细粒度标记融合,组内标记通过基于组内MIG的加权机制合并,有效保留关键语义且避免冗余累积。在多个问答(如NaturalQuestions、2WikiMQA、HotpotQA、NarrativeQA)和摘要任务(如MultiNews)上,使用不同骨干模型(如LLaMA-2-7B、Qwen2-7B)进行实验,结果表明COMI显著优于现有基线,例如在Qwen2-7B上,针对NaturalQuestions任务在32倍压缩约束下,精确匹配(EM)提升约25点。

原文摘要 · Abstract (English)

Large Language Models (LLMs) have demonstrated exceptional capabilities across diverse tasks. However, their deployment in long context scenarios remains hindered by computational inefficiency and information redundancy. Context compression methods address these challenges by significantly reducing input length and eliminating redundancy. We propose COMI, a coarse-to-fine adaptive context compression framework that jointly optimizes for semantic relevance and diversity under high compression rates. We introduce Marginal Information Gain (MIG), a metric defined as the relevance of a unit to the input query minus its semantic redundancy with other units, guiding the compression process to prioritize information that is both relevant and low redundant. The framework operates in two stages: (1) Coarse-Grained Group Reallocation, where the context is partitioned into groups and dynamically assigned compression rates based on inter-group MIG, ensuring compression budgets align with information value distribution; and (2) Fine-Grained Token Merging, where tokens within each group are fused via an intra-group MIG-based weighting mechanism, thereby preserving key semantics while avoiding the accumulation of redundancy. Extensive experiments across question-answering (e.g., NaturalQuestions, 2WikiMQA, HotpotQA and NarrativeQA), summarization (e.g., MultiNews) with various backbones (e.g., LLaMA-2-7B, Qwen2-7B) show that COMI outperforms existing baselines by a large margin, e.g., approximately 25-point Exact Match (EM) improvement under 32x compression constraint with Qwen2-7B on NaturalQuestions.

上下文压缩大模型优化信息增益长文本处理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。