Support vector machines regression with unbounded sampling

DOI10.1080/00036811.2018.1437416MaRDI QIDQ5379431zbMATH OpenOpenAlexFDO

Authors Hongzhi Tong, Di-Rong Chen, Fenghong Yang

Publication date 12 June 2019

Published in Applicable Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00036811.2018.1437416

zbMATH Keywords

Hoeffding inequalitylearning ratesupport vector machines regressionunbounded sampling

Mathematics Subject Classification ID

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

Recommendations

• Analysis of regression algorithms with unbounded sampling
• Optimal learning rates for least squares regularized regression with unbounded sampling
• Coefficient-based regularized regression with dependent and unbounded sampling
• Concentration estimates for learning with unbounded sampling
• ERM learning with unbounded sampling

Cites work

• Analysis of support vector machines regression
• Approximation analysis of learning algorithms for support vector regression and quantile regression
• Best choices for regularization parameters in learning theory: on the bias-variance problem.
• Capacity of reproducing kernel spaces in learning theory
• Coefficient-based regression with non-identical unbounded sampling
• Coefficient-based regularized regression with indefinite kernels by unbounded sampling
• Concentration estimates for learning with unbounded sampling
• Convergence analysis of coefficient-based regularization under moment incremental condition
• Elastic-net regularization in learning theory
• ERM learning with unbounded sampling
• ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
• Fast rates for support vector machines using Gaussian kernels
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 823069 (Why is no real title available?)
• Integral operator approach to learning theory with unbounded sampling
• Learning rates of least-square regularized regression
• Learning Theory
• Learning with varying insensitive loss
• On the mathematical foundations of learning
• Online regression with unbounded sampling
• Optimal convergence rates of high order Parzen windows with unbounded sampling
• Optimal learning rates for least squares regularized regression with unbounded sampling
• Optimal rates for the regularized least-squares algorithm
• Regularization networks and support vector machines
• Regularized least square regression with unbounded and dependent sampling
• Statistical analysis of the moving least-squares method with unbounded sampling
• Support Vector Machines
• The covering number in learning theory
• Theory of Reproducing Kernels

Cited in

(2)

• ERM learning with unbounded sampling
• Analysis of regression algorithms with unbounded sampling

This page was built for publication: Support vector machines regression with unbounded sampling

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