Unlocking Any-Order Generation in Pretrained Autoregressive Image Models

Hugging Face Daily Papers Papers

Summary

该论文提出了一种将预训练的栅格扫描自回归图像模型转换为任意顺序生成器的方法,通过未来感知位置嵌入和顺序课程学习,以极低的额外计算开销实现图像补全、外扩和编辑,同时保持与标准AR推理生态的兼容性。

Autoregressive (AR) image generators are powerful in principle but inflexible in practice: training with a fixed raster-scan order hardcodes a single factorization of the image distribution into the model, leaving it unable to inpaint, outpaint, or edit at inference time. Existing solutions, including the modern discrete-diffusion family, train from scratch on a mixture of token orderings, paying roughly 3x the compute of standard raster-scan training; discrete diffusion further sacrifices compatibility with the AR inference ecosystem (KV caching, vLLM) by construction. We argue that this cost is unnecessary. A pretrained raster-scan AR model has already learned the joint distribution over image tokens; what it lacks is not knowledge but the ability to express that knowledge through non-sequential conditional pathways. We propose a recipe for adapting pretrained raster-scan models into any-order generators using two components: future-aware positional embeddings that resolve a target-position identifiability problem at negligible overhead, and an ordering curriculum that traces a stable optimization path from the pretrained solution to a good any-order basin. Applied to four base models across two architectures and two scales (LlamaGen-L/XL, RAR-L/XL), the recipe substantially outperforms MaskGIT on ImageNet inpainting (FID 6.21 vs. 10.44) and outpainting, is competitive with MAR-L, trades a 1.2-1.9 increase in class-conditional FID for this flexibility, and costs 13-33% additional compute beyond pretraining, while leaving the standard AR inference stack untouched. Inpainting, outpainting, and editing, our results suggest, need not be added to autoregressive image models. They can be unlocked from the ones that exist. Code is available at https://github.com/Ordered-AR/unlockedadaptation.
Original Article
View Cached Full Text

Cached at: 10/30/26, 07:12 PM

Paper page - Unlocking Any-Order Generation in Pretrained Autoregressive Image Models

Source: https://huggingface.co/papers/2610.39293

Abstract

Pretrained raster-scan autoregressive image models can be adapted into flexible any-order generators via future-aware positional embeddings and an ordering curriculum, enabling inpainting and outpainting with minimal extra compute.

Autoregressive (AR) image generators are powerful in principle but inflexible in practice: training with a fixed raster-scan order hardcodes a single factorization of the image distribution into the model, leaving it unable to inpaint, outpaint, or edit at inference time. Existing solutions, including the modern discrete-diffusion family, train from scratch on a mixture of token orderings, paying roughly 3x the compute of standard raster-scan training;discrete diffusionfurther sacrifices compatibility with the AR inference ecosystem (KV caching,vLLM) by construction. We argue that this cost is unnecessary. A pretrained raster-scan AR model has already learned the joint distribution over image tokens; what it lacks is not knowledge but the ability to express that knowledge through non-sequential conditional pathways. We propose a recipe for adapting pretrained raster-scan models into any-order generators using two components:future-aware positional embeddingsthat resolve a target-position identifiability problem at negligible overhead, and anordering curriculumthat traces a stable optimization path from the pretrained solution to a good any-order basin. Applied to four base models across two architectures and two scales (LlamaGen-L/XL,RAR-L/XL), the recipe substantially outperformsMaskGITon ImageNet inpainting (FID 6.21 vs. 10.44) and outpainting, is competitive withMAR-L, trades a 1.2-1.9 increase in class-conditional FID for this flexibility, and costs 13-33% additional compute beyond pretraining, while leaving the standard AR inference stack untouched. Inpainting, outpainting, and editing, our results suggest, need not be added to autoregressive image models. They can be unlocked from the ones that exist. Code is available at https://github.com/Ordered-AR/unlockedadaptation.

View arXiv pageView PDFGitHub0Add to collection

Get this paper in your agent:

hf papers read 2610\.39293

Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash

Models citing this paper0

No model linking this paper

Cite arxiv.org/abs/2610.39293 in a model README.md to link it from this page.

Datasets citing this paper0

No dataset linking this paper

Cite arxiv.org/abs/2610.39293 in a dataset README.md to link it from this page.

Spaces citing this paper0

No Space linking this paper

Cite arxiv.org/abs/2610.39293 in a Space README.md to link it from this page.

Collections including this paper0

No Collection including this paper

Add this paper to acollectionto link it from this page.

Similar Articles

GEAR: Guided End-to-End AutoRegression for Image Synthesis

Hugging Face Daily Papers

GEAR proposes a method to jointly train a vector-quantized tokenizer and autoregressive generator end-to-end via representation alignment, achieving up to 10x faster convergence on ImageNet gFID compared to strong baselines.

APT: Feedback-Driven Agentic Post-Training for Text-to-Image Generation

Hugging Face Daily Papers

论文提出APT(Agentic Post-Training),一个全自动化的文生图后训练框架,通过三个智能体协同构建评测集、诊断模型强弱项并生成自适应强化学习数据,形成递归自我改进式的反馈循环,实验证明其在模型、基准和架构上均具有通用性。

Few-Step Generation via Data-Space Iteration

Hugging Face Daily Papers

本文提出 data-space iteration 框架,将少步生成的迭代过程从概率流空间移至数据空间,从而完全移除对流离散化时间表的依赖,并在 ImageNet 256x256 类条件生成上以最小改动集成 DMD,超越了需要手动调参时间表的基线方法。

Know, then Draw: A New Learning Paradigm for Visual Generation

Hugging Face Daily Papers

提出「先知后画」的混合学习范式,用自回归预训练获取语义知识、扩散后训练进行高保真渲染,并建立计算最优扩展律,仅用6,600 H100 GPU小时训出3B文生图模型,在GenEval和DPG-Bench上取得86/87的成绩。