ALT
2004
Springer
14 years 9 months ago
2004
Springer
ALT
2004
Springer
14 years 9 months ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
ALT
2004
Springer
14 years 9 months ago
2004
Springer
We investigate further improvement of boosting in the case that the target concept belongs to the class of r-of-k threshold Boolean functions, which answer “+1” if at least r o...
ALT
2004
Springer
14 years 9 months ago
2004
Springer
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
ALT
2004
Springer
14 years 9 months ago
2004
Springer
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
ALT
2004
Springer
14 years 9 months ago
2004
Springer
ALT
2004
Springer
14 years 9 months ago
2004
Springer
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...