{"total":27,"rows":[{"id":"2502.20766","title":"FlexPrefill: A Context-Aware Sparse Attention Mechanism for Efficient Long-Sequence Inference","created":"2025-02-28","cited_by_count":123,"area":null},{"id":"2409.10516","title":"RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrieval","created":"2024-09-16","cited_by_count":116,"area":null},{"id":"2410.16179","title":"MagicPIG: LSH Sampling for Efficient LLM Generation","created":"2024-10-21","cited_by_count":111,"area":null},{"id":"2411.09688","title":"Squeezed Attention: Accelerating Long Context Length LLM Inference","created":"2024-11-14","cited_by_count":57,"area":null},{"id":"2502.02770","title":"Twilight: Adaptive Attention Sparsity with Hierarchical Top-$p$ Pruning","created":"2025-02-04","cited_by_count":49,"area":null},{"id":"2409.11057","title":"KVPruner: Structural Pruning for Faster and Memory-Efficient Large Language Models","created":"2024-09-17","cited_by_count":6,"area":null},{"id":"2510.05688","title":"vAttention: Verified Sparse Attention","created":"2025-10-07","cited_by_count":6,"area":null},{"id":"2502.06766","title":"Exploiting Sparsity for Long Context Inference: Million Token Contexts on Commodity GPUs","created":"2025-02-10","cited_by_count":5,"area":null},{"id":"2512.17452","title":"KV Admission: Learning What to Write for Efficient Long-Context LLM Inference","created":"2025-12-19","cited_by_count":4,"area":null},{"id":"2605.18753","title":"DashAttention: Differentiable and Adaptive Sparse Hierarchical Attention","created":"2026-05-18","cited_by_count":4,"area":null},{"id":"2505.24179","title":"SALE : Low-bit Estimation for Efficient Sparse Attention in Long-context LLM Prefilling","created":"2025-05-30","cited_by_count":3,"area":null},{"id":"2601.03043","title":"Lil: Less is Less When Applying Post-Training Sparse-Attention Algorithms in Long-Decode Stage","created":"2026-01-06","cited_by_count":3,"area":null},{"id":"2602.06283","title":"SOCKET: SOft Collision Kernel EsTimator for Sparse Attention","created":"2026-02-06","cited_by_count":3,"area":null},{"id":"2602.11958","title":"RAM-Net: Linear-Time Sequence Modeling with Sparsely Addressable State","created":"2026-02-12","cited_by_count":2,"area":null},{"id":"2603.29494","title":"VecAttention: Vector-wise Sparse Attention for Accelerating Long Context Inference","created":"2026-03-31","cited_by_count":2,"area":null},{"id":"2604.18137","title":"AQPIM: Breaking the PIM Capacity Wall for LLMs with In-Memory Activation Quantization","created":"2026-04-20","cited_by_count":2,"area":null},{"id":"2607.11976","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","created":"2026-07-13","cited_by_count":2,"area":null},{"id":"2609.13141","title":"SAS: Simple Attention Sparsification via End-to-End Optimization of Context Ranking","created":"2026-09-11","cited_by_count":2,"area":null},{"id":"2409.17527","title":"Data Proportion Detection for Optimized Data Management for Large Language Models","created":"2024-09-26","cited_by_count":1,"area":null},{"id":"2506.15704","title":"Learn from the Past: Fast Sparse Indexing for Large Language Model Decoding","created":"2025-05-30","cited_by_count":1,"area":null},{"id":"2602.03922","title":"Online Vector Quantized Attention","created":"2026-02-03","cited_by_count":1,"area":null},{"id":"2603.18446","title":"UT-ACA: Uncertainty-Triggered Adaptive Context Allocation for Long-Context Inference","created":"2026-03-19","cited_by_count":1,"area":null},{"id":"2607.24555","title":"LOCKS: Page-Local Compact Key Summaries for Efficient Long-Context Decoding","created":"2026-07-27","cited_by_count":1,"area":null},{"id":"2604.24820","title":"Salca: A Sparsity-Aware Hardware Accelerator for Efficient Long-Context Attention Decoding","created":"2026-04-27","cited_by_count":0,"area":null},{"id":"2605.24168","title":"Inference Time Context Sparsity: Illusion or Opportunity?","created":"2026-05-22","cited_by_count":0,"area":null},{"id":"2609.33746","title":"PQ-HSA: Reusing Product-Quantized Scores for Hybrid Sparse-Approximate Attention","created":"2026-09-27","cited_by_count":0,"area":null},{"id":"2610.11458","title":"Generative Adversarial Loops","created":"2026-10-08","cited_by_count":0,"area":null}],"next_cursor":null}