683 search results - page 19 / 137 » Generalization Bounds for Learning Kernels |
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
We extend tree-based methods to the prediction of structured outputs using a kernelization of the algorithm that allows one to grow trees as soon as a kernel can be defined on the...
ALT
2006
Springer
14 years 4 months ago
2006
Springer
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
SLSFS
2005
Springer
14 years 25 days ago
2005
Springer
We present a method which uses example pairs of equal or unequal class labels to select a subspace with near optimal metric properties in a kernel-induced Hilbert space. A represen...
ALT
2004
Springer
14 years 4 months ago
2004
Springer
When applying aggregating strategies to Prediction with Expert Advice, the learning rate must be adaptively tuned. The natural choice of complexity/current loss renders the analys...
COLT
1998
Springer
13 years 11 months ago
1998
Springer
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...