{"total":85,"rows":[{"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":"2504.19874","title":"TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate","created":"2025-04-28","cited_by_count":125,"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":"2504.06263","title":"OmniSVG: A Unified Scalable Vector Graphics Generation Model","created":"2025-04-08","cited_by_count":74,"area":null},{"id":"2410.18745","title":"Why Does the Effective Context Length of LLMs Fall Short?","created":"2024-10-24","cited_by_count":63,"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":"2501.18795","title":"Rope to Nope and Back Again: A New Hybrid Attention Strategy","created":"2025-01-30","cited_by_count":47,"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":"2412.12094","title":"SepLLM: Accelerate Large Language Models by Compressing One Segment into One Separator","created":"2024-12-16","cited_by_count":41,"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.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":"2407.15176","title":"ReAttention: Training-Free Infinite Context with Finite Attention Scope","created":"2024-07-21","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":"2502.07861","title":"Streaming Attention Approximation via Discrepancy Theory","created":"2025-02-11","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":"2604.10098","title":"Attention Sink in Transformers: A Survey on Utilization, Interpretation, and Mitigation","created":"2026-04-11","cited_by_count":11,"area":null},{"id":"2601.05505","title":"FlashMem: Distilling Intrinsic Latent Memory via Computation Reuse","created":"2026-01-09","cited_by_count":8,"area":null},{"id":"2509.15038","title":"Value-Guided KV Compression for LLMs via Approximated CUR Decomposition","created":"2025-09-18","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":"2601.19697","title":"AlignCoder: Aligning Retrieval with Target Intent for Repository-Level Code Completion","created":"2026-01-27","cited_by_count":7,"area":null},{"id":"2602.10056","title":"WildCat: Near-Linear Attention in Theory and Practice","created":"2026-02-10","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":"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.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.07694","title":"SAS: Simulated Attention Score","created":"2025-07-10","cited_by_count":4,"area":null},{"id":"2512.22213","title":"On the Existence and Behavior of Secondary Attention Sinks","created":"2025-12-22","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":"2604.22782","title":"Stochastic KV Routing: Enabling Adaptive Depth-Wise Cache Sharing","created":"2026-04-03","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":"2606.07577","title":"OmniMem: Perturbation-aware Memory Compression for Streaming Audio-Visual LLMs","created":"2026-05-26","cited_by_count":4,"area":null},{"id":"2501.18596","title":"DeltaLLM: Compress LLMs with Low-Rank Deltas between Shared Weights","created":"2025-01-30","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.03681","title":"Neural Attention Search Linear: Towards Adaptive Token-Level Hybrid Attention Models","created":"2026-02-03","cited_by_count":3,"area":null},{"id":"2604.17935","title":"How Much Cache Does Reasoning Need? Depth-Cache Tradeoffs in KV-Compressed Transformers","created":"2026-04-20","cited_by_count":3,"area":null},{"id":"2607.23765","title":"WISERouter: LLM Routing with Workload Budget Constraint","created":"2026-07-26","cited_by_count":3,"area":null},{"id":"2502.06139","title":"LCIRC: A Recurrent Compression Approach for Efficient Long-form Context and Query Dependent Modeling in LLMs","created":"2025-02-10","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.29494","title":"VecAttention: Vector-wise Sparse Attention for Accelerating Long Context Inference","created":"2026-03-31","cited_by_count":2,"area":null},{"id":"2605.19999","title":"LLM Benchmark Datasets Should Be Contamination-Resistant","created":"2026-05-19","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":"2504.08202","title":"Harnessing the Unseen: The Hidden Influence of Intrinsic Knowledge in Long-Context Language Models","created":"2025-04-11","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":"2603.16435","title":"VQKV: High-Fidelity and High-Ratio Cache Compression via Vector-Quantization","created":"2026-03-17","cited_by_count":1,"area":null},{"id":"2603.22325","title":"Hybrid Associative Memories","created":"2026-03-20","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":"2605.06105","title":"Shallow Prefill, Deep Decoding: Efficient Long-Context Inference via Layer-Asymmetric KV Visibility","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2605.08453","title":"Sink vs. diagonal patterns as mechanisms for attention switch and oversmoothing prevention","created":"2026-05-08","cited_by_count":1,"area":null},{"id":"2605.16360","title":"ProxyKV: Cross-Model Proxy Pruning for Efficient Long-Context LLM Inference","created":"2026-05-09","cited_by_count":1,"area":null},{"id":"2606.07116","title":"OffQ: Taming Structured Outliers in LLM Quantization by Offsetting","created":"2026-06-05","cited_by_count":1,"area":null},{"id":"2607.28263","title":"CoMem: Reusing Transformer Depth across Queries with Persistent Intermediate Residuals","created":"2026-07-30","cited_by_count":1,"area":null},{"id":"2608.00311","title":"SeDeM: Selective Decompression of Hidden-State Memories for Long-Context Question Answering","created":"2026-07-31","cited_by_count":1,"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.08329","title":"Near-Oracle KV Selection via Pre-hoc Sparsity for Long-Context Inference","created":"2026-02-09","cited_by_count":0,"area":null},{"id":"2603.00907","title":"KVSlimmer: Theoretical Insights and Practical Optimizations for Asymmetric KV Merging","created":"2026-03-01","cited_by_count":0,"area":null},{"id":"2604.09595","title":"Why Smaller Is Slower? Dimensional Misalignment in Compressed LLMs","created":"2026-03-05","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.17410","title":"Computational Challenges in Token Economics: Bridging Economic Theory and AI System Design","created":"2026-05-17","cited_by_count":0,"area":null},{"id":"2605.18865","title":"From Sparsity to Simplicity: Enabling Simpler Sequential Replacements via Sparse Attention Distillation","created":"2026-05-15","cited_by_count":0,"area":null},{"id":"2605.20600","title":"Head-Aware Key-Value Compression for Efficient Autoregressive Image Generation","created":"2026-05-20","cited_by_count":0,"area":null},{"id":"2606.00024","title":"ART: Attention Run-time Termination for Efficient Large Language Model Decoding","created":"2026-04-15","cited_by_count":0,"area":null},{"id":"2606.08565","title":"EinSort: Sorting is All We Need for Tensorizing LLM","created":"2026-06-07","cited_by_count":0,"area":null},{"id":"2606.10944","title":"Express Language Modeling","created":"2026-06-09","cited_by_count":0,"area":null},{"id":"2606.29844","title":"MATCH: Modulating Attention via In-Context Retrieval for Long-Context Transformers","created":"2026-06-29","cited_by_count":0,"area":null},{"id":"2607.01002","title":"Logit-Contribution Scoring Identifies Non-Literal Retrieval Heads","created":"2026-07-01","cited_by_count":0,"area":null},{"id":"2607.20457","title":"Dropping the Anchor: Statistical Context Summarization for Distributed Systems via Pulsar Attention","created":"2026-05-14","cited_by_count":0,"area":null},{"id":"2607.22720","title":"CausalGate: Causal Importance Distillation for Transformer Module Pruning","created":"2026-07-21","cited_by_count":0,"area":null},{"id":"2607.24667","title":"Eviction as Estimation: A Fixed-Lag Smoothing View of Test-Time Memory, and When Measuring Beats Accumulating","created":"2026-07-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":"2608.04405","title":"Training-Free Hashing-Based Attention via Binary Principal Components","created":"2026-08-05","cited_by_count":0,"area":null},{"id":"2608.19920","title":"Learning how to Forget: Fine-tuning for Long-Context Sparse Attention","created":"2026-08-20","cited_by_count":0,"area":null},{"id":"2608.22237","title":"Read Less, Solve More: Token-Efficient Sparse Reading for AI Agents","created":"2026-08-23","cited_by_count":0,"area":null},{"id":"2608.27875","title":"HyQuant: Hybrid-Precision Quantization for LLM Attention","created":"2026-08-28","cited_by_count":0,"area":null},{"id":"2608.28276","title":"Parser Transitions Already Reveal Structural Responsibility: KV Persistence for Structured Generation","created":"2026-08-28","cited_by_count":0,"area":null},{"id":"2609.07237","title":"CEDAR: Error-Bounded Residual Routing for Efficient Long-Context Attention","created":"2026-09-07","cited_by_count":0,"area":null},{"id":"2609.07306","title":"RouteRelay: Event-Triggered Cross-Layer Route Reuse for Efficient Dynamic Sparse Attention","created":"2026-09-07","cited_by_count":0,"area":null},{"id":"2609.38878","title":"Audio Token Attention Is Predictable Before the Language Model Runs","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.02233","title":"Budgeted Cache Repair for Cross-Context KV-Cache Reuse","created":"2026-09-27","cited_by_count":0,"area":null},{"id":"2610.02736","title":"TPBench: A Turning-Point Benchmark for Dialogue Compression","created":"2026-10-02","cited_by_count":0,"area":null},{"id":"2610.11784","title":"Compile the Table: Query-Calibrated Operator Compression for Tabular In-Context Learning","created":"2026-10-08","cited_by_count":0,"area":null},{"id":"2610.12133","title":"Rehearse Everything, Remember Nothing: Attic-KV Rehearses What Will Be Read","created":"2026-10-08","cited_by_count":0,"area":null},{"id":"2610.14754","title":"GateSight: Recurrent Memory Anticipates Attention Memory for Query-Agnostic KV Eviction in Hybrid LLMs","created":"2026-10-10","cited_by_count":0,"area":null},{"id":"2610.16003","title":"PAIR: Memory-Efficient and Fast Inference with Reading--Reasoning Fusion","created":"2026-10-12","cited_by_count":0,"area":null}],"next_cursor":null}