An algebraic characterization of the optimum of regularized kernel methods

DOI10.1007/S10994-008-5095-1MaRDI QIDQ1009329zbMATH OpenOpenAlexFDO

Authors Francesco Dinuzzo, Giuseppe De Nicolao

Publication date 31 March 2009

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-008-5095-1

zbMATH Keywords

degrees of freedomkernel methodsregularization theoryrepresenter theoremsupport vector machines

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Some properties of regularized kernel methods
• scientific article; zbMATH DE number 1804115
• Learning the kernel function via regularization
• When is there a representer theorem? Vector versus matrix regularizers
• scientific article; zbMATH DE number 5957500

Cites work

• 10.1162/1532443041827925
• Asymptotic analysis of penalized likelihood and related estimators
• Convergence of the IRWLS Procedure to the Support Vector Machine Solution
• Efficient Computation and Model Selection for the Support Vector Regression
• Estimating the dimension of a model
• Estimation of the mean of a multivariate normal distribution
• scientific article; zbMATH DE number 1804115 (Why is no real title available?)
• scientific article; zbMATH DE number 5957500 (Why is no real title available?)
• scientific article; zbMATH DE number 45848 (Why is no real title available?)
• scientific article; zbMATH DE number 3444596 (Why is no real title available?)
• scientific article; zbMATH DE number 823069 (Why is no real title available?)
• scientific article; zbMATH DE number 1424219 (Why is no real title available?)
• On Measuring and Correcting the Effects of Data Mining and Model Selection
• On the ``degrees of freedom of the lasso
• Pegasos: primal estimated sub-gradient solver for SVM
• Reformulation: nonsmooth, piecewise smooth, semismooth and smoothing methods. Session in the 16th international symposium on Mathematical programming (ismp97) held at Lausanne EPFL, Switzerland, August 24--29, 1997
• Simplicial algorithms for minimizing polyhedral functions
• Smooth -insensitive regression by loss symmetrization
• Smooth minimization of non-smooth functions
• Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation
• Some Comments on C P
• Some properties of regularized kernel methods
• Some results on Tchebycheffian spline functions and stochastic processes
• SSVM: A smooth support vector machine for classification
• The elements of statistical learning. Data mining, inference, and prediction
• The Estimation of Prediction Error
• Training a Support Vector Machine in the Primal

Cited in

(3)

• Fractional Gaussian kernels
• Some properties of regularized kernel methods
• Restoration of images corrupted by Gaussian and uniform impulsive noise

Describes a project that uses

Uses Software

• Pegasos
• ElemStatLearn
• SSVM

This page was built for publication: An algebraic characterization of the optimum of regularized kernel methods

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