Characteristic Circuits
In many real-world scenarios, it is crucial to be able to reliably and efficiently reason under uncertainty while capturing complex relationships in data. Probabilistic circuits (PCs), a prominent family of tractable probabilistic models, offer a remedy to this challenge by composing simple, tractable distributions into a high-dimensional probability distribution. However, learning PCs on heterogeneous data is challenging and densities of some parametric distributions are not available in closed form, limiting their potential use. We introduce characteristic circuits (CCs), a family of tractable probabilistic models providing a unified formalization of distributions over heterogeneous data in the spectral domain. The one-to-one relationship between characteristic functions and probability measures enables us to learn high-dimensional distributions on heterogeneous data domains and facilitates efficient probabilistic inference even when no closed-form density function is available. We show that the structure and parameters of CCs can be learned efficiently from the data and find that CCs outperform state-of-the-art density estimators for heterogeneous data domains on common benchmark data sets.
Code (1)
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Minimal Neuron Circuits: Bursters
This work introduces a novel methodology for designing biologically plausible bursting neuron circuits using a minimal number of components. We hypothesize that to design circuits capable of bursting, the neuron circuit …
Two Cellular Resource Based Models Linking Growth and Parts Characteristics Aids the Study and Optimization of Synthetic Gene Circuits
A major challenge in synthetic genetic circuit development is the inter-dependency between heterologous gene expressions by circuits and host's growth rate. Increasing heterologous gene expression increases burden to the…
Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits
We give new and efficient black-box reconstruction algorithms for some classes of depth-$3$ arithmetic circuits. As a consequence, we obtain the first efficient algorithm for computing the tensor rank and for finding the…
Tensor DecompositionAssociate submersions and qualitative properties of nonlinear circuits with implicit characteristics
We introduce in this paper an equivalence notion for submersions $U \to \R$, $U$ open in $\R^2$, which makes it possible to identify a smooth planar curve with a unique class of submersions. This idea, which extends to t…
Robustness, Evolvability and Phenotypic Complexity: Insights from Evolving Digital Circuits
We show how the characteristics of the evolutionary algorithm influence the evolvability of candidate solutions, i.e. the propensity of evolving individuals to generate better solutions as a result of genetic variation. …