The content-agnostic, fixed-grid tokenizers used by standard large-scale vision models like Vision Transformer (ViT) and Vision Mamba (Vim) represent a fundamental performance bottleneck, creating a trade-off between capturing fine-grained detail and suffering from redundant computation. To resolve this dilemma, we introduce DART, a fully differentiable Dynamic Adaptive Region Tokenizer. DART employs learnable region scores and quantile-based partitioning to create content-aware patches of varying sizes, intelligently allocating a higher token density to information-rich regions. The impact of this approach is profound: it unlocks a more intelligent scaling paradigm, where a DART-equipped DeiT-Small (22M parameters) matches the performance of a DeiT-Base (86M) with nearly double the inference speed by efficiently capturing high-resolution details in key regions. Furthermore, the principle of adaptive tokenization proves its generality with clear benefits in dense prediction and spatiotemporal video tasks. We argue that by resolving the tokenizer bottleneck at its source, adaptive tokenization is a key component for building the next generation of more efficient and capable foundation models for multimodal AI, robotics, and content generation. Code is available at https://github.com/HCPLab-SYSU/DART.
Figures & tables
Figure 1
Figure 3: Illustration of our core differentiable partitioning mechanism. (a) Boundaries for a 1D distribution are found by inverting its piecewise-linear CDF at uniform quantiles (e.g., 1/3, 2/3). (b) The DART-Grid is formed by independently applying this 1D algorithm to the horizontal and vertical marginal distributions of the 2D score map, where the score map produced by the lightweight network is overlaid on the image.
Figure 4: The DART-Flow process. The partitioning algorithm is applied sequentially: first to create adaptive horizontal rows, and then to globally allocate tokens across all rows.
Figure 5: Patch partitioning on an example from the SSv2 dataset Goyal et al. (2017) .
Figure 7: Visualization of the learned score map and patch boundaries at different training epochs, showing the model progressively learning to focus on the salient object.
Appendix figures & tables7 assets
Supplementary material from the paper’s appendix.
Appendix
Scoring Network
Top-1 (%)
w/o (Baseline)
72.2
MobileNetV3-S Howard et al. (2019)
73.8 (+1.6)
MnasNet Tan et al. (2019)
74.0 (+1.8)
SqueezeNet Iandola et al. (2017)
74.3 (+2.1)
EfficientNet-B0 Tan & Le (2019)
75.1 (+2.9)
Appendix
Table 9: Impact of the scoring network architecture on DeiT-Ti.
Model
Throughput (img/s)
Latency (ms)
DeiT-S (Baseline)
1110.5
115.3
DeiT-S + DART
1053.2 (-5.2%)
121.5 (+6.2ms)
Appendix
Table 10: DART module overhead on an NVIDIA RTX 3090 (196 tokens, batch size 128).
Model
Feature Extractor
DeiT - Ti
MobileNetV3 Small[:11]
DeiT - S
MobileNetV3 Large[:15]
Vim - Ti
MobileNetV3 Small[:13]
Vim - S
MobileNetV3 Large[:17]
VideoMamba - Ti
MobileNetV3 Small[:13]
Appendix
Table 11: Feature extractor configurations for various backbone models.
Figure 8: Qualitative comparison of DART’s behavior on two distinct types of challenging inputs. These cases highlight the model’s adaptive nature, showing how it intelligently shifts between highly focused and uniform partitioning strategies based on image content.
Figure 9: Partition examples produced by our DART model (Part 1).
Figure 10: Partition examples produced by our DART model (Part 2).
Figure 11: A visual comparison of partitioning strategies. Left: Our main DART-Flow method. Middle: The grid-preserving DART-Grid method. Right: A visualization simulating the model’s input for the DART-Grid method, created by reassembling the non-uniform patches into a uniform grid. In this view, high-density regions (e.g., the animal’s body) appear magnified while low-density background areas are compressed. It is important to note that this is purely a visualization aid; the model’s understanding of the original geometry is preserved through transformed positional embeddings and is not distorted.
Diffusion Transformers rely on static patchify tokenization, assigning the same token budget to smooth backgrounds, detailed object regions, noisy early timesteps, and late-stage refinements. We introduce the Dynamic Chunking Diffusion Transformer (DC-DiT), which replaces fixed patchification with a learned encoder-router-decoder scaffold that adaptively compresses the 2D input into a shorter token sequence through a chunking mechanism learned end-to-end with diffusion training. DC-DiT allocates fewer tokens to predictable regions and noisy timesteps, and more tokens to detailed regions and later refinement stages, yielding meaningful spatial segmentations and timestep-adaptive compression schedules without supervision. Furthermore, the router provides an importance ordering over retained tokens, enabling elastic inference: a single checkpoint can be evaluated at flexible compute budgets with a smooth quality-compute tradeoff. Additionally, DC-DiT can be upcycled from pretrained DiT checkpoints and is also compatible with orthogonal dynamic computation approaches. On class-conditional ImageNet generation, DC-DiT reduces inference FLOPs by up to 36.8% and improves FID by up to 37.8% over DiT baselines, yielding a stronger quality--compute Pareto frontier across model scales, resolutions, and guidance settings. More broadly, these results suggest that adaptive tokenization is a general mechanism for making visual generation both more efficient and more flexible at inference time.
We present ARTA, a mixed-resolution coarse-to-fine vision transformer for efficient dense feature extraction. Unlike models that begin with dense high-resolution (fine) tokens, ARTA starts with low-resolution (coarse) tokens and uses a lightweight allocator to predict which regions require more fine tokens. The allocator iteratively predicts a semantic (class) boundary score and allocates additional tokens to patches above a low threshold, concentrating token density near boundaries while maintaining high sensitivity to weak boundary evidence. This targeted allocation encourages tokens to represent a single semantic class rather than a mixture of classes. Mixed-resolution attention enables interaction between coarse and fine tokens, focusing computation on semantically complex areas while avoiding redundant processing in homogeneous regions. Experiments demonstrate that ARTA achieves state-of-the-art results on ADE20K and COCO-Stuff with substantially fewer FLOPs, and delivers competitive performance on Cityscapes at markedly lower compute. For example, ARTA-Base attains 54.6 mIoU on ADE20K in the ~100M-parameter class while using fewer FLOPs and less memory than comparable backbones.
David Hagerman, Roman Naeem, Erik Brorsson +2
Chalmers University of TechnologyChalmers University of technology, 412 96 Gothenburg, Sweden
Leading flexible vision tokenizers achieve SOTA quality at an extreme cost, relying on parameter-heavy backbones and slow, multi-step generative decoders. We depart from this complex, spatial-token paradigm and introduce a simple, lightweight, and fast channel-wise flexible-length tokenizer. Our method treats each latent channel as a visual token, enabling a parameter-efficient CNN-Transformer hybrid backbone. Furthermore, employing a stochastic tail-dropping paradigm during training naturally forces channels to organize by semantic importance. This allows for flexible compression at inference by simply retaining the first k channels, and naturally enables variable-length autoregressive image generation. We validate our approach through extensive experiments on ImageNet, demonstrating consistent quality across diverse token budgets. The results establish a new quality-efficiency frontier: our model achieves state-of-the-art perceptual quality (rFID 2.92) while being 8.6× faster in decoding and 2.1× smaller (159M params) than the next-best alternative. Our work establishes channel-wise tokenization as a powerful and practical paradigm for efficient visual representation. Project page: https://channeltok.github.io