Tractable Probabilistic Circuits
summary
Introduces tractable probabilistic circuits as sum‑product DAGs learned via Chow‑Liu → hidden tree → circuit and trained with mini‑batch EM on GPUs; achieves state‑of‑the‑art likelihood on full MNIST and yields image compression that is 5–40× faster than neural baselines. Proves that determinantal point processes require new syntax, gives probability generating circuits that represent DPPs in polynomial size, and shows KL/cross‑entropy are tractable when circuits are smooth, decomposable and deterministic; practical marginal‑MAP solver outperforms prior methods.
AI-written summary · about
chapters (16)
- 0:00Start
- 4:15Tractable marginals
- 7:04Outline
- 7:41Learning Expressive Probabilistic Circuits Hidden Chow-Liu Trees
- 12:57Probabilistic circuits seem awfully general.
- 13:32Enter: Determinantal Point Processes DPPST
- 17:22Probability Generating Functions
- 21:46Example
- 22:17Experiment Results: Amazon Baby Registries
- 24:37Queries as pipelines: Cross Entropy
- 25:31Tractable circuit operations
- 26:03Inference by tractable operations systematically derive tractable inference algorithm of complex queries
- 27:41Pruning circuits
- 29:46Tractable Computation of Expected Kernels: Applications Reasoning about support vector regression (SVR) with missing features
- 30:36Conclusion
- 34:16Even harder queries
related talks
01h 05mLogic and Probabilistic Circuits 1
01h 03mLogic and Probabilistic Circuits 2
01h 01mLogic and Probabilistic Circuits 4
01h 00mLogic and Probabilistic Circuits 3
37mSolving Marginal MAP Exactly by Probabilistic Circuit Transformations
52mSubtractive Mixture Models: Representation and Learning
01h 04mLearning Beyond Stabilizer States
32mStructured Deep Learning with Probabilistic Neural Prog
