mlsanityData to 14 Oct 2026

DORA: Dynamic Online Reinforcement Agent for Token Pruning in Vision Transformers

arXiv 2609.34325 ↗First posted 28 Sep 2026cs.CVcited by 0

On the map: Efficient LLM inference and serving → Token pruning and merging for ViTs

Abstract (arXiv)

Vision Transformers (ViTs) incur quadratic self-attention cost in the number of tokens. Most token-reduction methods adapt token identities within a prescribed layer-wise compression schedule, or search a static mask offline, and thus limit online adaptation of when and how much to prune. We propose DORA (Dynamic Online Reinforcement Agent), which learns an input-adaptive pruning policy itself for frozen ViTs. At each eligible block, a hierarchical actor decides whether to prune, how many tokens to remove, and which tokens to remove from each image's evolving representation. Because early deletions change the states observed by later decisions, DORA formulates pruning as a finite-horizon Markov decision process. Complete-prefix shadow evaluations convert final-prediction fidelity into localized per-step credit, while closed-loop accuracy feedback adjusts the fidelity penalty toward a shared accuracy-drop target. A privileged critic and all shadow computations are training-only. Deployment retains the frozen backbone and a lightweight actor that applies hard deletion and packed variable-length FlashAttention, converting token reduction into measured speedups. On ImageNet-1K with DeiT-Base, DORA reduces FLOPs by 38.4% relative to the uncompressed backbone within one percentage point of accuracy loss. Averaged across four ViT-type backbones at matched accuracy, DORA uses 13.2% fewer FLOPs and achieves 32.4% higher throughput than the corresponding per-backbone baseline means. Under zero-shot transfer to ImageNet-A, these gains widen to 20.3% and 45.6%, respectively.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Token pruning and merging for ViTs, one of 12 directions in Efficient LLM inference and serving. Builds on 19 of its 22 references that are in the map. First posted on arXiv 28 Sep 2026.

Builds on

19 of 22 references.

Closest ancestors · 5

Same direction, newest first

  1. 2025Reinforcement Learning-based Token Pruning in Vision Transformers: A Markov Game Approach30 Mar
  2. 2024Accelerating Transformers with Spectrum-Preserving Token Merging25 May
  3. 2023DiffRate : Differentiable Compression Rate for Efficient Vision Transformers29 May
  4. 2023Zero-TPrune: Zero-Shot Token Pruning through Leveraging of the Attention Graph in Pre-Trained Transformers27 May
  5. 2022Token Merging: Your ViT But Faster17 Oct

Other references · 14

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  2. 2017Proximal Policy Optimization Algorithmscited by 15,215
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  4. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  5. 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
  6. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  7. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
  8. 2019Natural Adversarial Examplescited by 1,408
  9. 2020Gradient Surgery for Multi-Task Learningcited by 1,256
  10. 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 864
  11. 2021How to train your ViT? Data, Augmentation, and Regularization in Vision Transformerscited by 569
  12. 2021Adaptive Token Sampling For Efficient Vision Transformerscited by 183
2 more
  1. 2024Multi-criteria Token Fusion with One-step-ahead Attention for Efficient Vision Transformerscited by 26
  2. 2025Representation Shift: Unifying Token Compression with FlashAttentioncited by 5

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026DORA: Dynamic Online Reinforcement Agent for Token Merging in Vision Transformers
  2. 2023PPT: Token Pruning and Pooling for Efficient Vision Transformers
  3. 2025Similarity-Aware Token Pruning: Your VLM but Faster
  4. 2026Scaling Vision Transformers Without Training: Prune-and-Merge Token Compression
  5. 2021Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformer
  6. 2026Fusion: A Framework for Unified Sequential Token AdaptatIon in VisiOn TraNsformers
  7. 2023No Token Left Behind: Efficient Vision Transformer via Dynamic Token Idling
  8. 2026Dispatch-Aware Ragged Attention for Pruned Vision Transformers