Autoregressive Video Gen

Preface: AR in LLMs

Modern language models turn generation into a sequence of AR predictions. Instead of solving an entire response at once, an AR LLM factorizes it from left to right:

p(y₁:T | x) = ∏ₜ pθ(yₜ | x, y<t)

The causal attention mask is more than a modeling choice. It creates a systems contract: a generated token never depends on future tokens, so completed prefix states remain valid. The server can cache their keys and values, emit output immediately, and advance the sequence without recomputing the whole prefix.

ModelOne-way information flow

Each new token reads the prefix, while the already emitted prefix stays fixed.

StateReusable KV cache

Past attention states become persistent session memory rather than repeated computation.

ServingA persistent decode loop

Streaming, cancellation, batching, and memory management operate at token boundaries.

This AR interface is the hidden reason LLM serving scales as a long-running system rather than a collection of fixed-length batch jobs. AR video generation asks whether video models can expose the same kind of stable boundary—at the level of frames or latent blocks—while retaining the visual quality of diffusion.

1. Why AR video generation matters

Full diffusion is a great clip generator—and a poor streaming primitive

A standard video diffusion transformer receives a noisy latent clip and repeatedly updates the whole clip with bidirectional spatiotemporal attention. This is a powerful inductive bias for a fixed-duration sample: every frame may use evidence from both past and future, and the model can repair globally inconsistent motion over multiple denoising iterations.

But the same coupling creates three deployment problems. First, the model cannot emit the beginning of the video while the future is still unresolved. Second, extending the duration increases the token set processed at every denoising step. Third, a prompt change in the middle of generation has no natural boundary: the sampler was designed to solve one global clip, not to maintain a live session.

AR diffusion factorizes time into frames or blocks:

p(x₁:T | c) = ∏ₖ pθ(x[Bₖ] | x[<Bₖ], c),    with a small diffusion/flow solver inside each block Bₖ

This factorization introduces a sequential dependency across blocks, but it also creates a reusable boundary. Once block k is clean, it can be streamed to the user and summarized into a KV cache while block k+1 is denoised. The active working set can be bounded with a rolling window, and the prompt can be updated between blocks.

Full-sequence diffusion compared with AR diffusion Full diffusion repeatedly updates an entire bidirectional clip. AR diffusion emits blocks sequentially and reuses a bounded KV cache. Full-sequence diffusion AR diffusion Bidirectional clip, repeated global updates AR blocks, streaming updates Every step revisits every frame No frame is final until the clip is final emit denoise next rolling KV cache Bounded state; output appears block by block
Figure 1. The architectural trade: full diffusion buys global bidirectional repair, while AR diffusion buys a streaming boundary, reusable state, and bounded memory. Few-step distillation is what makes each new block cheap enough to serve.

The wall-clock gap: bidirectional diffusion vs causal streaming

For a concrete long-video comparison, the LongLive paper uses SkyReels-V2. SkyReels-V2 is a Diffusion-Forcing system rather than a vanilla full-clip sampler, but its bidirectional attention preserves the same serving bottleneck: completed history cannot be reused as a KV cache under AR decoding. On a single H100, the reported gap for producing a 60-second video is:

Same prompt, same 60-second sequence. 0–10 s: “In a warmly lit home office, a bearded Asian man types intently on a laptop. An orange tabby cat sits beside him.”
Full / bidirectional diffusion SkyReels-V2
Computing the complete video before anything can be shown…
Generation progress0%
Video becomes available only after generation reaches 100%.
Causal video LongLive
Generating the first AR block…
Generation progress0%
Playback starts after the first block, while the rest is still being generated.

Timeline compressed for illustration. Videos and reported throughput come from the official LongLive 1.0 comparison.

Figure 2. Full bidirectional generation exposes the result only after the whole sequence is ready. A causal model creates an output boundary after each block, so playback can begin while generation continues.

The gap cannot be attributed to distillation alone. Once past blocks become reusable state, LongLive no longer revisits the entire video prefix at every update. The comparison is not a controlled AR-versus-bidirectional ablation—resolution, kernels, and end-to-end accounting differ—but it makes the systems point visible: few-step distillation shrinks the inner solver; AR execution removes repeated work around that solver.

The ≈46-second LongLive value is derived from the paper's native 16-FPS output and 20.7 generated FPS: 60 × 16 ÷ 20.7 ≈ 46 seconds. See the LongLive comparison page.

LatencyStreaming output

