Table of Contents
Fetching ...

Scaling Up Probabilistic Circuits by Latent Variable Distillation

Anji Liu, Honghua Zhang, Guy Van den Broeck

TL;DR

The paper tackles the plateau observed when scaling Probabilistic Circuits (PCs) to large, high-dimensional datasets by introducing latent variable distillation (LVD), which injects semantics-aware supervision from deep generative models into the LV space of PCs. The method materializes and assigns latent variables via clustering neural embeddings, optimizes a tractable lower bound on the joint likelihood, and then fine-tunes on the original objective, enabling large PCs to fully exploit their capacity. The approach yields substantial performance gains on image and language benchmarks, and demonstrates competitive results against flow-based models and VAEs, while significantly reducing training time. Overall, LVD provides a principled, scalable avenue for combining tractable probabilistic modeling with neural representations for high-dimensional generative tasks.

Abstract

Probabilistic Circuits (PCs) are a unified framework for tractable probabilistic models that support efficient computation of various probabilistic queries (e.g., marginal probabilities). One key challenge is to scale PCs to model large and high-dimensional real-world datasets: we observe that as the number of parameters in PCs increases, their performance immediately plateaus. This phenomenon suggests that the existing optimizers fail to exploit the full expressive power of large PCs. We propose to overcome such bottleneck by latent variable distillation: we leverage the less tractable but more expressive deep generative models to provide extra supervision over the latent variables of PCs. Specifically, we extract information from Transformer-based generative models to assign values to latent variables of PCs, providing guidance to PC optimizers. Experiments on both image and language modeling benchmarks (e.g., ImageNet and WikiText-2) show that latent variable distillation substantially boosts the performance of large PCs compared to their counterparts without latent variable distillation. In particular, on the image modeling benchmarks, PCs achieve competitive performance against some of the widely-used deep generative models, including variational autoencoders and flow-based models, opening up new avenues for tractable generative modeling. Our code can be found at https://github.com/UCLA-StarAI/LVD.

Scaling Up Probabilistic Circuits by Latent Variable Distillation

TL;DR

The paper tackles the plateau observed when scaling Probabilistic Circuits (PCs) to large, high-dimensional datasets by introducing latent variable distillation (LVD), which injects semantics-aware supervision from deep generative models into the LV space of PCs. The method materializes and assigns latent variables via clustering neural embeddings, optimizes a tractable lower bound on the joint likelihood, and then fine-tunes on the original objective, enabling large PCs to fully exploit their capacity. The approach yields substantial performance gains on image and language benchmarks, and demonstrates competitive results against flow-based models and VAEs, while significantly reducing training time. Overall, LVD provides a principled, scalable avenue for combining tractable probabilistic modeling with neural representations for high-dimensional generative tasks.

Abstract

Probabilistic Circuits (PCs) are a unified framework for tractable probabilistic models that support efficient computation of various probabilistic queries (e.g., marginal probabilities). One key challenge is to scale PCs to model large and high-dimensional real-world datasets: we observe that as the number of parameters in PCs increases, their performance immediately plateaus. This phenomenon suggests that the existing optimizers fail to exploit the full expressive power of large PCs. We propose to overcome such bottleneck by latent variable distillation: we leverage the less tractable but more expressive deep generative models to provide extra supervision over the latent variables of PCs. Specifically, we extract information from Transformer-based generative models to assign values to latent variables of PCs, providing guidance to PC optimizers. Experiments on both image and language modeling benchmarks (e.g., ImageNet and WikiText-2) show that latent variable distillation substantially boosts the performance of large PCs compared to their counterparts without latent variable distillation. In particular, on the image modeling benchmarks, PCs achieve competitive performance against some of the widely-used deep generative models, including variational autoencoders and flow-based models, opening up new avenues for tractable generative modeling. Our code can be found at https://github.com/UCLA-StarAI/LVD.
Paper Structure (25 sections, 1 theorem, 6 equations, 8 figures, 1 table, 1 algorithm)

This paper contains 25 sections, 1 theorem, 6 equations, 8 figures, 1 table, 1 algorithm.

Key Result

Lemma 1

For a PC ${p}(\mathbf{X})$, denote $\mathbf{W}$ as the scope of some units in ${p}$. Assume the variable scope of every PC unit is either a subset of $\mathbf{W}$ or disjoint with $\mathbf{W}$. Let $Z$ be the LV corresponds to $\mathbf{W}$ created by alg:lv. Then variables $\mathbf{W}$ are condition

Figures (8)

  • Figure 1: Latent variable (LV) distillation significantly boosts PC performance on challenging image (ImageNet32) and language (WikiText-2) modeling datasets. Lower is better.
  • Figure 2: Latent variable distillation pipeline for hidden Markov models.
  • Figure 3: A mixture-of-Gaussian distribution (a) and two PCs (b-c) that encode the distribution.
  • Figure 4: Materializing LVs in a PC.
  • Figure 5: Distribution decomposition of an example PC with materialized LVs $Z_1, Z_2$.
  • ...and 3 more figures

Theorems & Definitions (5)

  • Definition 1: Probabilistic Circuits
  • Definition 2: Smoothness and Decomposability
  • Definition 3: Determinism
  • Lemma 1
  • proof