paper.dinq.meAI 与前沿科学顶会 · 学术新星雷达
登录 DINQ
返回新星榜
JT

Jie Tang

ICML 2026×4COLM 2026智能体与工具效率与系统检索与知识多模态代码
新星分资深
29
一作贡献0
核心/参与12
方向广度13
合作网络12
0 一作 · 5 篇 · ICML 2026 / COLM 2026

获取完整研究档案

首次获取该候选人的完整档案及 StartLux 评估共 20 积分;每位用户单独解锁,之后查看免费。主动刷新 20 积分。

联系方式

实时查找电子邮箱,费用不超过20积分;未找到邮箱不扣费。

2026 顶会论文

5
作者位次 #7/8COLM 2026Poster· Poster Session 2· Grand Ballroom· #137

IndexCache: Accelerating Sparse Attention via Cross-Layer Index Reuse

Yushi Bai · Qian Dong · Ting Jiang · Xin Lv · Zhengxiao Du · Aohan Zeng · Jie Tang · Juanzi Li

Sparse-attention indexers produce highly similar token selections across consecutive layers. IndexCache reuses indices from a few layers to the rest, cutting 75% of indexer cost with negligible quality loss and up to 1.82× prefill speedup.

摘要

Long-context agentic workflows have emerged as a defining use case for large language models, making attention efficiency critical for both inference speed and serving cost. Sparse attention addresses this challenge effectively, and DeepSeek Sparse Attention (DSA) is a representative production-grade solution: a lightweight lightning indexer selects the top-$k$ most relevant tokens per query, reducing core attention from $O(L^2)$ to $O(Lk)$. However, the indexer itself retains $O(L^2)$ complexity and must run independently at every layer, despite the fact that the resulting top-$k$ selections are highly similar across consecutive layers. We present IndexCache, which exploits this cross-layer redundancy by partitioning layers into a small set of Full layers that run their own indexers and a majority of Shared layers that simply reuse the nearest Full layer's top-$k$ indices. We propose two complementary approaches to determine and optimize this configuration. Training-free IndexCache applies a greedy search algorithm that selects which layers to retain indexers by directly minimizing language modeling loss on a calibration set, requiring no weight updates. Training-aware IndexCache introduces a multi-layer distillation loss that trains each retained indexer against the averaged attention distributions of all layers it serves, enabling even simple interleaved patterns to match full-indexer accuracy. Experimental results on a 30B DSA model show that IndexCache can remove 75% of indexer computations with negligible quality degradation, achieving up to 1.82$\times$ prefill speedup and 1.48$\times$ decode speedup compared to standard DSA. These positive results are further confirmed by our preliminary experiments on the production-scale GLM-5 model.

效率与系统检索与知识智能体与工具long contextllmsparse attentionefficiencyOpenReview

常见合作者