Auto-regressive frameworks for next-scale prediction of 2D images have demonstrated strong potential for producing diverse and sophisticated content by progressively refining a coarse input. However, extending this paradigm to 3D object generation remains largely unexplored. In this paper, we introduce auto-regressive Gaussian splatting (ARGS), a framework for making next-scale predictions in parallel for generation according to levels of detail. We propose a Gaussian simplification strategy and reverse the simplification to guide next-scale generation. Benefiting from the use of hierarchical trees, the generation process requires only O(logn) steps, where n is the number of points. Furthermore, we propose a tree-based transformer to predict the tree structure auto-regressively, allowing leaf nodes to attend to their internal ancestors to enhance structural consistency. Extensive experiments demonstrate that our approach effectively generates multi-scale Gaussian representations with controllable levels of detail, visual fidelity, and a manageable time consumption budget.
Figures & tables
Figure 2: A sample of our simplification process. From left to right and top to bottom, we visualize how a Gaussian Splatting object is progressively downsampled to a single point.
Figure 3: Comparison of autoregressive generation steps. Numbers on the top right indicate the number of Gaussian points. Top: Vanilla autoregressive (AR) models predict one token at a time; therefore, generating n points requires n−1 sequential steps. Bottom: Our hierarchical AR model predicts the next level in a spatial hierarchy, where each level expansion generates multiple points in parallel. This hierarchical formulation reduces the generation complexity from linear to logarithmic, requiring only logn steps.
Figure 4: Hierarchical Spatial Structure. Left: The simplification process merges node pairs iteratively to form higher-level nodes; independent pairs can be merged in parallel. Middle: The binary tree view reverses the simplification process, reconstructing the hierarchy from the root and removing duplicate nodes to obtain level-wise data. Right: The hierarchical spatial tree representation stores only the leaf nodes at each level, discarding internal nodes that have already been split.
Figure 5: Attention Mask. Left : The causal attention mask. It depends on a sorted sequence and generates tokens sequentially, requiring n steps in total. Middle : The level-wise attention mask. It attends only to the leaf nodes within each level, reducing the generation complexity to logn steps. Right : The tree-based attention mask. It extends level-wise attention by also considering internal nodes from previous levels, allowing token generation within logn steps. The rightmost panel illustrates how many tokens are required to decode each level of detail.
Figure 6: Method. Starting from a root node r , the decoder-only transformer predicts whether each node should be split and generates its corresponding child nodes. The process continues recursively until all nodes become leaf nodes. The model is trained using cross-entropy loss between the predicted and ground-truth nodes.
Figure 7: Level-wise reconstruction quality (GT vs. Infer). Higher is better for SSIM/PSNR; lower is better for LPIPS. Curves start from Level 1.
Figure 8: Quality of Simplification Method. We evaluate the quality of the simplified data by comparing it to the ground truth using PSNR, SSIM, and LPIPS. We also report the 60% and 90% data distribution to highlight overall trends.
Level
Infer
GT
Δ (Infer - GT)
PSNR
SSIM
LPIPS
PSNR
SSIM
LPIPS
Δ PSNR
Δ SSIM
Δ LPIPS
1
16.37
0.9284
0.2548
16.45
0.9291
0.2574
-0.08
-0.0007
-0.0026
2
18.00
0.9228
0.3088
18.01
0.9230
0.3111
-0.01
-0.0002
-0.0022
3
17.62
0.9092
0.2705
17.60
0.9082
0.2688
+0.02
0.0010
+0.0017
4
17.99
0.9083
0.2887
18.02
0.9080
0.2873
-0.03
+0.0003
+0.0014
5
18.13
0.8900
0.2302
17.89
0.8899
0.2300
+0.24
+0.0001
+0.0002
Table 1: Comparison between inference results and ground-truth reconstruction across hierarchy levels of one single object “bird”.
Figure 9: Progressive generation within a single category. Starting from an initial point, the model progressively synthesizes the Gaussian Splatting representation. We visualize intermediate results at steps 2, 4, 7, 9, and 11.
Figure 10: unconditional generation of in domain airplanes
Figure 11: Progressive scene representation from different LoD by our method.
Most recent advances in 3D generative modeling rely on diffusion or flow-matching formulations. We instead explore a fully autoregressive alternative and introduce GaussianGPT, a transformer-based model that directly generates 3D Gaussians via next-token prediction, thus facilitating full 3D scene generation. We first compress Gaussian primitives into a discrete latent grid using a sparse 3D convolutional autoencoder with vector quantization. The resulting tokens are serialized and modeled using a causal transformer with 3D rotary positional embedding, enabling sequential generation of spatial structure and appearance. Unlike diffusion-based methods that refine scenes holistically, our formulation constructs scenes step-by-step, naturally supporting completion, outpainting, controllable sampling via temperature, and flexible generation horizons. This formulation leverages the compositional inductive biases and scalability of autoregressive modeling while operating on explicit representations compatible with modern neural rendering pipelines, positioning autoregressive transformers as a complementary paradigm for controllable and context-aware 3D generation.
Nicolas von Lützow, Barbara Rössle, Katharina Schmid +1
Recent advances in 3D content generation from text or images have achieved impressive results, yet view inconsistency from 2D generators and the scarcity of high-quality 3D data remain significant bottlenecks. Existing solutions typically adapt large-scale pre-trained text-to-image latent diffusion models to generate 3D Gaussian Splats (3DGS). However, these approaches often rely on training complex cascade pipelines that are computationally expensive and scalability-limited. Most critically, the quality of generated 3D assets is inherently constrained by each component capacity and compressed latent space, leading to decoding artifacts and accumulated errors. To address these limitations, we propose PixGS, a single-stage pipeline for direct high-quality 3DGS generation, which leverages recent advances in pixel-space diffusion to bypass lossy latent compression while still benefiting from the vast 2D generative priors. By directly denoising 3D Gaussian attributes at each timestep, our method enables precise, splat-level regularization of both appearance and geometry. Furthermore, we introduce a comprehensive supervision strategy that incorporates surface normals, depth, and high-frequency structural information, which is often overlooked in prior works. Experiments demonstrate that PixGS outperforms current state-of-the-art methods while maintaining a fast inference speed (1s on a single A100 GPU), offering a robust and efficient alternative to multi-stage generation pipelines.
Part-aware 3D object generation is essential for graphics applications such as controllable modeling, editing, and articulation, where objects are represented as coherent assemblies of semantic parts. However, existing part-aware generation methods, do not scale well to highly complex objects. As the number of parts increases, generating detailed geometry becomes prohibitively expensive in token length and memory. We introduce MegaParts, a scalable autoregressive 3D generation framework to address this challenge by combining structured sequence modeling with a token-efficient vector-quantized shape tokenizer. Our tokenizer learns discrete latent representations for part-level geometry by minimizing token usage subject to high-fidelity reconstruction, enabling adaptive-length tokenization based on geometric complexity. On top of this compact representation, we train a large language model to generate object bounding boxes, part bounding boxes, and part shape tokens within a unified structured sequence. Combined with efficient long-context training strategy, our token-efficient formulation scales to objects with up to 300 parts and sequence lengths up to 256k tokens. This substantially extends the scale of part-aware 3D generation while preserving compositional structure and enabling fine-grained part-level control. Our method achieves higher mesh quality than baseline autoregressive and diffusion models, showing that compressed discrete part tokens improve not only scalability but also the achievable fidelity of generated geometry. These results suggest that LLM native token-efficient autoregressive modeling is a compelling alternative to diffusion for large-scale part-aware 3D generation. The project page is available at https://expmaster.github.io/megaparts_webpage.
Manwen Liao, Xinyu Lian, Jian Mao +11
The University of Hong Kong · Shanghai Artificial Intelligence Laboratory · Fudan University +5