Sciweavers

49 search results - page 2 / 10
» Distributed averaging via lifted Markov chains
Sort
View
NIPS
2003
13 years 6 months ago
Wormholes Improve Contrastive Divergence
In models that define probabilities via energies, maximum likelihood learning typically involves using Markov Chain Monte Carlo to sample from the model’s distribution. If the ...
Geoffrey E. Hinton, Max Welling, Andriy Mnih
AMAI
2004
Springer
13 years 10 months ago
Bayesian Model Averaging Across Model Spaces via Compact Encoding
Bayesian Model Averaging (BMA) is well known for improving predictive accuracy by averaging inferences over all models in the model space. However, Markov chain Monte Carlo (MCMC)...
Ke Yin, Ian Davidson
UAI
2001
13 years 6 months ago
Markov Chain Monte Carlo using Tree-Based Priors on Model Structure
We present a general framework for defining priors on model structure and sampling from the posterior using the Metropolis-Hastings algorithm. The key ideas are that structure pri...
Nicos Angelopoulos, James Cussens
GLOBECOM
2009
IEEE
13 years 8 months ago
Distributed Averaging in Dense Wireless Networks
We consider the effect of network throughput on the convergence of a specific class of distributed averaging algorithms, called consensus algorithms. These algorithms rely on itera...
Sundaram Vanka, Martin Haenggi, Vijay Gupta
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
13 years 8 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy