From the 2 of 4 linked papers with an AI index.
4 papers
Recall Before You Rank: Similarity-Guided Top- Reuse for Efficient Long-Context Attention
Wenshuai Yao, Wenyong Zhou, Hanyong Shao +5
The paper proposes ReTopK, a training‑free technique that speeds up dynamic top‑K sparse attention for long‑context language models by reusing supports from historically similar qu…
CoSA: Accelerating Long-Context Inference via Proxy-Kernel Co-Designed Sparse Attention
Yufei Xue, Lin Niu, Hong Liu +6
CoSA introduces a training-free, two-stage sparse attention method that jointly designs a proxy and kernel to efficiently handle very long contexts, achieving faster inference with…
SlideSparse: Fast and Flexible (2N-2):2N Structured Sparsity
Hanyong Shao, Yingbo Hao, Ting Song +10
NVIDIA's 2:4 Sparse Tensor Cores deliver 2x throughput but demand strict 50% pruning -- a ratio that collapses LLM reasoning accuracy (Qwen3: 54% to 15%). Milder patter…
Sparse-BitNet: 1.58-bit LLMs are Naturally Friendly to Semi-Structured Sparsity
Di Zhang, Xun Wu, Shaohan Huang +9
Semi-structured N:M sparsity and low-bit quantization (e.g., 1.58-bit BitNet) are two promising approaches for improving the efficiency of large language models (LLMs), yet they ha…