Risk bounds for random regression graphs

DOI10.1007/S10208-006-0217-2MaRDI QIDQ941786zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Andrea Caponnetto, Stephen Smale

Publication date 2 September 2008

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10208-006-0217-2

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial probability (60C05)

Recommendations

• Risk Bounds for CART Regression Trees
• Universal algorithms for learning theory. I: Piecewise constant functions.
• L'estimateur de ≪ mélange progressif ≫ appliqué aux arbres de régression
• The progressive mixture estimator for regression trees.
• Universal algorithms for learning theory. II: Piecewise polynomial functions

Cited in

(6)

• Risk Bounds for CART Regression Trees
• Reproducing kernels and choices of associated feature spaces, in the form of \(L^2\)-spaces
• A tree-based regressor that adapts to intrinsic dimension
• Higher Order Difference Operators and Associated Relative Reproducing Kernel Hilbert Spaces
• High order Parzen windows and randomized sampling
• Risk bounds for statistical learning

This page was built for publication: Risk bounds for random regression graphs

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