paper-with-me

Papers

Latent Tree Models and Approximate Inference in Bayesian Networks

2014-01-15 · Yi Wang, Nevin L. Zhang, Tao Chen

We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and when online, make inference with the LTM instead of the original BN. Because LTMs are tree-structured, inference takes linear time. In the meantime, they can represent complex relationship among leaf nodes and hence the approximation accuracy is often good. Empirical evidence shows that our method can achieve good approximation accuracy at low online computational cost.

📄 PDF Abstract BibTeX arXiv:1401.3429

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Variational Bayesian Phylogenetic Inference

2019-05-01 · ICLR 2019 5 · Cheng Zhang, Frederick A. Matsen IV

Bayesian phylogenetic inference is currently done via Markov chain Monte Carlo with simple mechanisms for proposing new states, which hinders exploration efficiency and often requires long runs to deliver accurate poster…

Variational Inference

Real-time Approximate Bayesian Computation for Scene Understanding

2019-05-22 · Javier Felip, Nilesh Ahuja, David Gómez-Gutiérrez, Omesh Tickoo 외

Consider scene understanding problems such as predicting where a person is probably reaching, or inferring the pose of 3D objects from depth images, or inferring the probable street crossings of pedestrians at a busy int…

Scene Understanding

IBIA: Bayesian Inference via Incremental Build-Infer-Approximate operations on Clique Trees

2022-02-24 · Shivani Bathla, Vinita Vasudevan

Exact inference in Bayesian networks is intractable and has an exponential dependence on the size of the largest clique in the corresponding clique tree (CT), necessitating approximations. Factor based methods to bound c…

Bayesian Inference

Vectorized Bayesian Inference for Latent Dirichlet-Tree Allocation

2026-02-21 · Zheng Wang, Nizar Bouguila arxiv

Latent Dirichlet Allocation (LDA) is a foundational model for discovering latent thematic structure in discrete data, but its Dirichlet prior cannot represent the rich correlations and hierarchical relationships often pr…

Computational EfficiencyBayesian Inference

Cycle-Consistent Adversarial Learning as Approximate Bayesian Inference

2018-06-05 · Louis C. Tiao, Edwin V. Bonilla, Fabio Ramos

We formalize the problem of learning interdomain correspondences in the absence of paired data as Bayesian inference in a latent variable model (LVM), where one seeks the underlying hidden representations of entities fro…

Bayesian InferenceVariational Inference