{"total":21,"rows":[{"id":"2210.09461","title":"Token Merging: Your ViT But Faster","created":"2022-10-17","cited_by_count":1021,"area":"inference"},{"id":"2310.06839","title":"LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compression","created":"2023-10-10","cited_by_count":453,"area":"inference"},{"id":"2207.07061","title":"Confident Adaptive Language Modeling","created":"2022-07-14","cited_by_count":310,"area":"inference"},{"id":"2107.00910","title":"Learned Token Pruning for Transformers","created":"2021-07-02","cited_by_count":139,"area":"inference"},{"id":"2312.01026","title":"Token Fusion: Bridging the Gap between Token Pruning and Token Merging","created":"2023-12-02","cited_by_count":125,"area":"inference"},{"id":"2305.17328","title":"Zero-TPrune: Zero-Shot Token Pruning through Leveraging of the Attention Graph in Pre-Trained Transformers","created":"2023-05-27","cited_by_count":62,"area":"inference"},{"id":"2505.18227","title":"Token Reduction Should Go Beyond Efficiency in Generative Models -- From Vision, Language to Multimodality","created":"2025-05-23","cited_by_count":50,"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":"2407.08892","title":"Characterizing Prompt Compression Methods for Long Context Inference","created":"2024-07-11","cited_by_count":18,"area":"inference"},{"id":"2112.06540","title":"A Study on Token Pruning for ColBERT","created":"2021-12-13","cited_by_count":15,"area":"inference"},{"id":"2306.16009","title":"Accelerating Transducers through Adjacent Token Merging","created":"2023-06-28","cited_by_count":15,"area":"inference"},{"id":"2312.11882","title":"ConsistentEE: A Consistent and Hardness-Guided Early Exiting Method for Accelerating Language Models Inference","created":"2023-12-19","cited_by_count":13,"area":"inference"},{"id":"2410.11786","title":"Selection-p: Self-Supervised Task-Agnostic Prompt Compression for Faithfulness and Transferability","created":"2024-10-15","cited_by_count":9,"area":"inference"},{"id":"2311.08623","title":"DEED: Dynamic Early Exit on Decoder for Accelerating Encoder-Decoder Transformer Models","created":"2023-11-15","cited_by_count":7,"area":"inference"},{"id":"2406.01283","title":"Focus on the Core: Efficient Attention via Pruned Token Compression for Document Classification","created":"2024-06-03","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":"2504.04514","title":"Saliency-driven Dynamic Token Pruning for Large Language Models","created":"2025-04-06","cited_by_count":5,"area":"inference"},{"id":"2407.19410","title":"AdaCoder: Adaptive Prompt Compression for Programmatic Visual Question Answering","created":"2024-07-28","cited_by_count":1,"area":"inference"},{"id":"2408.11799","title":"Practical token pruning for foundation models in few-shot conversational virtual assistant systems","created":"2024-08-21","cited_by_count":1,"area":"inference"},{"id":"2411.18092","title":"Training Noise Token Pruning","created":"2024-11-27","cited_by_count":0,"area":"inference"},{"id":"2608.20632","title":"Sparse Token Routing in Efficient Transformers","created":"2026-08-21","cited_by_count":0,"area":"inference"}],"next_cursor":null}