{"total":49,"rows":[{"id":"2210.09461","title":"Token Merging: Your ViT But Faster","created":"2022-10-17","cited_by_count":1021,"area":"inference"},{"id":"2310.01801","title":"Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs","created":"2023-10-03","cited_by_count":474,"area":"inference"},{"id":"2407.11550","title":"Ada-KV: Optimizing KV Cache Eviction by Adaptive Budget Allocation for Efficient LLM Inference","created":"2024-07-16","cited_by_count":235,"area":"inference"},{"id":"2108.01390","title":"Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformer","created":"2021-08-03","cited_by_count":177,"area":"inference"},{"id":"2302.07863","title":"Speculative Decoding with Big Little Decoder","created":"2023-02-15","cited_by_count":164,"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":"2401.06104","title":"Transformers are Multi-State RNNs","created":"2024-01-11","cited_by_count":120,"area":"inference"},{"id":"2203.07259","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","created":"2022-03-14","cited_by_count":115,"area":"inference"},{"id":"2312.15234","title":"Towards Efficient Generative Large Language Model Serving: A Survey from Algorithms to Systems","created":"2023-12-23","cited_by_count":102,"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":"2306.07050","title":"Revisiting Token Pruning for Object Detection and Instance Segmentation","created":"2023-06-12","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":"2209.13802","title":"Adaptive Sparse ViT: Towards Learnable Adaptive Token Pruning by Fully Exploiting Self-Attention","created":"2022-09-28","cited_by_count":35,"area":"inference"},{"id":"2405.16148","title":"Accelerating Transformers with Spectrum-Preserving Token Merging","created":"2024-05-25","cited_by_count":35,"area":"inference"},{"id":"2203.01670","title":"A Simple Hash-Based Early Exiting Approach For Language Understanding and Generation","created":"2022-03-03","cited_by_count":32,"area":"inference"},{"id":"2406.07056","title":"Effectively Compress KV Heads for LLM","created":"2024-06-11","cited_by_count":30,"area":"inference"},{"id":"2105.13878","title":"Accelerating BERT Inference for Sequence Labeling via Early-Exit","created":"2021-05-28","cited_by_count":29,"area":"inference"},{"id":"2111.00230","title":"Magic Pyramid: Accelerating Inference with Early Exiting and Token Pruning","created":"2021-10-30","cited_by_count":16,"area":"inference"},{"id":"2107.00175","title":"Elbert: Fast Albert with Confidence-Window Based Early Exit","created":"2021-07-01","cited_by_count":14,"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":"2403.08058","title":"CHAI: Clustered Head Attention for Efficient LLM Inference","created":"2024-03-12","cited_by_count":13,"area":"inference"},{"id":"2405.15039","title":"CEEBERT: Cross-Domain Inference in Early Exit BERT","created":"2024-05-23","cited_by_count":12,"area":"inference"},{"id":"2505.22135","title":"RAD: Redundancy-Aware Distillation for Hybrid Models via Self-Speculative Decoding","created":"2025-05-28","cited_by_count":8,"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":"2404.15949","title":"CORM: Cache Optimization with Recent Message for Large Language Model Inference","created":"2024-04-24","cited_by_count":7,"area":"inference"},{"id":"2502.00745","title":"BEEM: Boosting Performance of Early Exit DNNs using Multi-Exit Classifiers as Experts","created":"2025-02-02","cited_by_count":6,"area":"inference"},{"id":"2408.01890","title":"Cross-layer Attention Sharing for Pre-trained Large Language Models","created":"2024-08-04","cited_by_count":5,"area":"inference"},{"id":"2410.04424","title":"DAdEE: Unsupervised Domain Adaptation in Early Exit PLMs","created":"2024-10-06","cited_by_count":5,"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":"2503.23455","title":"Efficient Token Compression for Vision Transformer with Spatial Information Preserved","created":"2025-03-30","cited_by_count":4,"area":"inference"},{"id":"2410.05338","title":"Distributed Inference on Mobile Edge and Cloud: An Early Exit based Clustering Approach","created":"2024-10-06","cited_by_count":3,"area":"inference"},{"id":"2512.20120","title":"HEART-VIT: Hessian-Guided Efficient Dynamic Attention and Token Pruning in Vision Transformer","created":"2025-12-23","cited_by_count":3,"area":"inference"},{"id":"2210.15523","title":"COST-EFF: Collaborative Optimization of Spatial and Temporal Efficiency with Slenderized Multi-exit Language Models","created":"2022-10-27","cited_by_count":2,"area":"inference"},{"id":"2601.11471","title":"Low-Rank Key Value Attention","created":"2026-01-16","cited_by_count":2,"area":"inference"},{"id":"2606.06302","title":"Tangram: Unlocking Non-Uniform KV Cache Compression for Efficient Multi-turn LLM Serving","created":"2026-06-04","cited_by_count":2,"area":"inference"},{"id":"2504.17996","title":"Back to Fundamentals: Low-Level Visual Features Guided Progressive Token Pruning","created":"2025-04-25","cited_by_count":1,"area":"inference"},{"id":"2512.10547","title":"Unlocking the Address Book: Dissecting the Sparse Semantic Structure of LLM Key-Value Caches via Sparse Autoencoders","created":"2025-12-11","cited_by_count":1,"area":"inference"},{"id":"2604.19351","title":"DASH-KV: Accelerating Long-Context LLM Inference via Asymmetric KV Cache Hashing","created":"2026-04-21","cited_by_count":1,"area":"inference"},{"id":"2606.15157","title":"Exploring a Layer-Wise Design Space for KV Cache Eviction","created":"2026-06-13","cited_by_count":1,"area":"inference"},{"id":"2607.27735","title":"A Sparse Glimpse of the Whole: Train-Free Self-Speculative Decoding","created":"2026-07-30","cited_by_count":1,"area":"inference"},{"id":"2412.05225","title":"BEExformer: A Fast Inferencing Binarized Transformer with Early Exits","created":"2024-12-06","cited_by_count":0,"area":"inference"},{"id":"2505.20698","title":"Sparsified State-Space Models are Efficient Highway Networks","created":"2025-05-27","cited_by_count":0,"area":"inference"},{"id":"2605.01058","title":"LEAP: Layer-wise Exit-Aware Pretraining for Efficient Transformer Inference","created":"2026-05-01","cited_by_count":0,"area":"inference"},{"id":"2608.13076","title":"SPADE: Speculative Decoding for Precise and Low Cost Distributed Edge Cloud Inference","created":"2026-08-13","cited_by_count":0,"area":"inference"},{"id":"2608.22704","title":"WnW: Waxing-and-Waning KV Cache for Long-Form Speech LLMs","created":"2026-08-24","cited_by_count":0,"area":"inference"},{"id":"2608.30439","title":"Event-Driven Language Models with Sparse Neural Activity for Neuromorphic Hardware","created":"2026-08-31","cited_by_count":0,"area":"inference"},{"id":"2610.03135","title":"Page-EntroKV: Hardware-Aligned, Entropy-Weighted KV-Cache Eviction under Grouped-Query Attention","created":"2026-10-02","cited_by_count":0,"area":"inference"},{"id":"2610.18026","title":"ChampionKV: Head-Wise Adaptive Budget Allocation for KV Cache Compression","created":"2026-10-13","cited_by_count":0,"area":"inference"}],"next_cursor":null}