Building Hyper Dirichlet Processes for Graphical Models
Daniel Heinz

TL;DR
This paper introduces a novel class of hyper Dirichlet processes tailored for graphical models, enabling flexible Bayesian modeling of complex conditional independence structures in multivariate data.
Contribution
It develops a new non-parametric prior based on hyper Dirichlet processes for graphical models, extending existing Bayesian frameworks for more flexible dependence modeling.
Findings
Provides a new non-parametric prior for graphical models
Enables Bayesian inference with complex dependence structures
Extends Dirichlet process methods to graphical model settings
Abstract
Graphical models are used to describe the conditional independence relations in multivariate data. They have been used for a variety of problems, including log-linear models (Liu and Massam, 2006), network analysis (Holland and Leinhardt, 1981; Strauss and Ikeda, 1990; Wasserman and Pattison, 1996; Pattison and Wasserman, 1999; Robins et al., 1999);, graphical Gaussian models (Roverato and Whittaker, 1998; Giudici and Green, 1999; Marrelec and Benali, 2006), and genetics (Dobra et al., 2004). A distribution that satisfies the conditional independence structure of a graph is Markov. A graphical model is a family of distributions that is restricted to be Markov with respect to a certain graph. In a Bayesian problem, one may specify a prior over the graphical model. Such a prior is called a hyper Markov law if the random marginals also satisfy the independence constraints. Previous work in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Bayesian Methods and Mixture Models · Data Management and Algorithms
