Sciweavers

2103 search results - page 59 / 421
» Approximate Learning of Dynamic Models
Sort
View
ICML
2009
IEEE
16 years 3 months ago
Herding dynamical weights to learn
A new "herding" algorithm is proposed which directly converts observed moments into a sequence of pseudo-samples. The pseudosamples respect the moment constraints and ma...
Max Welling
132
Voted
ICML
1999
IEEE
16 years 3 months ago
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
Sebastian Thrun, John Langford, Dieter Fox
91
Voted
ICML
2002
IEEE
16 years 3 months ago
Univariate Polynomial Inference by Monte Carlo Message Length Approximation
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
PR
2008
123views more  PR 2008»
15 years 2 months ago
Extensions of vector quantization for incremental clustering
In this paper, we extend the conventional vector quantization by incorporating a vigilance parameter, which steers the tradeoff between plasticity and stability during incremental...
Edwin Lughofer
TSMC
2010
14 years 9 months ago
Interactive Teaching for Vision-Based Mobile Robots: A Sensory-Motor Approach
Abstract--For the last decade, we have developed a visionbased architecture for mobile robot navigation. Our bio-inspired model of the navigation has proved to achieve sensory-moto...
Christophe Giovannangeli, Philippe Gaussier