A note on support vector machines with polynomial kernels

DOI10.1162/NECO_A_00794MaRDI QIDQ5380381zbMATH OpenOpenAlexWikidataFDO

Authors Hongzhi Tong

Publication date 4 June 2019

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/neco_a_00794

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Approximation with polynomial kernels and SVM classifiers
• Learning Theory
• Fast rates for support vector machines using Gaussian kernels
• Learning rates for regularized classifiers using multivariate polynomial kernels
• Support vector machines learning noisy polynomial rules

Cites work

• scientific article; zbMATH DE number 1190534 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 893887 (Why is no real title available?)
• Analysis of support vector machine classification
• Approximation with polynomial kernels and SVM classifiers
• Classification with Gaussians and convex loss
• Fast rates for support vector machines using Gaussian kernels
• Learnability of Gaussians with flexible variances
• Learning Theory
• Learning rates for regularized classifiers using multivariate polynomial kernels
• Learning theory estimates via integral operators and their approximations
• Multi-kernel regularized classifiers
• On the mathematical foundations of learning
• Optimal aggregation of classifiers in statistical learning.
• Regularization networks and support vector machines
• SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Support Vector Machines
• Support vector machine soft margin classifiers: error analysis
• Support vector machines are universally consistent
• Support-vector networks
• Theory of Reproducing Kernels

Cited in

(10)

• Training and testing low-degree polynomial data mappings via linear SVM
• Fast rates for support vector machines using Gaussian kernels
• Learning Theory
• Stretchy binary classification
• Hierarchical learning in polynomial support vector machines
• An Asymptotic Statistical Theory of Polynomial Kernel Methods
• Analysis of Legendre polynomial kernel in support vector machines
• Approximation with polynomial kernels and SVM classifiers
• Learning rates for classification with Gaussian kernels
• Support vector machines learning noisy polynomial rules

This page was built for publication: A note on support vector machines with polynomial kernels

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