G-STAR: Group-Scaled Token Capacity for Deeply Compressed Autoregressive Generation

Xu Huang, Ye Huang, Xiaotong Li, Zhengrong Yue, Jialv Zou, Minhao Jing, Haodong Li, Wenhao Yan, Yaxin Luo, Duomin Wang, Daquan ZhouarXiv 2026 · arXiv

TL;DR

G-STAR introduces a "spatial–group co-scaling" principle that allows autoregressive image models to use extreme spatial compression (up to $64\times$) without losing representation quality. By combining this with a novel semi-autoregressive decoder, the authors achieve a $20\times$ speedup over prior state-of-the-art discrete models, generating $1024 \times 1024$ images in just 2.5 seconds.

What Problem Does This Paper Address?

Autoregressive (AR) models, which generate images token-by-token like a Large Language Model (LLM), have shown incredible promise for high-quality, unified visual generation and understanding. However, they suffer from a "speed vs. quality" bottleneck.

To get high-quality images, you typically need long token sequences (low compression), which makes generation painfully slow because tokens are produced one after another. If you try to speed things up by using aggressive spatial compression (e.g., $32\times$ or $64\times$ downsampling), the "capacity" of each token becomes too small to represent fine details, leading to blurry or distorted results. Most current models settle for a $16\times$ compression "sweet spot," which still results in high latency at high resolutions.

Methods

The authors propose G-STAR (Group-Scaled Token Apacity for Responsive generation), which relies on two primary innovations:

  1. Spatial–Group Co-scaling: The authors derive a scaling law based on product quantization: if you increase the per-axis spatial compression factor by $\alpha$, you must increase the number of discrete codes per spatial position (the "group size" $G$) by $\alpha^2$ to maintain the same information budget. This allows them to move from standard $16\times$ compression to $32\times$ and even an effective $64\times$ compression via "lossless packing" of $2 \times 2$ neighborhoods.

    The co-scaling principle allows for fewer global steps by increasing the information capacity per step.
  2. Semi-Autoregressive (Semi-AR) Decoder: Predicting multiple codes per spatial position (a "group") introduces dependencies. A fully causal head (predicting codes one-by-one) is slow, while a fully parallel head can lead to "multi-modal collision," where the model picks incompatible features for the same spot. The Semi-AR head uses a parallel trunk for heavy feature computation and a lightweight, single-layer causal Transformer to model dependencies, offering the speed of parallel heads with the quality of causal ones.

    Comparison of intra-group prediction heads showing the efficiency of the Semi-AR approach.

Datasets

The models were trained on a massive scale using:

  • Pretraining: Publicly available image-text pairs from LAION, DataComp, and JourneyDB, with captions refined by Qwen3.5.
  • Supervised Fine-Tuning (SFT): A high-quality subset of the above, supplemented with synthetic images from Seedream and Nano Banana 2.
  • Evaluation: A suite of five benchmarks: GenEval (compositional alignment), DPG-Bench (perceptual quality), PRISM (reasoning), LongText-Bench (text rendering), and Qwen-Image-Bench (general capability). Image editing was tested on GEdit-Bench.

Key Insights and Ideas

  • The $\alpha^2$ Rule: The most significant "aha moment" is that spatial compression shouldn't be viewed in isolation. By scaling the "depth" of the codebook quadratically with the spatial compression factor, you can dramatically shorten the sequence length (and thus the number of AR steps) without losing the "nominal bit budget" of the image.
  • Capacity vs. Convergence: Interestingly, larger groups provide a richer representational space but are harder to learn initially. As shown in Figure 4, models with larger groups ($G=16$) converge more slowly at the start of training but eventually outperform smaller groups ($G=8$) as they learn to exploit the extra capacity.
  • Discrete is Sufficient: The paper demonstrates that a well-designed discrete tokenizer can match the multimodal understanding performance of continuous features (like those from a standard ViT), debunking the idea that discretization inherently ruins semantic information.

Key Results

  • Extreme Speedup: At $1024 \times 1024$ resolution, G-STAR delivers a $20\times$ speedup over prior discrete AR models. The GSTAR-Flash-1.7B model generates an image in 2.5 seconds on a single NVIDIA H200.
  • Competitive Quality: Despite the massive compression, GSTAR-Pro-8B achieves scores competitive with much larger models like Emu3.5 (34B) and GLM-Image (16B) across major benchmarks.
  • Efficiency Breakdown: The speedup isn't just from the architecture. The authors show a cumulative $8.9\times$ improvement through a combination of the Semi-AR head, CUDA graph capture, kernel fusion, and SGLang serving.
Quality vs. latency comparison showing G-STAR models achieving high quality at significantly lower latency.

Limitations and Future Work

  • Training Dynamics: The slower early-stage convergence for high-capacity tokens means these models require more compute upfront to "unlock" their potential.
  • Scaling Limits: While $64\times$ compression works well, there is likely a point of diminishing returns where the spatial resolution becomes too coarse for the decoder to reconstruct fine textures, even with high per-token capacity.
  • Future Directions: The authors suggest that even larger backbone models might benefit more from this increased per-step capacity, potentially leading to even better text-to-image alignment and reasoning.

Summary updated

Abstract

Discrete autoregressive models offer a scalable framework for image generation. However, they face a fundamental trade-off: long token sequences preserve representation quality but slow generation, while aggressive spatial compression reduces representation capacity. Based on product quantization, we show that, under a fixed nominal information budget, group size should scale quadratically with the per-axis spatial compression factor. Building on this principle, we propose GSTAR, a spatial--group co-scaling framework that enables \(32\times\) and even effective \(64\times\) compression while preserving strong reconstruction, understanding, and generation performance. Since larger groups introduce intra-group dependencies that must be modeled efficiently, we analyze their impact on inference latency and generation quality and introduce a semi-autoregressive decoder that combines parallel feature computation with lightweight causal modeling. With these designs, our highly compressed models perform competitively with leading models across five representative text-to-image benchmarks (GenEval, DPG-Bench, PRISM, LongText-Bench, and Qwen-Image-Bench). At \(1024\times1024\) resolution, our model delivers a \(20\times\) speedup over prior discrete autoregressive models, generating each image in 2.5 seconds on a single NVIDIA H200. Together, these results show that highly compressed discrete representations can enable high-quality autoregressive generation at low latency.
BibTeX
@misc{huang2026g,
  author = {Xu Huang and Ye Huang and Xiaotong Li and Zhengrong Yue and Jialv Zou and Minhao Jing and Haodong Li and Wenhao Yan and Yaxin Luo and Duomin Wang and Daquan Zhou},
  title = {{G-STAR: Group-Scaled Token Capacity for Deeply Compressed Autoregressive Generation}},
  year = {2026},
  eprint = {2611.13004},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.13004},
}
Figure