683 search results - page 79 / 137 » Generalization Bounds for Learning Kernels |
147
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...
117
Voted
COLT
2000
Springer
15 years 7 months ago
2000
Springer
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
AAAI
2008
15 years 5 months ago
2008
This work addresses the problem of efficiently learning action schemas using a bounded number of samples (interactions with the environment). We consider schemas in two languages-...
127
click to vote
COLT
2006
Springer
15 years 6 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
162
click to vote
ALT
2011
Springer
14 years 2 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...