Sciweavers

683 search results - page 4 / 137
» Generalization Bounds for Learning Kernels
Sort
View
ALT
2004
Springer
14 years 4 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
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...
Mark Herbster
FOCM
2006
50views more  FOCM 2006»
13 years 7 months ago
Online Learning Algorithms
In this paper, we study an online learning algorithm in Reproducing Kernel Hilbert Spaces (RKHS) and general Hilbert spaces. We present a general form of the stochastic gradient m...
Steve Smale, Yuan Yao
ML
2002
ACM
146views Machine Learning» more  ML 2002»
13 years 7 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio
IJCNN
2007
IEEE
14 years 1 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot