{"total":17,"rows":[{"id":"2411.02886","title":"TokenSelect: Efficient Long-Context Inference and Length Extrapolation for LLMs via Dynamic Token-Level KV Cache Selection","created":"2024-11-05","cited_by_count":39,"area":"inference"},{"id":"2502.10424","title":"QuantSpec: Self-Speculative Decoding with Hierarchical Quantized KV Cache","created":"2025-02-05","cited_by_count":27,"area":"inference"},{"id":"2410.03090","title":"UNComp: Can Matrix Entropy Uncover Sparsity? -- A Compressor Design from an Uncertainty-Aware Perspective","created":"2024-10-04","cited_by_count":15,"area":"inference"},{"id":"2510.24273","title":"SALS: Sparse Attention in Latent Space for KV cache Compression","created":"2025-10-28","cited_by_count":11,"area":"inference"},{"id":"2505.19586","title":"TailorKV: A Hybrid Framework for Long-Context Inference via Tailored KV Cache Optimization","created":"2025-05-26","cited_by_count":10,"area":"inference"},{"id":"2503.24000","title":"Rethinking Key-Value Cache Compression Techniques for Large Language Model Serving","created":"2025-03-31","cited_by_count":8,"area":"inference"},{"id":"2603.14224","title":"Self-Indexing KVCache: Predicting Sparse Attention from Compressed Keys","created":"2026-03-15","cited_by_count":5,"area":"inference"},{"id":"2508.09001","title":"Retrospective Sparse Attention for Efficient Long-Context Generation","created":"2025-08-12","cited_by_count":4,"area":"inference"},{"id":"2510.13602","title":"NOSA: Native and Offloadable Sparse Attention","created":"2025-10-15","cited_by_count":4,"area":"inference"},{"id":"2606.31519","title":"RaBitQCache: Rotated Binary Quantization for KVCache in Long Context LLM Inference","created":"2026-06-30","cited_by_count":2,"area":"inference"},{"id":"2604.07815","title":"AsyncTLS: Efficient Generative LLM Inference with Asynchronous Two-level Sparse Attention","created":"2026-04-09","cited_by_count":1,"area":"inference"},{"id":"2609.02737","title":"Language Models Can Control Their Own Attention","created":"2026-09-02","cited_by_count":1,"area":"inference"},{"id":"2604.16864","title":"HieraSparse: Hierarchical Semi-Structured Sparse KV Attention","created":"2026-04-18","cited_by_count":0,"area":"inference"},{"id":"2608.21541","title":"Beyond Sparse Weights: When Is Attention Compressible?","created":"2026-08-21","cited_by_count":0,"area":"inference"},{"id":"2609.13205","title":"Self-Indexing Attention for Compression-Compatible Sparse Long-Context LLM Inference","created":"2026-08-16","cited_by_count":0,"area":"inference"},{"id":"2609.17652","title":"Fathom: Per-Query Read Depth for Sparse Decoding over Offloaded KV Caches","created":"2026-09-15","cited_by_count":0,"area":"inference"},{"id":"2610.09827","title":"Dual-QK: Sharp Queries and Flat Keys for Prunable 2-bit KV Caches","created":"2026-10-07","cited_by_count":0,"area":"inference"}],"next_cursor":null}