Pith. sign in

REVIEW 1 cited by

Building Expressive and Tractable Probabilistic Generative Models: A Review

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

arxiv 2402.00759 v3 pith:NON57B4L submitted 2024-02-01 cs.LG cs.AI

classification cs.LGcs.AI
keywords fieldprobabilisticbuildingdeepexpressivegenerativemodelstractable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a comprehensive survey of the advancements and techniques in the field of tractable probabilistic generative modeling, primarily focusing on Probabilistic Circuits (PCs). We provide a unified perspective on the inherent trade-offs between expressivity and tractability, highlighting the design principles and algorithmic extensions that have enabled building expressive and efficient PCs, and provide a taxonomy of the field. We also discuss recent efforts to build deep and hybrid PCs by fusing notions from deep neural models, and outline the challenges and open questions that can guide future research in this evolving field.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Restructuring Tractable Probabilistic Circuits

    cs.AI 2024-11 conditional novelty 8.0 of 10

    A restructuring algorithm converts structured probabilistic circuits between different variable-order trees in polynomial time for contiguous circuits, enabling tractable multiplication of differently structured circu...

Pith tools