paper-with-me

홈 › Papers

Recurrent Dirichlet Belief Networks for Interpretable Dynamic Relational Data Modelling

2020-02-24 · Yaqiong Li, Xuhui Fan, Ling Chen, Bin Li, Zheng Yu, Scott A. Sisson

The Dirichlet Belief Network~(DirBN) has been recently proposed as a promising approach in learning interpretable deep latent representations for objects. In this work, we leverage its interpretable modelling architecture and propose a deep dynamic probabilistic framework -- the Recurrent Dirichlet Belief Network~(Recurrent-DBN) -- to study interpretable hidden structures from dynamic relational data. The proposed Recurrent-DBN has the following merits: (1) it infers interpretable and organised hierarchical latent structures for objects within and across time steps; (2) it enables recurrent long-term temporal dependence modelling, which outperforms the one-order Markov descriptions in most of the dynamic probabilistic frameworks. In addition, we develop a new inference strategy, which first upward-and-backward propagates latent counts and then downward-and-forward samples variables, to enable efficient Gibbs sampling for the Recurrent-DBN. We apply the Recurrent-DBN to dynamic relational data problems. The extensive experiment results on real-world data validate the advantages of the Recurrent-DBN over the state-of-the-art models in interpretable latent structure discovery and improved link prediction performance.

📄 PDF Abstract BibTeX arXiv:2002.10235

Code (0)

등록된 구현이 없습니다.

Tasks

Link Prediction

Similar Papers 제목 키워드 기반

Planning with Noisy Probabilistic Relational Rules

2014-01-16 · Tobias Lang, Marc Toussaint

Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually interpretable and they can be learned effec…

Robot Manipulation

Recurrent networks, hidden states and beliefs in partially observable environments

2022-08-06 · Gaspard Lambrechts, Adrien Bolland, Damien Ernst

Reinforcement learning aims to learn optimal policies from interaction with environments whose dynamics are unknown. Many methods rely on the approximation of a value function to derive near-optimal policies. In partiall…

Reverse-engineering recurrent neural network solutions to a hierarchical inference task for mice

2020-12-01 · NeurIPS 2020 12 · Rylan Schaeffer, Mikail Khona, Leenoy Meshulam, Brain Laboratory International 외

We study how recurrent neural networks (RNNs) solve a hierarchical inference task involving two latent variables and disparate timescales separated by 1-2 orders of magnitude. The task is of interest to the International…

Knowledge DistillationModel Compression

Neural Bayesian Sequential Routing

2026-05-22 · Yongchao Huang arxiv

Human decision-making is sequential and uncertainty-aware, yet standard neural networks often rely on static, dense forward computation with limited visibility into evidence acquisition, uncertainty evolution, or when co…

Medical Diagnosis

Sawtooth Factorial Topic Embeddings Guided Gamma Belief Network

2021-06-30 · Zhibin Duan, Dongsheng Wang, Bo Chen, Chaojie Wang 외

Hierarchical topic models such as the gamma belief network (GBN) have delivered promising results in mining multi-layer document representations and discovering interpretable topic taxonomies. However, they often assume …

Topic ModelsVariational Inference