Time-to-first-frame becomes one block rather than one full clip.

LengthOpen-ended rollout

A rolling context turns duration into a loop instead of a fixed tensor shape.

ControlInteractive prompts

Text or actions can change at block boundaries while the session remains alive.

The catch is equally important: AR generation conditions on its own past. A small error becomes context for the next block, and causal attention removes the future information that helped a bidirectional model repair a clip. It is therefore useful to separate two questions:

AR does not imply few-step generation, and distillation is not the definition of an AR model. Distillation is one practical route for converting a strong bidirectional model into an AR student while reducing the number of DiT evaluations; Section 4 returns to that distinction.

2. AR video generation reuses LLM inference infrastructure

Once video generation is expressed as a persistent AR decode loop, much of the LLM serving playbook becomes relevant. The transferable idea is not “video is just text.” It is that both workloads expose an immutable prefix, reusable per-session state, an incremental output boundary, and a scheduler that repeatedly advances active requests.

Static comparison of LLM and AR-video serving loops LLMs and AR video share session state, cache management, scheduling, quantization, streaming, and cancellation, while video inserts a few-step diffusion block and VAE decoding. A familiar serving loop, with a diffusion inner step The systems contract transfers; the video kernels and scheduling constraints do not disappear LLM prompt / prefix AR decoder KV cache token stream AR video prompt / action session control few-step DiT next block rolling KV bounded window async VAE decode block k frame stream emit / cancel Reusable serving layer session state cache manager request scheduler quantized memory stream + cancel
Figure 3. AR video can reuse the control plane of LLM serving—persistent sessions, cache lifetime, scheduling, streaming, and cancellation—while adding a few-step diffusion inner loop and VAE pipeline.

How AR video makes KV reuse possible

At every self-attention layer, a completed video block produces keys and values that summarize how later blocks may attend to it. With a causal attention mask, block k cannot change the hidden states of blocks < k. Their K/V tensors therefore become immutable session state: every denoising evaluation for the next block reads the same history instead of projecting the entire prefix again. A bidirectional diffusion model does not expose this boundary—the representation of an earlier frame can change when future noisy tokens change—so its old K/V is generally stale after the next global update.

MKV ≈ 2 × L × Ncached × HKV × dhead × bytes

The factor of two stores both keys and values. Video makes this state unusually expensive because every temporal block contains many spatial latent tokens: increasing duration grows Ncached by far more than one token per frame. KV reuse removes projection compute, but a practical system also needs an explicit policy for when cached state is committed, quantized, evicted, or rebuilt.

1Read history

All denoising steps read the same committed K/V from clean AR blocks.

2Denoise active block

The current block changes with noise level, so its step-local K/V remains transient.

3Commit once

After the block becomes clean, append its reusable K/V and expose the block to the VAE.

4Bound the cache

Evict stale window entries while preserving the sink and recent context.

Cached stateWhen it is validLifecycle
Historical self-attention K/VCompleted AR blocks whose positions and conditioning remain valid.Read at every denoising step; append after a clean block; evict with the window policy.
Text cross-attention K/VWhile the prompt and conditioning branch remain unchanged.Compute once per prompt; rebuild on a prompt switch and keep separate state for distinct guidance branches.
Active-block K/VOnly for the current denoising evaluation because the latent changes across noise levels.Recompute inside the few-step solver; do not make it permanent until the block is finalized.

Long video needs a cache policy, not an ever-growing cache

Keeping every historical token makes KV memory grow linearly with duration. A sink-plus-window layout changes the live state from the full history O(T) to a fixed set of S sink blocks plus W recent blocks, or O(S + W). The recent window preserves motion continuity; the sink carries a compact long-range anchor such as identity, composition, or the beginning of a shot. The price is lossy history: a window that is too short saves memory and attention work but can forget details that no sink represents.

LongLive 1.0 demonstrates this trade-off with short-window attention plus a frame sink. LongLive-2.0 makes the policy shot-aware: a global sink persists as an identity anchor, while a shot-level sink is rebound at scene changes. It also stores the KV cache in NVFP4 and reconstructs cached chunks with parallel dequantization, treating cache bandwidth and capacity as first-class inference bottlenecks.

Stateful sessions

A request owns prompt state, latent history, RNG state, and KV that survive across many output blocks.

Prefix and cache reuse

Clean AR blocks and text cross-attention K/V can be reused; sinks and rolling windows bound long-lived memory.

Continuous scheduling

