1106 search results - page 37 / 222 » On regularization algorithms in learning theory |
147
click to vote
NIPS
2008
15 years 6 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
240
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
111
click to vote
IR
2007
15 years 4 months ago
2007
In information retrieval, the cluster hypothesis states: closely related documents tend to be relevant to the same request. We exploit this hypothesis directly by adjusting queryb...
153
Voted
HLK
2003
IEEE
15 years 9 months ago
2003
IEEE
Three-dimensional morphable models of object classes are a powerful tool in modeling, animation and recognition. We introduce here the new concept of regularized 3D morphable mode...
108
click to vote
ALT
2010
Springer
15 years 6 months ago
2010
Springer
We further develop the idea that the PAC-Bayes prior can be informed by the data-generating distribution. We prove sharp bounds for an existing framework of Gibbs algorithms, and ...