End-to-End Autoregressive Image Generation with 1D Semantic Tokenizer
This paper proposes an end-to-end training pipeline that jointly optimizes a 1D semantic tokenizer and an autoregressive generative model, achieving state-of-the-art image generation performance with an FID of 1.48 on ImageNet 256x256.
Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
Imagine you want to teach a computer to draw pictures by describing them word-by-word, like a storyteller. This is called autoregressive generation. The computer guesses the next "word" (or in this case, a visual piece) based on the ones before it.
However, there's a big problem with how computers usually do this.
The Problem: The "Grid" vs. The "Story"
Most image-making computers break a picture into a 2D grid (like a chessboard). They try to describe the picture by reading this grid row-by-row, like reading a book.
- The Issue: In a grid, the piece at the top-right corner depends on the piece at the bottom-left. But in a story (a 1D list), you can't talk about the end of the story before you've told the beginning. This mismatch makes the computer confused and the pictures look messy.
Previous attempts tried to fix this by either:
- Changing the story order: Forcing the computer to read the grid in weird, random orders (like reading a book backwards or jumping around).
- Flattening the grid: Crushing the 2D picture into a single long line of data. But often, this crushed the picture so hard that the details were lost, or the computer couldn't learn to draw them well.
The Solution: EOSTok (The "End-to-End" Team)
The authors of this paper created a new system called EOSTok. Think of it as a team of two workers who learn together, rather than one training the other.
1. The Two Workers
- Worker A (The Tokenizer): This is the "compressor." It takes a high-definition photo and squishes it down into a short, 1D list of "tokens" (like a secret code).
- Worker B (The Generator): This is the "storyteller." It looks at the secret code and tries to predict the next token in the list to recreate the image.
2. The Old Way (The "Two-Stage" Mistake)
In the past, these workers trained separately:
- Stage 1: Worker A was trained only to squish the picture perfectly. Once it was done, it was frozen (locked in place).
- Stage 2: Worker B was trained to predict the tokens.
- The Flaw: Worker A didn't know that Worker B was going to be the one using the tokens. So, Worker A might have created a code that was great for saving space but terrible for predicting the next step. It was like a translator writing a book in a language that the next translator couldn't understand.
3. The New Way (End-to-End Training)
EOSTok trains both workers at the same time.
- The Feedback Loop: If Worker B (the storyteller) makes a mistake, the error signal travels all the way back to Worker A. Worker A learns: "Oh, I need to change my secret code slightly so Worker B can predict the next part easier."
- The Result: They evolve together. Worker A learns to create a code that is not just a good compression, but a code that is easy to predict.
The Secret Sauce: Three Tricks
To make this work perfectly, the authors added three special ingredients:
1. The "Pixel-Check" (APR Loss)
Usually, the computer only checks if the "next token" prediction is right. But sometimes, the computer gets really good at guessing tokens but produces a blurry, ugly picture in the end.
- The Fix: The system takes the computer's guess of the next token, turns it back into a picture, and checks if that picture looks like the real one. This forces the computer to care about the final image quality, not just the token guessing game.
2. The "Smart Teacher" (Vision Foundation Models)
The authors brought in a "Smart Teacher" (a pre-trained AI that already knows what objects look like).
- The Trap: If you force the 1D list to look exactly like the Teacher's 2D map, you lose the benefit of the 1D list (it becomes a grid again).
- The Fix: They used a method called "Implicit Alignment." Instead of forcing the 1D list to copy the Teacher's map, they just made sure the hidden understanding inside the system matched the Teacher's knowledge. It's like letting a student learn the concepts from a teacher without forcing them to copy the teacher's handwriting. This keeps the 1D flow smooth but makes the content much smarter.
3. The "Codebook" Balance
The system uses a dictionary (codebook) of visual tokens.
- If the dictionary is too small, the pictures look blocky.
- If the dictionary is too huge, the computer gets confused trying to pick the right word.
- The authors found that by making the computer bigger (more powerful), it could handle a bigger dictionary without getting confused, solving the trade-off between detail and predictability.
The Results
The paper claims that this new method is a huge success.
- On a standard test (ImageNet 256x256), their model achieved a score of 1.48 (lower is better).
- This is a State-of-the-Art result, meaning it is currently the best in the world for this specific type of image generation without using extra guidance tricks.
- The model works better as it gets bigger (scaling up), proving the system is robust.
In short: EOSTok is a new way to teach computers to draw by having the "compressor" and the "predictor" learn together, checking their work against real pixels, and using a smart teacher to guide them without forcing them into a rigid grid. The result is a computer that can generate incredibly realistic images by simply predicting the next piece of a puzzle.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.