{"total":33,"rows":[{"id":"2309.06180","title":"Efficient Memory Management for Large Language Model Serving with PagedAttention","created":"2023-09-12","cited_by_count":5944,"area":"inference"},{"id":"2210.03162","title":"Prompt Compression and Contrastive Conditioning for Controllability and Toxicity Reduction in Language Models","created":"2022-10-06","cited_by_count":97,"area":"inference"},{"id":"2506.06266","title":"Cartridges: Lightweight and general-purpose long context representations via self-study","created":"2025-06-06","cited_by_count":86,"area":"inference"},{"id":"2410.12388","title":"Prompt Compression for Large Language Models: A Survey","created":"2024-10-16","cited_by_count":67,"area":"inference"},{"id":"2401.15569","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","created":"2024-01-28","cited_by_count":54,"area":"inference"},{"id":"2408.03094","title":"500xCompressor: Generalized Prompt Compression for Large Language Models","created":"2024-08-06","cited_by_count":47,"area":"inference"},{"id":"2308.08758","title":"Discrete Prompt Compression with Reinforcement Learning","created":"2023-08-17","cited_by_count":42,"area":"inference"},{"id":"2502.13063","title":"Cramming 1568 Tokens into a Single Vector and Back Again: Exploring the Limits of Embedding Space Capacity","created":"2025-02-18","cited_by_count":28,"area":"inference"},{"id":"2404.04997","title":"Adapting LLMs for Efficient Context Processing through Soft Prompt Compression","created":"2024-04-07","cited_by_count":22,"area":"inference"},{"id":"2404.00489","title":"Prompt-SAW: Leveraging Relation-Aware Graphs for Textual Prompt Compression","created":"2024-03-30","cited_by_count":18,"area":"inference"},{"id":"2404.07979","title":"LLoCO: Learning Long Contexts Offline","created":"2024-04-11","cited_by_count":16,"area":"inference"},{"id":"2405.18628","title":"Hardware-Aware Parallel Prompt Decoding for Memory-Efficient Acceleration of LLM Inference","created":"2024-05-28","cited_by_count":16,"area":"inference"},{"id":"2503.19114","title":"Understanding and Improving Information Preservation in Prompt Compression for LLMs","created":"2025-03-24","cited_by_count":15,"area":"inference"},{"id":"2507.01438","title":"EdgeLoRA: An Efficient Multi-Tenant LLM Serving System on Edge Devices","created":"2025-07-02","cited_by_count":11,"area":"inference"},{"id":"2603.10899","title":"LookaheadKV: Fast and Accurate KV Cache Eviction by Glimpsing into the Future without Generation","created":"2026-03-11","cited_by_count":10,"area":"inference"},{"id":"2411.17741","title":"Chameleon: Adaptive Caching and Scheduling for Many-Adapter LLM Inference Environments","created":"2024-11-24","cited_by_count":9,"area":"inference"},{"id":"2410.04139","title":"From Reading to Compressing: Exploring the Multi-document Reader for Prompt Compression","created":"2024-10-05","cited_by_count":7,"area":"inference"},{"id":"2402.04838","title":"PaDeLLM-NER: Parallel Decoding in Large Language Models for Named Entity Recognition","created":"2024-02-07","cited_by_count":6,"area":"inference"},{"id":"2504.11004","title":"Dynamic Compressing Prompts for Efficient Inference of Large Language Models","created":"2025-04-15","cited_by_count":6,"area":"inference"},{"id":"2606.04557","title":"Cartridges at Scale: Training Modular KV Caches over Large Document Collections","created":"2026-06-03","cited_by_count":6,"area":"inference"},{"id":"2505.03756","title":"Improving the Serving Performance of Multi-LoRA Large Language Models via Efficient LoRA and KV Cache Management","created":"2025-04-19","cited_by_count":5,"area":"inference"},{"id":"2511.22880","title":"Serving Heterogeneous LoRA Adapters in Distributed LLM Inference Systems","created":"2025-11-28","cited_by_count":5,"area":"inference"},{"id":"2506.00307","title":"Lossless Token Sequence Compression via Meta-Tokens","created":"2025-05-30","cited_by_count":4,"area":"inference"},{"id":"2405.11299","title":"The CAP Principle for LLM Serving: A Survey of Long-Context Large Language Model Serving","created":"2024-05-18","cited_by_count":3,"area":"inference"},{"id":"2503.11108","title":"Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decoding","created":"2025-03-14","cited_by_count":2,"area":"inference"},{"id":"2604.03270","title":"Knowledge Packs: Zero-Token Knowledge Delivery via KV Cache Injection","created":"2026-03-22","cited_by_count":2,"area":"inference"},{"id":"2605.06225","title":"Memory Inception: Latent-Space KV Cache Manipulation for Steering LLMs","created":"2026-05-07","cited_by_count":2,"area":"inference"},{"id":"2603.08739","title":"Adaptive Multi-Objective Tiered Storage Configuration for KV Cache in LLM Service","created":"2026-02-25","cited_by_count":1,"area":"inference"},{"id":"2607.21231","title":"Progressive Cramming: Reliable Token Compression and What It Reveals","created":"2026-07-23","cited_by_count":1,"area":"inference"},{"id":"2608.30647","title":"What It Costs to Compose, Rebuild, and Correct Precomputed Memory","created":"2026-08-31","cited_by_count":1,"area":"inference"},{"id":"2604.15153","title":"Compressing Sequences in the Latent Embedding Space: $K$-Token Merging for Large Language Models","created":"2026-04-16","cited_by_count":0,"area":"inference"},{"id":"2609.13682","title":"LayerRoute: Adaptive Layer-Skipping with LoRA-Preserved Quality for Efficient LLM Inference","created":"2026-09-12","cited_by_count":0,"area":"inference"},{"id":"2610.18014","title":"LatentRemedy: Efficient Remedy For Non-Prefix KV Cache Reuse in Multi-Agent Systems","created":"2026-10-13","cited_by_count":0,"area":"inference"}],"next_cursor":null}