Reg4Pru: Regularisation Through Random Token Routing for Token Pruning
Julian Wyatt, Ronald Clark, Irina Voiculescu
TL;DR
Reg4Pru addresses the quadratic cost $O(N^2)$ of attention in Transformers for dense prediction by regularising token pruning during training. It introduces train-time token routing with random bounds to emulate pruning and reduce depth-wise instability, plus an informed-policy extension for multi-budget deployment. The approach yields large gains on FIVES, with an absolute AP improvement around 46 percentage points over the same pruned model without routing and about a 29% wall-clock speedup relative to a non-pruned baseline, demonstrating practical throughput gains without sacrificing accuracy. This work suggests Reg4Pru as a general regulariser for token reduction strategies and a step toward robust, adaptable dense-prediction models.
Abstract
Transformers are widely adopted in modern vision models due to their strong ability to scale with dataset size and generalisability. However, this comes with a major drawback: computation scales quadratically to the total number of tokens. Numerous methods have been proposed to mitigate this. For example, we consider token pruning with reactivating tokens from preserved representations, but the increased computational efficiency of this method results in decreased stability from the preserved representations, leading to poorer dense prediction performance at deeper layers. In this work, we introduce Reg4Pru, a training regularisation technique that mitigates token-pruning performance loss for segmentation. We compare our models on the FIVES blood vessel segmentation dataset and find that Reg4Pru improves average precision by an absolute 46% compared to the same model trained without routing. This increase is observed using a configuration that achieves a 29% relative speedup in wall-clock time compared to the non-pruned baseline. These findings indicate that Reg4Pru is a valuable regulariser for token reduction strategies.
