REVIEW 4 cited by
Neighboring Autoregressive Modeling for Efficient Visual Generation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Neighboring Autoregressive Modeling for Efficient Visual Generation
abstract
Visual autoregressive models typically adhere to a raster-order ``next-token prediction" paradigm, which overlooks the spatial and temporal locality inherent in visual content. Specifically, visual tokens exhibit significantly stronger correlations with their spatially or temporally adjacent tokens compared to those that are distant. In this paper, we propose Neighboring Autoregressive Modeling (NAR), a novel paradigm that formulates autoregressive visual generation as a progressive outpainting procedure, following a near-to-far ``next-neighbor prediction" mechanism. Starting from an initial token, the remaining tokens are decoded in ascending order of their Manhattan distance from the initial token in the spatial-temporal space, progressively expanding the boundary of the decoded region. To enable parallel prediction of multiple adjacent tokens in the spatial-temporal space, we introduce a set of dimension-oriented decoding heads, each predicting the next token along a mutually orthogonal dimension. During inference, all tokens adjacent to the decoded tokens are processed in parallel, substantially reducing the model forward steps for generation. Experiments on ImageNet$256\times 256$ and UCF101 demonstrate that NAR achieves 2.4$\times$ and 8.6$\times$ higher throughput respectively, while obtaining superior FID/FVD scores for both image and video generation tasks compared to the PAR-4X approach. When evaluating on text-to-image generation benchmark GenEval, NAR with 0.8B parameters outperforms Chameleon-7B while using merely 0.4 of the training data. Code is available at https://github.com/ThisisBillhe/NAR.
Forward citations
Cited by 4 Pith papers
-
Context-weighted Discrete Flow Matching
Reweighting discrete-flow-matching updates by local context—via a context-weighted sampler or a scaled cross-entropy loss—improves text and molecular generation, cutting generative perplexity on OpenWebText by up to 63%.
-
Next-Dense-Stride Prediction for Multimodal Autoregressive Visual Modeling
Next-dense-stride prediction enables coarse-to-fine autoregressive image generation on a single-scale grid and unifies multi-contrast MRI translation, generation, and segmentation in one model.
-
Progressive Checkerboards for Autoregressive Multiscale Image Generation
A balanced multiscale checkerboard sampling order for autoregressive image generation allows large scale-up factors without quality loss, because only the total number of serial steps matters.
-
Adaptive Visual Autoregressive Acceleration via Dual-Linkage Entropy Analysis
A training-free entropy-guided token-pruning framework accelerates VAR image generation up to 2.9× with negligible benchmark loss by activating pruning at an adaptive entropy-growth inflection point and adjusting rati...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.