paper-with-me

Papers

HISA: Efficient Hierarchical Indexing for Fine-Grained Sparse Attention

2026-03-30 · Yufei Xu, Fanxu Meng, Fan Jiang, Yuxuan Wang, Ruijie Zhou, Zhaohui Wang, Jiexi Wu, Zhixin Pan, Xiaojuan Tang, Wenjie Pei, Tongxuan Liu, Di Yin, Xing Sun, Muhan Zhang arxiv

Token-level sparse attention mechanisms, exemplified by DeepSeek Sparse Attention (DSA), achieve fine-grained key selection by scoring every historical key for each query through a lightweight indexer, then computing attention only on the selected subset. While the downstream sparse attention itself scales favorably, the indexer must still scan the entire prefix for every query, introducing an per-layer bottleneck that grows prohibitively with context length. We propose HISA (Hierarchical Indexed Sparse Attention), a plug-and-play replacement for the indexer that rewrites the search path from a flat token scan into a two-stage hierarchical procedure: (1) a block-level coarse filtering stage that scores pooled block representations to discard irrelevant regions, followed by (2) a token-level refinement stage that applies the original indexer exclusively within the retained candidate blocks. HISA preserves the identical token-level top-sparse pattern consumed by the downstream Sparse MLA operator and requires no additional training. On kernel-level benchmarks, HISA achieves up to speedup at 64K context. On Needle-in-a-Haystack and LongBench, we directly replace the indexer in DeepSeek-V3.2 and GLM-5 with our HISA indexer, without any finetuning. HISA closely matches the original DSA in quality, while substantially outperforming block-sparse baselines.

📄 PDF Abstract BibTeX arXiv:2603.28458

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

HiSAC: Hierarchical Sparse Activation Compression for Ultra-long Sequence Modeling in Recommenders

2026-02-24 · Kun Yuan, Junyu Bi, Daixuan Cheng, Changfa Wu 외 arxiv

Modern recommender systems leverage ultra-long user behavior sequences to capture dynamic preferences, but end-to-end modeling is infeasible in production due to latency and memory constraints. While summarizing history …

AsyncTLS: Efficient Generative LLM Inference with Asynchronous Two-level Sparse Attention

2026-04-09 · Yuxuan Hu, Jianchao Tan, Jiaqi Zhang, Wen Zan 외 arxiv

Long-context inference in LLMs faces the dual challenges of quadratic attention complexity and prohibitive KV cache memory. While token-level sparse attention offers superior accuracy, its indexing overhead is costly; bl…

LongCat Sparse Attention: Taming the Lightning via Streaming-aware Hierarchical Cross-Layer Indexing

2026-08-03 · Wen Zan, Jiaqi Zhang, Jianchao Tan, Hong Liu 외 arxiv

DeepSeek Sparse Attention (DSA) enables efficient long-context modeling through its Lightning Indexer. However, practical deployment remains constrained by the indexer's expensive $O(L^2)$ scoring overhead and the hardwa…

CHiSafetyBench: A Chinese Hierarchical Safety Benchmark for Large Language Models

2024-06-14 · Wenjing Zhang, Xuejiao Lei, Zhaoxiang Liu, Meijuan An 외

With the profound development of large language models(LLMs), their safety concerns have garnered increasing attention. However, there is a scarcity of Chinese safety benchmarks for LLMs, and the existing safety taxonomi…

Multiple-choiceQuestion Answering

PaperRegister: Boosting Flexible-grained Paper Search via Hierarchical Register Indexing

2025-08-14 · Zhuoqun Li, Xuanang Chen, Hongyu Lin, Yaojie Lu 외 arxiv

As researchers delve more deeply into their work, paper search requirements may become more flexible, sometimes involving specific details such as module configuration rather than being limited to coarse-grained topics. …