14 search results - page 2 / 3 » Deep Belief Networks Are Compact Universal Approximators |
UAI
1998
13 years 8 months ago
1998
The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system,...
JMLR
2010
13 years 2 months ago
2010
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...
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
13 years 8 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
ICPR
2010
IEEE
13 years 10 months ago
2010
IEEE
This work introduces a new pattern recognition model for segmenting and tracking lip contours in video sequences. We formulate the problem as a general nonrigid object tracking me...
JMLR
2012
11 years 10 months ago
2012
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...