Note on universal algorithms for learning theory
From MaRDI portal
Abstract: We propose the general way of study the universal estimator for the regression problem in learning theory considered in "Universal algorithms for learning theory Part I: piecewise constant functions" and "Universal algorithms for learning theory Part II: piecewise constant functions" written by Binev, P., Cohen, A., Dahmen, W., DeVore, R., Temlyakov, V. This new approch allows us to improve results.
Recommendations
- On universal estimators in learning theory
- Universal algorithms for learning theory. I: Piecewise constant functions.
- Universality in approximation and estimation
- Universal algorithms for learning theory. II: Piecewise polynomial functions
- Universal piecewise polynomial estimators for machine learning
Cited in
(8)- Remarks on computational learning theory
- Putnam's diagonal argument and the impossibility of a universal learning machine
- On universal estimators in learning theory
- An algorithmic theory of learning: Robust concepts and random projection
- On extension theorems and their connection to universal consistency in machine learning
- Universal algorithms for learning theory. I: Piecewise constant functions.
- Universality in approximation and estimation
- An algorithmic theory of learning: robust concepts and random projection
This page was built for publication: Note on universal algorithms for learning theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3441403)
