Sciweavers

683 search results - page 47 / 137
» Generalization Bounds for Learning Kernels
Sort
View
ICCV
2003
IEEE
14 years 10 months ago
Recognition with Local Features: the Kernel Recipe
Recent developments in computer vision have shown that local features can provide efficient representations suitable for robust object recognition. Support Vector Machines have be...
Christian Wallraven, Barbara Caputo, Arnulf B. A. ...
IJON
2007
166views more  IJON 2007»
13 years 8 months ago
Kernel PCA for similarity invariant shape recognition
We present in this paper a novel approach for shape description based on kernel principal component analysis (KPCA). The strength of this method resides in the similarity (rotatio...
Hichem Sahbi
COLT
2007
Springer
14 years 2 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
EWRL
2008
13 years 10 months ago
Bayesian Reward Filtering
A wide variety of function approximation schemes have been applied to reinforcement learning. However, Bayesian filtering approaches, which have been shown efficient in other field...
Matthieu Geist, Olivier Pietquin, Gabriel Fricout
CC
2010
Springer
120views System Software» more  CC 2010»
13 years 6 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov