Visual Autoregressive Models Beat Diffusion Models on Inference Time Scaling
Erik Riise, Mehmet Onurcan Kaya, Dim P. Papadopoulos
TL;DR
This work demonstrates that inference-time searching is more effective for discrete visual autoregressive models than for continuous diffusion models. By leveraging Infinity's next-scale prediction across 13 scales and applying beam search guided by diverse verifiers (ImageReward, CLIPScore, Aesthetic Score, and LLaVA-OneVision), a 2B parameter model can surpass a 12B diffusion model on standard benchmarks while using far fewer function evaluations. The results show strong gains on DrawBench and compositional benchmarks, and a direct comparison with diffusion models confirms the architectural suitability of discrete search for image generation. The study highlights that architecture, not just scale, governs efficiency and quality in inference-time image synthesis, suggesting that co-design of models and search strategies is a fruitful direction for practical, scalable visual generation.
Abstract
While inference-time scaling through search has revolutionized Large Language Models, translating these gains to image generation has proven difficult. Recent attempts to apply search strategies to continuous diffusion models show limited benefits, with simple random sampling often performing best. We demonstrate that the discrete, sequential nature of visual autoregressive models enables effective search for image generation. We show that beam search substantially improves text-to-image generation, enabling a 2B parameter autoregressive model to outperform a 12B parameter diffusion model across benchmarks. Systematic ablations show that this advantage comes from the discrete token space, which allows early pruning and computational reuse, and our verifier analysis highlights trade-offs between speed and reasoning capability. These findings suggest that model architecture, not just scale, is critical for inference-time optimization in visual generation.