The server repeatedly advances active sessions, but batching must respect resolution, block shape, and denoising-step compatibility.

Pipeline overlap

DiT compute, VAE decoding, host transfer, and network streaming can run as an overlapped pipeline rather than serial stages.

Do not overstate the analogy. LLM decoding produces one discrete token per forward pass; AR diffusion usually performs several denoising evaluations over a high-dimensional video block. Cache layout, scheduler granularity, VAE latency, and compatibility across noise steps remain video-specific problems.

3. Early attempts in AR training

A video model can become AR in several ways: train an AR architecture from scratch, fine-tune a pretrained model with a causal attention mask and AR objective, or distill a bidirectional teacher into an AR student. Early work favored distillation because the best visual priors already lived inside expensive bidirectional diffusion models.

In this setting, distillation performs two jobs at once: it transfers quality across a change in information flow, and it compresses a many-step diffusion solver into a few-step generator. That makes distillation a practical route to AR generation—not the only definition or implementation of AR training.

CausVid: convert first, then distill

CausVid established a two-stage recipe. It first initializes an AR student from probability-flow ODE trajectories produced by a pretrained teacher. It then uses an asymmetric form of distribution matching distillation (DMD): the generator uses causal attention, while the stronger critic-like teacher remains bidirectional. The result compresses a 50-step teacher into a four-step AR generator and uses KV caching for streaming inference.

DMD is attractive because it asks the student distribution—not every individual sample—to match a target distribution. In practice, the training loop maintains a generator, a real-score model tied to the teacher distribution, and a fake-score model that tracks the student's current distribution. Their score difference pushes samples toward the real distribution.

Self Forcing: train where the model will actually live

AR generation creates exposure bias. Teacher-forced training shows the model clean ground-truth history; inference shows it imperfect self-generated history. Self Forcing makes this mismatch the center of the algorithm: it rolls the student forward with its own KV cache, evaluates those self-generated sequences with a video-level DMD objective, and uses stochastic gradient truncation to keep training tractable.

From CausVid initialization to Self Forcing rollouts CausVid initializes and distills an AR student from a bidirectional teacher. Self Forcing closes the loop by training on the student's own AR rollout. The missing loop: student outputs must become student inputs Bidirectional teacher ODE trajectory + real score AR student 4-step generator Streaming rollout self-generated context Self-Forcing DMD real score − fake score on on-policy video roll out → judge → update
Figure 4. CausVid proves that a bidirectional teacher can bootstrap a fast AR student. Self Forcing makes the rollout distribution itself part of training, directly attacking exposure bias.

This is the first major conceptual shift in the story: few-step quality is not enough; an AR model must be good on the states created by its own previous mistakes. Distillation supplies an efficient starting point, but reliable AR generation ultimately requires training on the student's own prefix distribution.

4. Making it longer

Moving from a five-second demo to a multi-minute stream is not just a larger version of the same task. The failure mode changes. Small color shifts, pose errors, or object substitutions become part of the conditioning context and can compound over hundreds of blocks. Meanwhile, the KV cache grows, old frames lose influence, and a new prompt can conflict with cached states computed under the old prompt.

Although the papers package it differently, LongLive, Rolling Forcing, and Self-Forcing++ share the same move: stop training only on short, clean clips. The student first builds a much longer AR rollout from its own history; training then advances or samples bounded windows along that rollout. This is the practical meaning of streaming long tuning: train-long-test-long without backpropagating through an entire minute at once.

Streaming long tuning on a long self-generated rollout The student generates a long rollout from its own history. A bounded training window moves along that rollout, receives local supervision, updates the student, and then continues. Streaming long tuning: learn locally on a long rollout Train on self-generated history instead of only short, clean clips 1 · long self-rollout the student conditions on its own previous blocks 2 · bounded training window local teacher / distillation loss gradients stay inside the window 3 · update student, then continue the next window sees a longer history Long context is experienced; only a short window carries gradients.
Figure 5. The shared streaming-long-tuning pattern: generate a long on-policy trajectory, optimize a tractable local window, then keep rolling forward. LongLive, Rolling Forcing, and Self-Forcing++ differ mainly in how the window is constructed and supervised.

One long-training idea, three different emphases

LongLive

It pairs streaming long tuning with short-window attention, a frame-level attention sink, and KV recache for persistent memory and prompt changes. The paper reports generation up to 240 seconds on one H100.

Rolling Forcing

Its bounded window is also a mixed-noise joint-denoising window, so nearby future frames can correct one another instead of committing independently.

