Universality in approximation and estimation

MaRDI QIDQ5432207zbMATH OpenFDO

Authors V. N. Templyakov

Publication date 2 January 2008

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to approximations and expansions (41-02) Best approximation, Chebyshev systems (41A50) Approximation by arbitrary linear expressions (41A45) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Recommendations

• On universal estimators in learning theory
• Note on universal algorithms for learning theory
• Universal algorithms for learning theory. I: Piecewise constant functions.
• Universal algorithms for learning theory. II: Piecewise polynomial functions
• Universal piecewise polynomial estimators for machine learning

Cited in

(8)

• On universal estimators in learning theory
• Universal Gaussian approximations under random censorship
• Universal algorithms for learning theory. I: Piecewise constant functions.
• Universal piecewise polynomial estimators for machine learning
• scientific article; zbMATH DE number 3233284 (Why is no real title available?)
• Universal algorithms for learning theory. II: Piecewise polynomial functions
• Note on universal algorithms for learning theory
• Effective estimates for unirationality

This page was built for publication: Universality in approximation and estimation

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