@inproceedings{he-etal-2026-accelerating,
    title = "Accelerating Prefilling via Decoding-time Contribution Sparsity",
    author = "He, Zhiyuan  and
      Zhang, Yike  and
      Zhang, Chengruidong  and
      Jiang, Huiqiang  and
      Yang, Yuqing  and
      Qiu, Lili",
    editor = "Liakata, Maria  and
      Moreira, Viviane P.  and
      Zhang, Jiajun  and
      Jurgens, David",
    booktitle = "Findings of the {A}ssociation for {C}omputational {L}inguistics: {ACL} 2026",
    month = jul,
    year = "2026",
    address = "San Diego, California, United States",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/ingest-acl/2026.findings-acl.801/",
    pages = "16296--16308",
    ISBN = "979-8-89176-395-1",
    abstract = "Large Language Models (LLMs) incur quadratic attention complexity with input length, creating a major time bottleneck in the prefilling stage. Existing acceleration methods largely exploit attention score sparsity by estimating blocks with high attention scores and applying dynamic sparse attention. In this work, we identify another untapped form of sparsity in the prefilling stage, namely decoding-time contribution sparsity, where many attention blocks exhibit nontrivial attention scores during prefilling yet contribute negligibly to subsequent decoding. Building on this observation, we propose TriangleMix, which replaces dense attention with Triangle attention in a subset of layers. Extensive experiments demonstrate that TriangleMix achieves near-lossless performance on both long-context and long-context reasoning benchmarks, while significantly improving efficiency. For 128K inputs, Triangle attention in the subset of layers achieves a $ 15.3 \times $ speedup in attention kernel computation, significantly exceeding the acceleration of typical dynamic sparse methods ($ 1.9 \times $ to $ 3.4 \times $). Furthermore, TriangleMix can be seamlessly combined with dynamic sparsity approaches, delivering an additional 6{\%}{--}19{\%} reduction in TTFT over using dynamic sparsity alone."
}