Universal piecewise polynomial estimators for machine learning

MaRDI QIDQ5432217zbMATH OpenFDO

Authors Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald DeVore

Publication date 2 January 2008

zbMATH Keywords

computational efficiencyconvergencemathematical learning theorynonlinear methodspiecewise polynomial estimatorsregressionwavelet expansions

Mathematics Subject Classification ID

General nonlinear regression (62J02) Numerical methods for wavelets (65T60) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Universal algorithms for learning theory. II: Piecewise polynomial functions
• Universal algorithms for learning theory. I: Piecewise constant functions.
• On universal estimators in learning theory
• Optimal rates of convergence for the piecewlse polynomial estimator with the index chosen by the fpe selection rule
• Universality in approximation and estimation

Cited in

(6)

• Piece-wise quadratic approximations of arbitrary error functions for fast and robust machine learning
• Universal algorithms for learning theory. II: Piecewise polynomial functions
• Note on universal algorithms for learning theory
• Universal algorithms for learning theory. I: Piecewise constant functions.
• Universality in approximation and estimation
• Introduction: Wolfgang Dahmen's mathematical work (as of 2009)

This page was built for publication: Universal piecewise polynomial estimators for machine learning

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