Sciweavers

44 search results - page 4 / 9
» Approximation Bounds for Some Sparse Kernel Regression Algor...
Sort
View
AIA
2007
13 years 8 months ago
Improving the aggregating algorithm for regression
Kernel Ridge Regression (KRR) and the recently developed Kernel Aggregating Algorithm for Regression (KAAR) are regression methods based on Least Squares. KAAR has theoretical adv...
Steven Busuttil, Yuri Kalnishkan, Alexander Gammer...
IJCNN
2006
IEEE
14 years 22 days ago
Greedy forward selection algorithms to Sparse Gaussian Process Regression
Abstract— This paper considers the basis vector selection issue invloved in forward selection algorithms to sparse Gaussian Process Regression (GPR). Firstly, we re-examine a pre...
Ping Sun, Xin Yao
JMLR
2010
145views more  JMLR 2010»
13 years 1 months ago
Kernel Partial Least Squares is Universally Consistent
We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Lea...
Gilles Blanchard, Nicole Krämer
SIAMJO
2008
93views more  SIAMJO 2008»
13 years 6 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont
NIPS
2007
13 years 8 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh