{"total":167,"rows":[{"id":"2502.11089","title":"Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention","created":"2025-02-16","cited_by_count":407,"area":null},{"id":"2407.02490","title":"MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attention","created":"2024-07-02","cited_by_count":383,"area":null},{"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":"2410.15332","title":"EPIC: Efficient Position-Independent Caching for Serving Large Language Models","created":"2024-10-20","cited_by_count":47,"area":null},{"id":"2408.07092","title":"Post-Training Sparse Attention with Double Sparsity","created":"2024-08-11","cited_by_count":45,"area":null},{"id":"2406.14909","title":"Mixture of Attention Spans: Optimizing LLM Inference Efficiency with Heterogeneous Sliding-Window Lengths","created":"2024-06-21","cited_by_count":44,"area":null},{"id":"2509.02785","title":"DrDiff: Dynamic Routing Diffusion with Hierarchical Attention for Breaking the Efficiency-Quality Trade-off","created":"2025-09-02","cited_by_count":34,"area":null},{"id":"2509.24663","title":"InfLLM-V2: Dense-Sparse Switchable Attention for Seamless Short-to-Long Adaptation","created":"2025-09-29","cited_by_count":32,"area":null},{"id":"2501.06425","title":"Tensor Product Attention Is All You Need","created":"2025-01-11","cited_by_count":31,"area":null},{"id":"2410.05076","title":"TidalDecode: Fast and Accurate LLM Decoding with Position Persistent Sparse Attention","created":"2024-10-07","cited_by_count":29,"area":null},{"id":"2504.02441","title":"Cognitive Memory in Large Language Models","created":"2025-04-03","cited_by_count":29,"area":null},{"id":"2504.17768","title":"The Sparse Frontier: Sparse Attention Trade-offs in Transformer LLMs","created":"2025-04-24","cited_by_count":29,"area":null},{"id":"2412.14468","title":"HashAttention: Semantic Sparsity for Faster Inference","created":"2024-12-19","cited_by_count":24,"area":null},{"id":"2510.24824","title":"Parallel Loop Transformer for Efficient Test-Time Computation Scaling","created":"2025-10-28","cited_by_count":24,"area":null},{"id":"2507.19595","title":"Efficient Attention Mechanisms for Large Language Models: A Survey","created":"2025-07-25","cited_by_count":22,"area":null},{"id":"2408.12151","title":"A Tighter Complexity Analysis of SparseGPT","created":"2024-08-22","cited_by_count":19,"area":null},{"id":"2410.10165","title":"HSR-Enhanced Sparse Attention Acceleration","created":"2024-10-14","cited_by_count":19,"area":null},{"id":"2411.16102","title":"BlendServe: Optimizing Offline Inference for Auto-regressive Large Models with Resource-aware Batching","created":"2024-11-25","cited_by_count":19,"area":null},{"id":"2512.01540","title":"FlashVGGT: Efficient and Scalable Visual Geometry Transformers with Compressed Descriptor Attention","created":"2025-12-01","cited_by_count":17,"area":null},{"id":"2512.12087","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","created":"2025-12-12","cited_by_count":13,"area":null},{"id":"2501.02336","title":"AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inference","created":"2025-01-04","cited_by_count":12,"area":null},{"id":"2603.28458","title":"HISA: Efficient Hierarchical Indexing for Fine-Grained Sparse Attention","created":"2026-03-30","cited_by_count":12,"area":null},{"id":"2502.08246","title":"Inference-time sparse attention with asymmetric indexing","created":"2025-02-12","cited_by_count":11,"area":null},{"id":"2510.07318","title":"Artificial Hippocampus Networks for Efficient Long-Context Modeling","created":"2025-10-08","cited_by_count":11,"area":null},{"id":"2506.17121","title":"Cache Me If You Can: How Many KVs Do You Need for Effective Long-Context LMs?","created":"2025-06-20","cited_by_count":10,"area":null},{"id":"2603.08055","title":"Speed3R: Sparse Feed-forward 3D Reconstruction Models","created":"2026-03-09","cited_by_count":10,"area":null},{"id":"2503.03588","title":"PowerAttention: Exponentially Scaling of Receptive Fields for Effective Sparse Attention","created":"2025-03-05","cited_by_count":9,"area":null},{"id":"2511.11571","title":"Optimizing Mixture of Block Attention","created":"2025-11-14","cited_by_count":9,"area":null},{"id":"2409.12490","title":"CritiPrefill: A Segment-wise Criticality-based Approach for Prefilling Acceleration in LLMs","created":"2024-09-19","cited_by_count":7,"area":null},{"id":"2508.02215","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","created":"2025-08-04","cited_by_count":7,"area":null},{"id":"2508.18224","title":"FSA: An Alternative Efficient Implementation of Native Sparse Attention Kernel","created":"2025-08-25","cited_by_count":7,"area":null},{"id":"2510.24606","title":"Long-Context Modeling with Dynamic Hierarchical Sparse Attention for Memory-Constrained LLM Inference","created":"2025-10-28","cited_by_count":7,"area":null},{"id":"2602.02159","title":"Focus-dLLM: Accelerating Long-Context Diffusion LLM Inference via Confidence-Guided Context Focusing","created":"2026-02-02","cited_by_count":7,"area":null},{"id":"2605.07363","title":"MISA: Mixture of Indexer Sparse Attention for Long-Context LLM Inference","created":"2026-05-08","cited_by_count":7,"area":null},{"id":"2506.00400","title":"Scaling Textual Gradients via Sampling-Based Momentum","created":"2025-05-31","cited_by_count":6,"area":null},{"id":"2508.02124","title":"Trainable Dynamic Mask Sparse Attention","created":"2025-08-04","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":"2510.20941","title":"Do LLMs Truly Understand When a Precedent Is Overruled?","created":"2025-10-23","cited_by_count":6,"area":null},{"id":"2511.20102","title":"SSA: Sparse Sparse Attention by Aligning Full and Sparse Attention Outputs in Feature Space","created":"2025-11-25","cited_by_count":6,"area":null},{"id":"2512.23966","title":"Efficient Context Scaling with LongCat ZigZag Attention","created":"2025-12-30","cited_by_count":6,"area":null},{"id":"2602.01519","title":"You Need an Encoder for Native Position-Independent Caching","created":"2026-02-02","cited_by_count":6,"area":null},{"id":"2606.17107","title":"Models Take Notes at Prefill: KV Cache Can Be Editable and Composable","created":"2026-06-14","cited_by_count":6,"area":null},{"id":"2502.09647","title":"Unveiling Simplicities of Attention: Adaptive Long-Context Head Identification","created":"2025-02-11","cited_by_count":5,"area":null},{"id":"2504.06949","title":"Adaptive Computation Pruning for the Forgetting Transformer","created":"2025-04-09","cited_by_count":5,"area":null},{"id":"2507.21526","title":"Accelerating Prefilling via Decoding-time Contribution Sparsity","created":"2025-07-29","cited_by_count":5,"area":null},{"id":"2511.09146","title":"DoPE: Denoising Rotary Position Embedding","created":"2025-11-12","cited_by_count":5,"area":null},{"id":"2606.04511","title":"SparDA: Sparse Decoupled Attention for Efficient Long-Context LLM Inference","created":"2026-06-03","cited_by_count":5,"area":null},{"id":"2606.07684","title":"Semantic Cache Distillation: Efficient State Transfer via Reuse and Selective Patching","created":"2026-06-05","cited_by_count":5,"area":null},{"id":"2507.03153","title":"HGCA: Hybrid GPU-CPU Attention for Long Context LLM Inference","created":"2025-07-03","cited_by_count":4,"area":null},{"id":"2507.07694","title":"SAS: Simulated Attention Score","created":"2025-07-10","cited_by_count":4,"area":null},{"id":"2508.16703","title":"ShadowNPU: System and Algorithm Co-design for NPU-Centric On-Device LLM Inference","created":"2025-08-22","cited_by_count":4,"area":null},{"id":"2510.18413","title":"Adamas: Hadamard Sparse Attention for Efficient Long-Context Inference","created":"2025-10-21","cited_by_count":4,"area":null},{"id":"2510.23649","title":"Efficient Low Rank Attention for Long-Context Inference in Large Language Models","created":"2025-10-25","cited_by_count":4,"area":null},{"id":"2512.07647","title":"A Mathematical Theory of Top-$k$ Sparse Attention via Total Variation Distance","created":"2025-12-08","cited_by_count":4,"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":"2602.02180","title":"STILL: Selecting Tokens for Intra-Layer Hybrid Attention to Linearize LLMs","created":"2026-02-02","cited_by_count":4,"area":null},{"id":"2603.25319","title":"MACRO: Advancing Multi-Reference Image Generation with Structured Long-Context Data","created":"2026-03-26","cited_by_count":4,"area":null},{"id":"2605.05602","title":"Nearly Optimal Attention Coresets","created":"2026-05-07","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":"2605.23081","title":"ThriftAttention: Selective Mixed Precision for Long-Context FP4 Attention","created":"2026-05-21","cited_by_count":4,"area":null},{"id":"2609.00097","title":"Faster Than Flash: Exploiting Attention Sparsity for Efficient Long-Context Decoding","created":"2026-08-31","cited_by_count":4,"area":null},{"id":"2506.09316","title":"On-the-Fly Adaptive Distillation of Transformer to Dual-State Linear Attention","created":"2025-06-11","cited_by_count":3,"area":null},{"id":"2511.05313","title":"Controllably Efficient Language Models","created":"2025-11-07","cited_by_count":3,"area":null},{"id":"2512.03494","title":"A Preliminary Study on the Promises and Challenges of Native Top-$k$ Sparse Attention","created":"2025-12-03","cited_by_count":3,"area":null},{"id":"2601.23278","title":"FOCUS: DLLMs Know How to Tame Their Compute Bound","created":"2026-01-30","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.08722","title":"QUOKA: Query-Oriented KV Selection For Efficient LLM Prefill","created":"2026-02-09","cited_by_count":3,"area":null},{"id":"2604.06746","title":"StructKV: Preserving the Structural Skeleton for Scalable Long-Context Inference","created":"2026-04-08","cited_by_count":3,"area":null},{"id":"2605.09644","title":"Attention Itself Could Retrieve.RetrieveVGGT: Training-Free Long Context Streaming 3D Reconstruction via Query-Key Similarity Retrieval","created":"2026-05-10","cited_by_count":3,"area":null},{"id":"2607.24593","title":"PIVOT: Efficient Query-Group Indexing for Token-Level Sparse Attention","created":"2026-07-27","cited_by_count":3,"area":null},{"id":"2502.08363","title":"Top-Theta Attention: Sparsifying Transformers by Compensated Thresholding","created":"2025-02-12","cited_by_count":2,"area":null},{"id":"2512.07011","title":"Block Sparse Flash Attention","created":"2025-12-07","cited_by_count":2,"area":null},{"id":"2602.08686","title":"CompilerKV: Risk-Adaptive KV Compression via Offline Experience Compilation","created":"2026-02-09","cited_by_count":2,"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":"2602.14209","title":"MAGE: All-[MASK] Block Already Knows Where to Look in Block Diffusion LLM","created":"2026-02-15","cited_by_count":2,"area":null},{"id":"2603.15653","title":"Recursive Language Models Meet Uncertainty: The Surprising Effectiveness of Self-Reflective Program Search for Long Context","created":"2026-03-07","cited_by_count":2,"area":null},{"id":"2603.22300","title":"Scaling Attention via Feature Sparsity","created":"2026-03-17","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.22575","title":"SpikingBrain2.0: Brain-Inspired Foundation Models for Efficient Long-Context and Cross-Platform Inference","created":"2026-04-24","cited_by_count":2,"area":null},{"id":"2605.27740","title":"UNIQUE: Universal Top-k Sparse Attention for Training-free Inference and Sparsity-aware Training","created":"2026-05-26","cited_by_count":2,"area":null},{"id":"2606.03979","title":"Language Models Need Sleep: Learning to Self-Modify and Consolidate Memories","created":"2026-06-02","cited_by_count":2,"area":null},{"id":"2606.30389","title":"Predict, Reuse, and Repair: Accelerating Dynamic Sparse Attention for Long-Context LLM Decoding","created":"2026-06-29","cited_by_count":2,"area":null},{"id":"2607.01538","title":"Can Language Models Actually Retrieve In-Context? Drowning in Documents at Million Token Scale","created":"2026-07-01","cited_by_count":2,"area":null},{"id":"2607.09052","title":"COBS: Cumulant Order Block Sparse Attention","created":"2026-07-10","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":"2607.21475","title":"Error Certificates for KV-Cache Eviction via Randomized Design","created":"2026-07-23","cited_by_count":2,"area":null},{"id":"2608.00391","title":"The Gate, Not the Cache: Gate Provenance Bounds the Closed-Loop Reliability of Training-Free VLA Token Skipping","created":"2026-08-01","cited_by_count":2,"area":null},{"id":"2608.05326","title":"QEvict: Recoverable Quantized KV Eviction for Attention-Drift-Robust Long-Context Decoding","created":"2026-08-05","cited_by_count":2,"area":null},{"id":"2608.12435","title":"MARCH: Scaling Recurrent Memory with Content-Routed State Anchors","created":"2026-08-12","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":"2505.03745","title":"AccLLM: Accelerating Long-Context LLM Inference Via Algorithm-Hardware Co-Design","created":"2025-04-07","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":"2507.01900","title":"High-Layer Attention Pruning with Rescaling","created":"2025-07-02","cited_by_count":1,"area":null},{"id":"2510.18830","title":"MTraining: Distributed Dynamic Sparse Attention for Efficient Ultra-Long Context Training","created":"2025-10-21","cited_by_count":1,"area":null},{"id":"2511.00819","title":"Optimizing Native Sparse Attention with Latent Attention and Local Global Alternating Strategies","created":"2025-11-02","cited_by_count":1,"area":null},{"id":"2601.17702","title":"S$^3$-Attention:Attention-Aligned Endogenous Retrieval for Memory-Bounded Long-Context Inference","created":"2026-01-25","cited_by_count":1,"area":null}],"next_cursor":"100"}