mlsanityData to 7 Oct 2026

PLAD: Learning to Infer Shape Programs with Pseudo-Labels and Approximate Distributions

arXiv 2011.13045 ↗First posted 25 Nov 2020cs.CV cs.GR cs.LGcited by 19

Not on the map. Why?

Abstract (arXiv)

Inferring programs which generate 2D and 3D shapes is important for reverse engineering, editing, and more. Training models to perform this task is complicated because paired (shape, program) data is not readily available for many domains, making exact supervised learning infeasible. However, it is possible to get paired data by compromising the accuracy of either the assigned program labels or the shape distribution. Wake-sleep methods use samples from a generative model of shape programs to approximate the distribution of real shapes. In self-training, shapes are passed through a recognition model, which predicts programs that are treated as "pseudo-labels" for those shapes. Related to these approaches, we introduce a novel self-training variant unique to program inference, where program pseudo-labels are paired with their executed output shapes, avoiding label mismatch at the cost of an approximate shape distribution. We propose to group these regimes under a single conceptual framework, where training is performed with maximum likelihood updates sourced from either Pseudo-Labels or an Approximate Distribution (PLAD). We evaluate these techniques on multiple 2D and 3D shape program inference domains. Compared with policy gradient reinforcement learning, we show that PLAD techniques infer more accurate shape programs and converge significantly faster. Finally, we propose to combine updates from different PLAD methods within the training of a single model, and find that this approach outperforms any individual technique.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Nov 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 4; 2024: 9; 2025: 3; 2026: 2.

19 papers.

Sort:

  1. 2024SceneScript: Reconstructing Scenes With An Autoregressive Structured Language Modelcited by 95
  2. 2024Real2Code: Reconstruct Articulated Objects via Code Generationcited by 64
  3. 2023D2CSG: Unsupervised Learning of Compact CSG Trees with Dual Complements and Dropoutscited by 39
  4. 2024Can Large Language Models Understand Symbolic Graphics Programs?cited by 32
  5. 2023ShapeCoder: Discovering Abstractions for Visual Programs from Unstructured Primitivescited by 22
  6. 2024Design2GarmentCode: Turning Design Concepts to Tangible Garments Through Program Synthesiscited by 17
  7. 2025MeshCoder: LLM-Powered Structured Mesh Code Generation from Point Cloudscited by 15
  8. 2022From Perception to Programs: Regularize, Overparameterize, and Amortizecited by 13
  9. 2025BrepGPT: Autoregressive B-rep Generation with Voronoi Half-Patchcited by 12
  10. 2023Improving Unsupervised Visual Program Inference with Code Rewriting Familiescited by 10
  11. 2024Learning to Edit Visual Programs with Self-Supervisioncited by 7
  12. 2024DPA-Net: Structured 3D Abstraction from Sparse Views via Differentiable Primitive Assemblycited by 5
7 more
  1. 2026GIFT: Bootstrapping Image-to-CAD Program Synthesis via Geometric Feedbackcited by 3
  2. 2023Tree-Structured Shading Decompositioncited by 2
  3. 2024Learning to Infer Generative Template Programs for Visual Conceptscited by 2
  4. 2025Learning to Place Objects with Programs and Iterative Self Trainingcited by 2
  5. 2024PS-CAD: Local Geometry Guidance via Prompting and Selection for CAD Reconstructioncited by 1
  6. 2024Pattern Analogies: Learning to Perform Programmatic Image Edits by Analogycited by 0
  7. 2026PLLM: Pseudo-Labeling Large Language Models for CAD Program Synthesiscited by 0