{"total":44,"rows":[{"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":"2407.18921","title":"Mobile Edge Intelligence for Large Language Models: A Contemporary Survey","created":"2024-07-09","cited_by_count":128,"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":"2502.18137","title":"SpargeAttention: Accurate and Training-free Sparse Attention Accelerating Any Model Inference","created":"2025-02-25","cited_by_count":120,"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":"2502.02770","title":"Twilight: Adaptive Attention Sparsity with Hierarchical Top-$p$ Pruning","created":"2025-02-04","cited_by_count":49,"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.15486","title":"SampleAttention: Near-Lossless Acceleration of Long Context LLM Inference with Adaptive Structured Sparse Attention","created":"2024-06-17","cited_by_count":39,"area":null},{"id":"2501.06425","title":"Tensor Product Attention Is All You Need","created":"2025-01-11","cited_by_count":31,"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":"2407.15176","title":"ReAttention: Training-Free Infinite Context with Finite Attention Scope","created":"2024-07-21","cited_by_count":13,"area":null},{"id":"2406.05678","title":"SinkLoRA: Enhanced Efficiency and Chat Capabilities for Long-Context Large Language Models","created":"2024-06-09","cited_by_count":9,"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":"2508.02215","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","created":"2025-08-04","cited_by_count":7,"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":"2506.06644","title":"Spark Transformer: Reactivating Sparsity in FFN and Attention","created":"2025-06-07","cited_by_count":5,"area":null},{"id":"2508.12969","title":"Compact Attention: Exploiting Structured Spatio-Temporal Sparsity for Fast Video Generation","created":"2025-08-18","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":"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":"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":"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":"2602.08722","title":"QUOKA: Query-Oriented KV Selection For Efficient LLM Prefill","created":"2026-02-09","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":"2602.08686","title":"CompilerKV: Risk-Adaptive KV Compression via Offline Experience Compilation","created":"2026-02-09","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.22300","title":"Scaling Attention via Feature Sparsity","created":"2026-03-17","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":"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":"2405.19284","title":"Optimizing Foundation Model Inference on a Many-tiny-core Open-source RISC-V Platform","created":"2024-05-29","cited_by_count":1,"area":null},{"id":"2412.06198","title":"SparseAccelerate: Efficient Long-Context Inference for Mid-Range GPUs","created":"2024-12-09","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":"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":"2604.03260","title":"Why Attend to Everything? Focus is the Key","created":"2026-03-12","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":"2608.29058","title":"RouteSparse: Input-Conditional Pattern Routing for Budgeted Long-Context Prefilling","created":"2026-08-29","cited_by_count":1,"area":null},{"id":"2602.00777","title":"HyLRA: Hybrid Layer Reuse Attention for Efficient Long-Context Inference","created":"2026-01-31","cited_by_count":0,"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.06554","title":"Long Context Pre-Training with Lighthouse Attention","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2607.17656","title":"BMFA: Boundary-Minority Free-Energy Adaptive Screening","created":"2026-07-20","cited_by_count":0,"area":null},{"id":"2609.01925","title":"CRISP: Cliff-awaRe Input-adaptive Sparse Prefilling with Structural-Mass-Motivated Routing","created":"2026-09-01","cited_by_count":0,"area":null},{"id":"2609.31093","title":"Block Sparse Attention with Log-Linear Complexity","created":"2026-09-25","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":"2609.34063","title":"Counterexamples to Local Reconstruction Gain as a Proxy for Final Fidelity in Residual Completion","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2609.35629","title":"SANTA++: Sampling Attention through Representative Keys","created":"2026-09-28","cited_by_count":0,"area":null}],"next_cursor":null}