{"total":34,"rows":[{"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":"2501.06425","title":"Tensor Product Attention Is All You Need","created":"2025-01-11","cited_by_count":31,"area":null},{"id":"2412.14468","title":"HashAttention: Semantic Sparsity for Faster Inference","created":"2024-12-19","cited_by_count":24,"area":null},{"id":"2504.05646","title":"Lattice: Learning to Efficiently Compress the Memory","created":"2025-04-08","cited_by_count":19,"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":"2505.23666","title":"LoLA: Low-Rank Linear Attention With Sparse Caching","created":"2025-05-29","cited_by_count":12,"area":null},{"id":"2410.13184","title":"Router-Tuning: A Simple and Effective Approach for Enabling Dynamic-Depth in Transformers","created":"2024-10-17","cited_by_count":10,"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":"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":"2512.23852","title":"Trellis: Learning to Compress Key-Value Memory in Attention Models","created":"2025-12-29","cited_by_count":5,"area":null},{"id":"2507.07694","title":"SAS: Simulated Attention Score","created":"2025-07-10","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.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":"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.09052","title":"COBS: Cumulant Order Block Sparse Attention","created":"2026-07-10","cited_by_count":2,"area":null},{"id":"2506.05300","title":"Power Law Guided Dynamic Sifting for Efficient Attention","created":"2025-06-05","cited_by_count":1,"area":null},{"id":"2510.21956","title":"Transformer Based Linear Attention with Optimized GPU Kernel Implementation","created":"2025-10-24","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":"2604.09406","title":"OASIS: Online Activation Subspace Learning for Memory-Efficient Training","created":"2026-04-10","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":"2503.01564","title":"Attention Condensation via Sparsity Induced Regularized Training","created":"2025-03-03","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":"2608.00528","title":"S$^4$R: Selective Sampling, Subspaces, and Sparse Reconstruction for Compressed Long-Context KV Caching","created":"2026-08-01","cited_by_count":0,"area":null},{"id":"2609.06341","title":"Linear Algebra Foundations of Efficient Attention: A Phase Reversal in Rank Collapse Under SVD Compression","created":"2026-09-06","cited_by_count":0,"area":null},{"id":"2609.24417","title":"ARM: Attention with Routed-Memory for Learnable Sparse Control","created":"2026-09-21","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.01230","title":"HHR: Hierarchical Hash Retrieval for Efficient LLM Generation","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.04635","title":"LatentIndex: Cross-Layer Sharing with Layer-Specific Selection for Sparse Attention","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}