Papers › Improving Autoregressive Visual Generation with Cluster-Oriented Token Prediction

Improving Autoregressive Visual Generation with Cluster-Oriented Token Prediction

1 Jan 2025CVPR 2025 1arXiv:2501.00880archive 2025-07-28

Teng Hu, Jiangning Zhang, Ran Yi, Jieyu Weng, Yabiao Wang, Xianfang Zeng, Zhucun Xue, Lizhuang Ma

Employing LLMs for visual generation has recently become a research focus. However, the existing methods primarily transfer the LLM architecture to visual generation but rarely investigate the fundamental differences between language and vision. This oversight may lead to suboptimal utilization of visual generation capabilities within the LLM framework. In this paper, we explore the characteristics of visual embedding space under the LLM framework and discover that the correlation between visual embeddings can help achieve more stable and robust generation results. We present IAR, an Improved AutoRegressive Visual Generation Method that enhances the training efficiency and generation quality of LLM-based visual generation models. Firstly, we propose a Codebook Rearrangement strategy that uses balanced k-means clustering algorithm to rearrange the visual codebook into clusters, ensuring high similarity among visual features within each cluster. Leveraging the rearranged codebook, we propose a Cluster-oriented Cross-entropy Loss that guides the model to correctly predict the cluster where the token is located. This approach ensures that even if the model predicts the wrong token index, there is a high probability the predicted token is located in the correct cluster, which significantly enhances the generation quality and robustness. Extensive experiments demonstrate that our method consistently enhances the model training efficiency and performance from 100M to 1.4B, reducing the training time by half while achieving the same FID. Additionally, our approach can be applied to various LLM-based visual generation models and adheres to the scaling law, providing a promising direction for future research in LLM-based visual generation.

PaperPDFConference PDFCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2501.00880")

Code

Syntology Ran 6 of 8 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 6 ran with no contract checked.

By repository: found in paper text by Syntology: 8 samples from 1 repository, 6 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

sjtuplayer/IAR found in paper text by Syntology report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested; 6 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

6ran
2unverified

Licence: 8 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from sjtuplayer/IAR. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

Attention sjtuplayer/IAR/autoregressive/models/gpt.py found in paper text by Syntology ran no licence file found · pointer only · 6f2102734f185e9f · report
CaptionEmbedder sjtuplayer/IAR/autoregressive/models/gpt.py found in paper text by Syntology ran no licence file found · pointer only · a95da8af9932c3df · report
FeedForward sjtuplayer/IAR/autoregressive/models/gpt.py found in paper text by Syntology ran no licence file found · pointer only · 0266f2bd1a7c84d4 · report
LabelEmbedder sjtuplayer/IAR/autoregressive/models/gpt.py found in paper text by Syntology ran no licence file found · pointer only · 5cdccc4f721bbecd · report
MLP sjtuplayer/IAR/autoregressive/models/gpt.py found in paper text by Syntology ran no licence file found · pointer only · 553e64473745e011 · report
ModelArgs sjtuplayer/IAR/autoregressive/models/gpt.py found in paper text by Syntology ran no licence file found · pointer only · 7e3bfcbaeb7daf19 · report
Transformer sjtuplayer/IAR/autoregressive/models/gpt.py found in paper text by Syntology unverified no licence file found · pointer only · c93a2120748f0cc8 · report
TransformerBlock sjtuplayer/IAR/autoregressive/models/gpt.py found in paper text by Syntology unverified no licence file found · pointer only · f03b5731f02b2a1e · report

Tasks

Prediction

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

k-Means Clustering

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections