Computing the partition function $Z$ of a discrete graphical model is a fundamental inference challenge. Since this is computationally intractable, variational approximations are often used in practice. Recently, so-called gauge transformations were used to improve variational lower bounds on $Z$. In this paper, we propose a new gauge-variational approach, termed WMBE-G, which combines gauge transformations with the weighted mini-bucket elimination (WMBE) method. WMBE-G can provide both upper and lower bounds on $Z$, and is easier to optimize than the prior gauge-variational algorithm. We show that WMBE-G strictly improves the earlier WMBE approximation for symmetric models including Ising models with no magnetic field. Our experimental res...
In this thesis, we give a new class of outer bounds on the marginal polytope, and propose a cutting-...
Accurate evaluation of Bayesian model evidence for a given data set is a fundamental problem in mode...
We examine the effect of clamping variables for approximate inference in undirected graphical models...
Computing the partition function Z of a discrete graphical model is a fundamental inference challeng...
Computing partition function is the most important statistical inference task arising in application...
Probabilistic graphical models are a key tool in machine learning applications. Computing the partit...
Probabilistic graphical models arc a key tool in machine learning applications. Computing the partit...
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bound...
We report about a new variational method [9] which approximates in a hierarchical way the random Isi...
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bound...
Abstract. The cluster variation method has been developed into a general theoretical framework for t...
AbstractA new approximation of the cluster variational method is introduced for the three-dimensiona...
Graphical models are a general-purpose tool for modeling complex distributions in a way which facili...
We introduce a novel method for estimating the partition function and marginals of distributions def...
Inference efforts -- required to compute partition function, $Z$, of an Ising model over a graph of ...
In this thesis, we give a new class of outer bounds on the marginal polytope, and propose a cutting-...
Accurate evaluation of Bayesian model evidence for a given data set is a fundamental problem in mode...
We examine the effect of clamping variables for approximate inference in undirected graphical models...
Computing the partition function Z of a discrete graphical model is a fundamental inference challeng...
Computing partition function is the most important statistical inference task arising in application...
Probabilistic graphical models are a key tool in machine learning applications. Computing the partit...
Probabilistic graphical models arc a key tool in machine learning applications. Computing the partit...
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bound...
We report about a new variational method [9] which approximates in a hierarchical way the random Isi...
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bound...
Abstract. The cluster variation method has been developed into a general theoretical framework for t...
AbstractA new approximation of the cluster variational method is introduced for the three-dimensiona...
Graphical models are a general-purpose tool for modeling complex distributions in a way which facili...
We introduce a novel method for estimating the partition function and marginals of distributions def...
Inference efforts -- required to compute partition function, $Z$, of an Ising model over a graph of ...
In this thesis, we give a new class of outer bounds on the marginal polytope, and propose a cutting-...
Accurate evaluation of Bayesian model evidence for a given data set is a fundamental problem in mode...
We examine the effect of clamping variables for approximate inference in undirected graphical models...