Online regression with unbounded sampling

DOI10.1080/00207160.2011.587510MaRDI QIDQ2885522zbMATH OpenOpenAlexFDO

Authors Zheng-Chu Guo

Publication date 23 May 2012

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

learning theoryonline learningregressionreproducing kernel Hilbert spacesunbounded sampling process

Mathematics Subject Classification ID

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

Recommendations

• Concentration estimates for learning with unbounded sampling
• Analysis of regression algorithms with unbounded sampling
• ERM learning with unbounded sampling
• Integral operator approach to learning theory with unbounded sampling
• Optimal learning rates for least squares regularized regression with unbounded sampling

Cites work

• Learning Theory
• Learning theory estimates via integral operators and their approximations
• Online learning algorithms
• ONLINE LEARNING WITH MARKOV SAMPLING
• Online Regularized Classification Algorithms
• Optimal learning rates for least squares regularized regression with unbounded sampling
• Optimal rates for the regularized least-squares algorithm
• Optimum bounds for the distributions of martingales in Banach spaces
• Shannon sampling. II: Connections to learning theory

Cited in

(6)

• ERM learning with unbounded sampling
• Worst-case regret analysis of computationally budgeted online kernel selection
• Analysis of regression algorithms with unbounded sampling
• Streaming kernel regression with provably adaptive mean, variance, and regularization
• scientific article; zbMATH DE number 7448496 (Why is no real title available?)
• Support vector machines regression with unbounded sampling

This page was built for publication: Online regression with unbounded sampling

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