paper-with-me

Papers

Integrating Transformations in Probabilistic Circuits

2023-10-06 · Tom Schierenbeck, Vladimir Vutov, Thorsten Dickhaus, Michael Beetz

This study addresses the predictive limitation of probabilistic circuits and introduces transformations as a remedy to overcome it. We demonstrate this limitation in robotic scenarios. We motivate that independent component analysis is a sound tool to preserve the independence properties of probabilistic circuits. Our approach is an extension of joint probability trees, which are model-free deterministic circuits. By doing so, it is demonstrated that the proposed approach is able to achieve higher likelihoods while using fewer parameters compared to the joint probability trees on seven benchmark data sets as well as on real robot data. Furthermore, we discuss how to integrate transformations into tree-based learning routines. Finally, we argue that exact inference with transformed quantile parameterized distributions is not tractable. However, our approach allows for efficient sampling and approximate inference.

📄 PDF Abstract BibTeX arXiv:2310.04354

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Solving Marginal MAP Exactly by Probabilistic Circuit Transformations

2021-11-08 · YooJung Choi, Tal Friedman, Guy Van Den Broeck

Probabilistic circuits (PCs) are a class of tractable probabilistic models that allow efficient, often linear-time, inference of queries such as marginals and most probable explanations (MPE). However, marginal MAP, whic…

Decision Making

Complex Inference in Neural Circuits with Probabilistic Population Codes and Topic Models

2012-12-01 · NeurIPS 2012 12 · Jeff Beck, Alexandre Pouget, Katherine A. Heller

Recent experiments have demonstrated that humans and animals typically reason probabilistically about their environment. This ability requires a neural code that represents probability distributions and neural circuits t…

Decision MakingDocument ClassificationTopic ModelsVariational Inference

Solving Satisfiability Modulo Counting Exactly with Probabilistic Circuits

2025-03-02 · Jinzhao Li, Nan Jiang, Yexiang Xue

Satisfiability Modulo Counting (SMC) is a recently proposed general language to reason about problems integrating statistical and symbolic Artificial Intelligence. An SMC problem is an extended SAT problem in which the t…

Computational Efficiency

Bayesian Integration of Information Using Top-Down Modulated WTA Networks

2023-08-29 · Otto van der Himst, Leila Bagheriye, Johan Kwisthout

Winner Take All (WTA) circuits a type of Spiking Neural Networks (SNN) have been suggested as facilitating the brain's ability to process information in a Bayesian manner. Research has shown that WTA circuits are capable…

A Compositional Atlas of Tractable Circuit Operations for Probabilistic Inference

2021-05-21 · NeurIPS 2021 12 · Antonio Vergari, YooJung Choi, Anji Liu, Stefano Teso 외

Circuit representations are becoming the lingua franca to express and reason about tractable generative and discriminative models. In this paper, we show how complex inference scenarios for these models that commonly ari…