pith. sign in

arxiv: 1809.04294 · v4 · pith:NUBHRC2Ynew · submitted 2018-09-12 · 📊 stat.ML · cs.LG

Cluster Variational Approximations for Structure Learning of Continuous-Time Bayesian Networks from Incomplete Data

classification 📊 stat.ML cs.LG
keywords learningcontinuous-timedataexistingincompletemethodsnetworksstructure
0
0 comments X
read the original abstract

Continuous-time Bayesian networks (CTBNs) constitute a general and powerful framework for modeling continuous-time stochastic processes on networks. This makes them particularly attractive for learning the directed structures among interacting entities. However, if the available data is incomplete, one needs to simulate the prohibitively complex CTBN dynamics. Existing approximation techniques, such as sampling and low-order variational methods, either scale unfavorably in system size, or are unsatisfactory in terms of accuracy. Inspired by recent advances in statistical physics, we present a new approximation scheme based on cluster-variational methods significantly improving upon existing variational approximations. We can analytically marginalize the parameters of the approximate CTBN, as these are of secondary importance for structure learning. This recovers a scalable scheme for direct structure learning from incomplete and noisy time-series data. Our approach outperforms existing methods in terms of scalability.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.