Regularized least square regression with spherical polynomial kernels

DOI10.1142/S0219691309003240MaRDI QIDQ5189976zbMATH OpenFDO

Authors Luoqing Li

Publication date 11 March 2010

Published in International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219691309003240

zbMATH Keywords

de la Vallée-Poussin operatorlearning rateregularized least square regressionreproducing kernel Hilbert spacespherical polynomial kernel

Mathematics Subject Classification ID

General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning rates of regularized regression on the unit sphere
• Sobolev norm learning rates for regularized least-squares algorithms
• The learning rate for regularized least-squares algorithm on the unit sphere
• Learning rates of least-square regularized regression with polynomial kernels
• Learning rates of least-square regularized regression

Cites work

• A WAVELET APPROACH FOR CLASSIFICATION OF MICROARRAY DATA
• ANALYSIS OF CLASSIFICATION WITH A REJECT OPTION
• Approximation processes for fourier-jacobi expansions^†
• Approximation with polynomial kernels and SVM classifiers
• Best choices for regularization parameters in learning theory: on the bias-variance problem.
• Error bounds of multi-graph regularized semi-supervised classification
• Generalization performance of multi-category kernel machines
• HILBERT–SCHMIDT OPERATORS AND FRAMES — CLASSIFICATION, BEST APPROXIMATION BY MULTIPLIERS AND ALGORITHMS
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• Learning rates for regularized classifiers using multivariate polynomial kernels
• Learning rates of least-square regularized regression
• Learning Theory
• On the de la Vallée-Poussin means on the sphere
• On the mathematical foundations of learning
• On the rate of convergence for multi-category classification based on convex losses
• On Wallis' formula
• Regularization networks and support vector machines
• SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming

Cited in

(16)

• Nonparametric regression using needlet kernels for spherical data
• Approximating and learning by Lipschitz kernel on the sphere
• Model selection of C-support vector machines based on multi-threading genetic algorithm
• Rank-1 tensor projection via regularized regression for action classification
• The coefficient regularized regression with random projection
• Texture analysis using Gaussian graphical models
• An asymmetric adaptive classification method
• Local learning estimates by integral operators
• Gabor-based tensor local discriminant embedding and its application on palmprint recognition
• Learning rates of regularized regression on the unit sphere
• The learning rate for regularized least-squares algorithm on the unit sphere
• Spherical Regression Models Using Projective Linear Transformations
• The kernel regularized learning algorithm for solving Laplace equation with Dirichlet boundary
• Error analysis of kernel regularized pairwise learning with a strongly convex loss
• Reproducing property of bounded linear operators and kernel regularized least square regressions
• Convex analysis method for distributed learning algorithm

This page was built for publication: Regularized least square regression with spherical polynomial kernels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189976)