{"total":20,"rows":[{"id":"2107.00910","title":"Learned Token Pruning for Transformers","created":"2021-07-02","cited_by_count":139,"area":"inference"},{"id":"2203.13240","title":"Token Dropping for Efficient BERT Pretraining","created":"2022-03-24","cited_by_count":42,"area":"inference"},{"id":"2105.11618","title":"TR-BERT: Dynamic Token Reduction for Accelerating BERT Inference","created":"2021-05-25","cited_by_count":40,"area":"inference"},{"id":"2402.11809","title":"Generation Meets Verification: Accelerating Large Language Model Inference with Smart Parallel Auto-Correct Decoding","created":"2024-02-19","cited_by_count":22,"area":"inference"},{"id":"2511.01815","title":"KV Cache Transform Coding for Compact Storage in LLM Inference","created":"2025-11-03","cited_by_count":13,"area":"inference"},{"id":"2404.15420","title":"XC-Cache: Cross-Attending to Cached Context for Efficient LLM Inference","created":"2024-04-23","cited_by_count":12,"area":"inference"},{"id":"2305.15273","title":"Revisiting Token Dropping Strategy in Efficient BERT Pretraining","created":"2023-05-24","cited_by_count":11,"area":"inference"},{"id":"2402.08644","title":"Tandem Transformers for Inference Efficient LLMs","created":"2024-02-13","cited_by_count":10,"area":"inference"},{"id":"2402.09360","title":"HiRE: High Recall Approximate Top-$k$ Estimation for Efficient LLM Inference","created":"2024-02-14","cited_by_count":7,"area":"inference"},{"id":"2505.15774","title":"Beyond Hard and Soft: Hybrid Context Compression for Balancing Local and Global Information Retention","created":"2025-05-21","cited_by_count":7,"area":"inference"},{"id":"2306.14393","title":"Constraint-aware and Ranking-distilled Token Pruning for Efficient Transformer Inference","created":"2023-06-26","cited_by_count":6,"area":"inference"},{"id":"2602.08585","title":"Predicting Future Utility: Global Combinatorial Optimization for Task-Agnostic KV Cache Eviction","created":"2026-02-09","cited_by_count":6,"area":"inference"},{"id":"2409.16560","title":"Dynamic-Width Speculative Beam Decoding for Efficient LLM Inference","created":"2024-09-25","cited_by_count":5,"area":"inference"},{"id":"2509.23666","title":"Beyond Greedy Exits: Improved Early Exit Decisions for Risk Control and Reliability","created":"2025-09-28","cited_by_count":3,"area":"inference"},{"id":"2510.02480","title":"Controlling the Risk of Corrupted Contexts for Language Models via Early-Exiting","created":"2025-10-02","cited_by_count":3,"area":"inference"},{"id":"2505.18092","title":"QwenLong-CPRS: Towards $\\infty$-LLMs with Dynamic Context Optimization","created":"2025-05-23","cited_by_count":2,"area":"inference"},{"id":"2607.19957","title":"HijackKV: New Threat in Position-Independent KV Cache Reuse","created":"2026-07-22","cited_by_count":2,"area":"inference"},{"id":"2605.01910","title":"Stochastic Sparse Attention for Memory-Bound Inference","created":"2026-05-03","cited_by_count":1,"area":"inference"},{"id":"2609.05707","title":"Intra-Prompt Parallel Decoding for Common-Context Question Answering","created":"2026-09-04","cited_by_count":1,"area":"inference"},{"id":"2606.12243","title":"VIA-SD: Verification via Intra-Model Routing for Speculative Decoding","created":"2026-06-10","cited_by_count":0,"area":"inference"}],"next_cursor":null}