{"total":22,"rows":[{"id":"2410.12388","title":"Prompt Compression for Large Language Models: A Survey","created":"2024-10-16","cited_by_count":67,"area":"inference"},{"id":"2602.01719","title":"COMI: Coarse-to-fine Context Compression via Marginal Information Gain","created":"2026-02-02","cited_by_count":13,"area":"inference"},{"id":"2501.12959","title":"Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inference","created":"2025-01-22","cited_by_count":12,"area":"inference"},{"id":"2512.04550","title":"AdmTree: Compressing Lengthy Context with Adaptive Semantic Trees","created":"2025-12-04","cited_by_count":8,"area":"inference"},{"id":"2503.11816","title":"Key, Value, Compress: A Systematic Exploration of KV Cache Compression Techniques","created":"2025-03-14","cited_by_count":5,"area":"inference"},{"id":"2506.08373","title":"Draft-based Approximate Inference for LLMs","created":"2025-06-10","cited_by_count":5,"area":"inference"},{"id":"2509.19228","title":"CompLLM: Compression for Long Context Q&A","created":"2025-09-23","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":"2412.07682","title":"TRIM: Token Reduction and Inference Modeling for Cost-Effective Language Generation","created":"2024-12-10","cited_by_count":2,"area":"inference"},{"id":"2603.19635","title":"BEAVER: A Training-Free Hierarchical Prompt Compression Method via Structure-Aware Page Selection","created":"2026-03-20","cited_by_count":2,"area":"inference"},{"id":"2605.11774","title":"From Token to Token Pair: Efficient Prompt Compression for Large Language Models in Clinical Prediction","created":"2026-05-12","cited_by_count":2,"area":"inference"},{"id":"2509.09199","title":"CCF: A Context Compression Framework for Efficient Long-Sequence Language Modeling","created":"2025-09-11","cited_by_count":1,"area":"inference"},{"id":"2511.12281","title":"Cmprsr: Abstractive Token-Level Question-Agnostic Prompt Compressor","created":"2025-11-15","cited_by_count":1,"area":"inference"},{"id":"2604.23277","title":"From Similarity to Structure: Training-free LLM Context Compression with Hybrid Graph Priors","created":"2026-04-25","cited_by_count":1,"area":"inference"},{"id":"2607.01241","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","created":"2026-05-04","cited_by_count":1,"area":"inference"},{"id":"2608.26175","title":"Lost in Compression: A Controlled Cross-Lingual Audit of Extractive Prompt Compressors","created":"2026-07-27","cited_by_count":1,"area":"inference"},{"id":"2502.13374","title":"Task-agnostic Prompt Compression with Context-aware Sentence Embedding and Reward-guided Task Descriptor","created":"2025-02-19","cited_by_count":0,"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":"2607.17486","title":"SALT: Salience-Aware Lexical Trie for Long-Context Compression","created":"2026-07-20","cited_by_count":0,"area":"inference"},{"id":"2607.25335","title":"Every Time I Hire a Linguist, Inference Costs Go Down: On Linguistic Rules as Effective Prompt Compressors","created":"2026-07-28","cited_by_count":0,"area":"inference"},{"id":"2608.04569","title":"Relevant but Incomplete: Referential Dangling as a Paradigm-Level Failure Mode in Hard Prompt Compression","created":"2026-08-05","cited_by_count":0,"area":"inference"},{"id":"2609.32474","title":"PC-SubMax: Efficient Prompt Compression via Regularized Submodular Maximization","created":"2026-09-26","cited_by_count":0,"area":"inference"}],"next_cursor":null}