- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work introduces MixTok for image tokenization. It keeps a short 1D token sequence as a global base and adds 2D tokens only at selected locations for local refinement. A grid scorer ranks spatial positions by refinement priority, and a top-p budget controller decides how many 2D tokens each image receives under a target average budget. At the chosen locations, 2D features replace the spatial features expanded from the 1D tokens, and a shared decoder reconstructs the image from the mixed grid. For class-conditional generation, a two-stage MaskGIT first produces the 1D tokens, which then determine where and how many 2D tokens to generate. Experiments on ImageNet shows that MixTok uses about 128 content tokens to reach an rFID of 1.195 and a PSNR of 19.51 dB, demonstrating the effectivess of the proposed method.
Critical strengths
-
The core idea is simple and intuitive: use compact 1D tokens for global structure and add sparse 2D tokens only where local refinement is needed. This gives a clear way to combine the strengths of 1D and 2D tokenizers.
-
The empirical results are strong at the tested setting. MixTok achieves competitive reconstruction quality at about 128 content tokens and obtains the best gFID among the reported generation baselines in Table 3.
Critical weaknesses
-
The practical benefit is not fully convincing. MixTok stores fewer content tokens, but reconstruction still uses a dense 2D encoder and a dense 16×16 decoder grid, while generation still runs on the full spatial sequence. As a result, the method does not clearly translate token reduction into compute reduction, and its latency/FLOPs are still higher than some baselines such as LPD-L-256.
-
The experimental scope is limited. All main results are on ImageNet 256×256 with a narrow token-budget range, which is not enough to validate the claim that sparse 2D refinement preserves fine details. Higher-resolution results or detail-heavy scenarios such as text rendering, documents, or thin structures would make the evidence more convincing.
-
The related-work comparison is incomplete. Keep-or-Drop (Adaptive Tokenizer for Compact Video Representation) appears closely related because it also studies which tokens to retain under a compact budget, but it is not discussed or compared. The paper also cites spatial adaptive tokenizers such as DQ-VAE and GPSToken without evaluating against them, making it hard to isolate the benefit of MixTok’s hybrid design.
Questions for authors
-
Since MixTok still uses dense 2D encoding, dense decoding, and a full spatial sequence in the second-stage generator, could the authors clarify the main practical use case where the reduced number of stored content tokens is more important than end-to-end compute or latency?
-
Could the authors provide a more detailed compute breakdown for tokenization and generation, including the costs of the 1D branch, 2D branch, grid scorer, budget controller, and shared decoder?
-
How well does MixTok generalize beyond ImageNet 256×256? In particular, can the authors provide results at higher resolutions or on detail-sensitive data such as rendered text, documents, thin structures, or small objects?
-
How does MixTok compare with adaptive or sparse tokenization methods that explicitly decide which tokens to keep or drop, such as Keep-or-Drop, DQ-VAE, or GPSToken, under matched token budgets and compute budgets?