All papersComputer VisionCarnegie Mellon

Learning Hierarchical Patch Splitting Policies for Faster Vision Transformers

/ Paper arXiv 2611.05742

Key numbers

30%SPLIT matches the accuracy of full-resolution ViT classification baselines while using 30% fewer tokens

From the paperCopied from the abstract, not written by AI.

Abstract

From the paperThe authors' own words.

Vision Transformers (ViTs) are bottlenecked by the length of their input token sequence. Standard patchification fixes this length with a single patch size applied across the image, regardless of regional content. Prior work on adaptive patch sizing reduces token count by assigning coarser patches to visually simple regions, but relies on noisy pixel-level heuristics such as local entropy to make patchification decisions. We argue that this compute allocation should be grounded in the model's interpretation of task relevant information, not in raw pixel statistics. We introduce Split Policy Learned Image Tokenization which learns to allocate token resolution based on what the model finds meaningful, producing shorter token sequences that are better matched to task-relevant content. SPLIT matches the accuracy of full-resolution ViT classification baselines while using 30% fewer tokens. The same gains hold on dense prediction: SPLIT achieves competitive accuracy on COCO and ADE20K, demonstrating that semantically aligned patchification generalises well beyond classification.

From the full paper

From the paperCopied from the paper itself by our code.

Reading the paper on arXiv…

Ask this paper

/ Ask a questionAnswers come from the full paper and name the section

    / Your notes

    Select text in the abstract to highlight it or add a note. They stay in this browser.

      Read the PDF