Sciweavers

159 search results - page 4 / 32
» Incremental One-Class Learning with Bounded Computational Co...
Sort
View
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 8 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
ALT
2005
Springer
14 years 4 months ago
Monotone Conditional Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
Alexey V. Chernov, Marcus Hutter
ICCV
2009
IEEE
13 years 5 months ago
Real-time visual tracking via Incremental Covariance Tensor Learning
Visual tracking is a challenging problem, as an object may change its appearance due to pose variations, illumination changes, and occlusions. Many algorithms have been proposed t...
Yi Wu, Jian Cheng, Jinqiao Wang, Hanqing Lu
ICML
2005
IEEE
14 years 8 months ago
Learning discontinuities with products-of-sigmoids for switching between local models
Sensorimotor data from many interesting physical interactions comprises discontinuities. While existing locally weighted learning approaches aim at learning smooth functions, we p...
Marc Toussaint, Sethu Vijayakumar
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 7 months ago
Statistical Learning of Arbitrary Computable Classifiers
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
David Soloveichik