{"total":22,"rows":[{"id":"2210.09461","title":"Token Merging: Your ViT But Faster","created":"2022-10-17","cited_by_count":1021,"area":"inference"},{"id":"2506.00413","title":"Accelerating Diffusion LLMs via Adaptive Parallel Decoding","created":"2025-05-31","cited_by_count":112,"area":"inference"},{"id":"2304.10716","title":"Joint Token Pruning and Squeezing Towards More Aggressive Compression of Vision Transformers","created":"2023-04-21","cited_by_count":81,"area":"inference"},{"id":"2308.04657","title":"Which Tokens to Use? Investigating Token Reduction in Vision Transformers","created":"2023-08-09","cited_by_count":60,"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":"2306.07050","title":"Revisiting Token Pruning for Object Detection and Instance Segmentation","created":"2023-06-12","cited_by_count":50,"area":"inference"},{"id":"2310.10998","title":"Accelerating Scalable Graph Neural Network Inference with Node-Adaptive Propagation","created":"2023-10-17","cited_by_count":8,"area":"inference"},{"id":"2407.20485","title":"A2SF: Accumulative Attention Scoring with Forgetting Factor for Token Pruning in Transformer Decoder","created":"2024-07-30","cited_by_count":8,"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":"2303.06522","title":"Token Sparsification for Faster Medical Image Segmentation","created":"2023-03-11","cited_by_count":4,"area":"inference"},{"id":"2410.20022","title":"Dynamic layer selection in decoder-only transformers","created":"2024-10-26","cited_by_count":4,"area":"inference"},{"id":"2604.19398","title":"GRASPrune: Global Gating for Budgeted Structured Pruning of Large Language Models","created":"2026-04-21","cited_by_count":2,"area":"inference"},{"id":"2502.13251","title":"Neural Attention Search","created":"2025-02-18","cited_by_count":1,"area":"inference"},{"id":"2504.15475","title":"Speculative Sampling via Exponential Races","created":"2025-04-21","cited_by_count":1,"area":"inference"},{"id":"2602.01428","title":"Improving the Trade-off Between Watermark Strength and Speculative Sampling Efficiency for Language Models","created":"2026-02-01","cited_by_count":1,"area":"inference"},{"id":"2604.14563","title":"Revisiting Token Compression for Accelerating ViT-based Sparse Multi-View 3D Object Detectors","created":"2026-04-16","cited_by_count":1,"area":"inference"},{"id":"2609.37988","title":"KV-Kaizen: Learning Context-Adaptive Cache Compression Choices","created":"2026-09-29","cited_by_count":1,"area":"inference"},{"id":"2602.02163","title":"Reg4Pru: Regularisation Through Random Token Routing for Token Pruning","created":"2026-02-02","cited_by_count":0,"area":"inference"},{"id":"2607.20475","title":"SonicSampler: Unified Tile-Aware Kernels for LLM Sampling and Speculative Verification","created":"2026-05-24","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":"2609.29867","title":"Does per-frame early exit pay? A compute-matched study of dynamic depth for on-device speech enhancement","created":"2026-09-24","cited_by_count":0,"area":"inference"}],"next_cursor":null}