44 search results - page 1 / 9 » Approximation Bounds for Some Sparse Kernel Regression Algor... |
NECO
2002
13 years 4 months ago
2002
JMLR
2002
13 years 4 months ago
2002
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
TNN
2010
12 years 11 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
ICML
2008
IEEE
14 years 5 months ago
2008
IEEE
Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of th...
PKDD
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...