On the Relationship Between Probabilistic Circuits and Determinantal Point Processes

06/26/2020
by   Honghua Zhang, et al.
1

Scaling probabilistic models to large realistic problems and datasets is a key challenge in machine learning. Central to this effort is the development of tractable probabilistic models (TPMs): models whose structure guarantees efficient probabilistic inference algorithms. The current landscape of TPMs is fragmented: there exist various kinds of TPMs with different strengths and weaknesses. Two of the most prominent classes of TPMs are determinantal point processes (DPPs) and probabilistic circuits (PCs). This paper provides the first systematic study of their relationship. We propose a unified analysis and shared language for discussing DPPs and PCs. Then we establish theoretical barriers for the unification of these two families, and prove that there are cases where DPPs have no compact representation as a class of PCs. We close with a perspective on the central problem of unifying these tractable models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/19/2021

Probabilistic Generating Circuits

Generating functions, which are widely used in combinatorics and probabi...
research
12/09/2021

Testing Probabilistic Circuits

Probabilistic circuits (PCs) are a powerful modeling framework for repre...
research
04/17/2023

Compositional Probabilistic and Causal Inference using Tractable Circuit Models

Probabilistic circuits (PCs) are a class of tractable probabilistic mode...
research
01/07/2020

Exploring Unknown Universes in Probabilistic Relational Models

Large probabilistic models are often shaped by a pool of known individua...
research
02/17/2022

Efficient and Reliable Probabilistic Interactive Learning with Structured Outputs

In this position paper, we study interactive learning for structured out...
research
02/07/2022

Tractable Boolean and Arithmetic Circuits

Tractable Boolean and arithmetic circuits have been studied extensively ...
research
11/22/2022

Sparse Probabilistic Circuits via Pruning and Growing

Probabilistic circuits (PCs) are a tractable representation of probabili...

Please sign up or login with your details

Forgot password? Click here to reset