Sciweavers

180 search results - page 25 / 36
» Improved bounds on the sample complexity of learning
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
IJCAI
1989
13 years 8 months ago
A Critique of the Valiant Model
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
Wray L. Buntine
IJON
2007
184views more  IJON 2007»
13 years 7 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
ICML
2008
IEEE
14 years 8 months ago
An HDP-HMM for systems with state persistence
The hierarchical Dirichlet process hidden Markov model (HDP-HMM) is a flexible, nonparametric model which allows state spaces of unknown size to be learned from data. We demonstra...
Emily B. Fox, Erik B. Sudderth, Michael I. Jordan,...
ICASSP
2009
IEEE
14 years 2 months ago
Multi-view tracking of articulated human motion in silhouette and pose manifolds
This paper presents a multi-view articulated human motion tracking framework using particle filter with manifold learning through Gaussian process latent variable model. The dime...
Feng Guo, Gang Qian