{"total":35,"rows":[{"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":"2412.14468","title":"HashAttention: Semantic Sparsity for Faster Inference","created":"2024-12-19","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":"2502.15957","title":"R$^3$Mem: Bridging Memory Retention and Retrieval via Reversible Compression","created":"2025-02-21","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":"2508.02215","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","created":"2025-08-04","cited_by_count":7,"area":null},{"id":"2505.17810","title":"VIBE: Vector Index Benchmark for Embeddings","created":"2025-05-23","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":"2505.23520","title":"AnchorAttention: Difference-Aware Sparse Attention with Stripe Granularity","created":"2025-05-29","cited_by_count":4,"area":null},{"id":"2510.03851","title":"MetaMuse: Algorithm Generation via Creative Ideation","created":"2025-10-04","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":"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.06283","title":"SOCKET: SOft Collision Kernel EsTimator for Sparse Attention","created":"2026-02-06","cited_by_count":3,"area":null},{"id":"2502.13542","title":"Activation-aware Probe-Query: Effective Key-Value Retrieval for Long-Context LLMs Inference","created":"2025-02-19","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":"2608.01662","title":"LongCat Sparse Attention: Taming the Lightning via Streaming-aware Hierarchical Cross-Layer Indexing","created":"2026-08-03","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":"2502.16931","title":"Machine learning and high dimensional vector search","created":"2025-02-24","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":"2506.17864","title":"QueueEDIT: Structural Self-Correction for Sequential Model Editing in LLMs","created":"2025-06-22","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},{"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":"2604.01178","title":"Screening Is Enough","created":"2026-04-01","cited_by_count":1,"area":null},{"id":"2604.05438","title":"Residual-Mass Accounting for Partial-KV Decoding","created":"2026-04-07","cited_by_count":1,"area":null},{"id":"2606.22906","title":"DeepDiscovery: A Location-Inference Framework for Task-Level Repository Understanding","created":"2026-06-22","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":"2507.12769","title":"Synergy: End-to-end Concept Model","created":"2025-07-17","cited_by_count":0,"area":null},{"id":"2510.02361","title":"ChunkLLM: A Lightweight Pluggable Framework for Accelerating LLMs Inference","created":"2025-09-28","cited_by_count":0,"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":"2605.24168","title":"Inference Time Context Sparsity: Illusion or Opportunity?","created":"2026-05-22","cited_by_count":0,"area":null},{"id":"2609.25802","title":"Latest Exact Match Attention","created":"2026-09-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":"2609.37261","title":"Efficiently Approximating Attention Is Hard","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}