Self-Forcing++

A short teacher supervises sampled slices from a much longer student rollout, extending the training horizon without requiring a long-video teacher or long-video dataset.

5. Distilling it faster

Few-step models are cheap to run only after they have been distilled. The distillation itself can be unusually expensive. A DMD training step may colocate the trainable generator, a frozen real-score model, and a trainable fake-score model. Long self-rollouts add KV cache and activation memory on top. For large video DiTs, the training bill can become the bottleneck that prevents the fast model from existing.

LongLive-2.0: optimize the whole train-to-serve path

LongLive-2.0 treats precision, parallelism, and the AR objective as one infrastructure problem:

Making DMD training and inference cheaper A baseline DMD setup stores three large models. LongLive 2.0 freezes NVFP4 backbones and trains LoRA, then overlaps few-step DiT inference with VAE decoding. From three full models to a quantized backbone + small update Conventional DMD memory generator + activations real-score model fake-score model LongLive-2.0 DMD path fixed NVFP4 backbone LoRA update quantized score paths reported DMD peak-memory ratio: 0.69× Serving overlap DiT · block k+1 VAE decode · block k stream frames
Figure 6. Training efficiency and inference efficiency are coupled. The same quantized backbone and adapter strategy that makes DMD affordable also prepares the model for W4A4 deployment.

The paper reports up to 2.15× training speedup, 1.84× inference speedup, 45.7 FPS on GB200 for its two-step 5B model, and a 0.69× DMD peak-memory ratio with NVFP4 plus LoRA. These numbers should not be compared directly with CausVid or LongLive-1.0 because model size, hardware, resolution, step count, and end-to-end accounting differ. The durable result is the recipe: distillation precision, adapter scope, cache format, and serving kernel should be designed together.

6. Conclusion

The important shift is larger than making diffusion AR. AR turns video generation into a persistent systems interface: past output becomes stable state, new blocks can be streamed incrementally, control can enter at explicit boundaries, and inference infrastructure can manage the session over time.

Distillation made that transition practical for the first generation of systems. CausVid transferred a strong bidirectional prior into a fast AR student; Self Forcing aligned training with the student's own history; LongLive, Rolling Forcing, and Self-Forcing++ extended that history toward minutes; LongLive-2.0 then made the training and serving path itself part of the design.

What is still unresolved?

The next useful AR video model will not win on step count alone. It will win by aligning temporal factorization, rollout distribution, context horizon, solver budget, and inference infrastructure as one end-to-end loop.

References

Sources checked through June 30, 2026.

  1. Diffusion Forcing: Next-token Prediction Meets Full-Sequence Diffusion. arXiv:2407.01392. Paper
  2. From Slow Bidirectional to Fast Autoregressive Video Diffusion Models (CausVid). CVPR 2025, arXiv:2412.07772. Paper
  3. Self Forcing: Bridging the Train-Test Gap in Autoregressive Video Diffusion. NeurIPS 2025 Spotlight, arXiv:2506.08009. Paper
  4. LongLive: Real-time Interactive Long Video Generation. ICLR 2026, arXiv:2509.22622. Paper
  5. Rolling Forcing: Autoregressive Long Video Diffusion in Real Time. arXiv:2509.25161. Paper
  6. Self-Forcing++: Towards Minute-Scale High-Quality Video Generation. arXiv:2510.02283. Paper
  7. Causal Forcing: Autoregressive Diffusion Distillation Done Right for High-Quality Real-Time Interactive Video Generation. ICML 2026, arXiv:2602.02214. Paper
  8. Context Forcing: Consistent Autoregressive Video Generation with Long Context. arXiv:2602.06028. Paper
  9. Large Scale Diffusion Distillation via Score-Regularized Continuous-Time Consistency (rCM). ICLR 2026, arXiv:2510.08431. Paper
  10. Causal-rCM: A Unified Teacher-Forcing and Self-Forcing Open Recipe for Autoregressive Diffusion Distillation in Streaming Video Generation and Interactive World Models. arXiv:2606.25473. Paper · Open recipe
  11. AnyFlow: Any-Step Video Diffusion Model with On-Policy Flow Map Distillation. arXiv:2605.13724. Paper
  12. One-Forcing: Towards Stable One-Step Autoregressive Video Generation. arXiv:2605.23458. Paper
  13. LongLive-2.0: An NVFP4 Parallel Infrastructure for Long Video Generation. arXiv:2605.18739. Paper · Project · Code