Sciweavers

167 search results - page 25 / 34
» Speeeding Up Markov Chain Monte Carlo Algorithms
Sort
View
UAI
2004
14 years 6 days ago
Bayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
Iain Murray, Zoubin Ghahramani
ICA
2007
Springer
14 years 2 months ago
Infinite Sparse Factor Analysis and Infinite Independent Components Analysis
Abstract. A nonparametric Bayesian extension of Independent Components Analysis (ICA) is proposed where observed data Y is modelled as a linear superposition, G, of a potentially i...
David Knowles, Zoubin Ghahramani
WSC
2007
14 years 1 months ago
Transformations for accelerating MCMC simulations with broken ergodicity
A new approach for overcoming broken ergodicity in Markov Chain Monte Carlo (MCMC) simulations of complex systems is described. The problem of broken ergodicity is often present i...
Mark Fleischer
AUSAI
2006
Springer
14 years 2 months ago
Learning Hybrid Bayesian Networks by MML
Abstract. We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditi...
Rodney T. O'Donnell, Lloyd Allison, Kevin B. Korb
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 3 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel