Generalization bounds of a compressed regression learning algorithm

MaRDI QIDQ5257648zbMATH OpenFDO

Authors Yongquan Zhang, Youmei Li

Publication date 29 June 2015

zbMATH Keywords

learning theorygeneralization errorRBF neural networkGaussian kernels

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Generalization bounds of compressed regression learning algorithm
• Learning with generalization capability by kernel methods of bounded complexity
• Optimal rate of the regularized regression learning algorithm
• Learning rates of least-square regularized regression
• Error bounds for learning the kernel

Cited in

(9)

• PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
• Generalization bounds of regularization algorithms derived simultaneously through hypothesis space complexity, algorithmic stability and data quality
• scientific article; zbMATH DE number 6999917 (Why is no real title available?)
• Estimates on compressed neural networks regression
• Generalization bounds of compressed regression learning algorithm
• Generalization error rates in kernel regression: the crossover from the noiseless to noisy regime*
• Asymptotic analysis of the learning curve for Gaussian process regression
• Error bounds for learning the kernel
• On the V_ dimension of regressive loss functions in RKHS

This page was built for publication: Generalization bounds of a compressed regression learning algorithm

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