2000 character limit reached
A Note on Bayesian Networks with Latent Root Variables (2402.17087v1)
Published 26 Feb 2024 in stat.ML, cs.AI, and cs.LG
Abstract: We characterise the likelihood function computed from a Bayesian network with latent variables as root nodes. We show that the marginal distribution over the remaining, manifest, variables also factorises as a Bayesian network, which we call empirical. A dataset of observations of the manifest variables allows us to quantify the parameters of the empirical Bayesian net. We prove that (i) the likelihood of such a dataset from the original Bayesian network is dominated by the global maximum of the likelihood from the empirical one; and that (ii) such a maximum is attained if and only if the parameters of the Bayesian network are consistent with those of the empirical model.
- D. Koller and N. Friedman. Probabilistic Graphical Models: Principles and Techniques. MIT, 2009.
- J. Tian. Studies in Causal Reasoning and Learning. PhD thesis, UCLA, 2002.
- Y. Wang and N. L. Zhang. Severity of local maxima for the EM algorithm: Experiences with hierarchical latent class models. In Proceedings of the Third European Workshop on Probabilistic Graphical Models, pages 301–308. Action M Agency, 2006.
- Causal expectation-maximisation. Why-21@NeurIPS, 2021.
- Efficient computation of counterfactual bounds. International Journal of Approximate Reasoning, page 109111, 2024.