Sciweavers

37 search results - page 2 / 8
» On the Concentration of Expectation and Approximate Inferenc...
Sort
View
ALT
2004
Springer
14 years 2 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
UAI
2003
13 years 6 months ago
Approximate Inference and Constrained Optimization
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
Tom Heskes, Kees Albers, Bert Kappen
INFOCOM
2007
IEEE
13 years 11 months ago
Toward Optimal Network Fault Correction via End-to-End Inference
— We consider an end-to-end approach of inferring network faults that manifest in multiple protocol layers, with an optimization goal of minimizing the expected cost of correctin...
Patrick P. C. Lee, Vishal Misra, Dan Rubenstein
JMLR
2010
192views more  JMLR 2010»
12 years 12 months ago
Efficient Learning of Deep Boltzmann Machines
We present a new approximate inference algorithm for Deep Boltzmann Machines (DBM's), a generative model with many layers of hidden variables. The algorithm learns a separate...
Ruslan Salakhutdinov, Hugo Larochelle
VTC
2006
IEEE
171views Communications» more  VTC 2006»
13 years 11 months ago
Analysis of Spatial Multiplexing for Cross-Layer Design of MIMO Ad Hoc Networks
— We consider the application of spatial multiplexing to ad hoc networks where nodes have multiple antennas. At the physical level, we suppose that layered space–time multiuser...
Marco Levorato, Stefano Tomasin, Paolo Casari, Mic...