738 citations · 1.3k across the 14 of their papers we have counts for
7 papers · 1 filter
On the Convergence of Bound Optimization Algorithms
Ruslan R Salakhutdinov, Sam T Roweis, Zoubin Ghahramani
Many practitioners who use the EM algorithm complain that it is sometimes slow. When does this happen, and what can be done about it? In this paper, we study the general class of b…
SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases
Simon Lacoste-Julien, Konstantina Palla, Alex Davies +3
The Internet has enabled the creation of a growing number of large-scale knowledge bases in a variety of domains containing complementary information. Tools for automatically align…
Bayesian Learning in Undirected Graphical Models: Approximate MCMC algorithms
Iain Murray, Zoubin Ghahramani
Bayesian learning in undirected graphical models|computing posterior distributions over parameters and predictive quantities is exceptionally difficult. We conjecture that for gene…
Bayesian Inference for Gaussian Mixed Graph Models
Ricardo Silva, Zoubin Ghahramani
We introduce priors and algorithms to perform Bayesian inference in Gaussian models defined by acyclic directed mixed graphs. Such a class of graphs, composed of directed and bi-di…
Variable noise and dimensionality reduction for sparse Gaussian processes
Edward Snelson, Zoubin Ghahramani
The sparse pseudo-input Gaussian process (SPGP) is a new approximation method for speeding up GP regression in the case of a large number of data points N. The approximation is con…
A Non-Parametric Bayesian Method for Inferring Hidden Causes
Frank Wood, Thomas Griffiths, Zoubin Ghahramani
We present a non-parametric Bayesian approach to structure learning with hidden causes. Previous Bayesian treatments of this problem define a prior over the number of hidden causes…