Bernstein polynomials and learning theory
From MaRDI portal
Publication:596812
DOI10.1016/j.jat.2004.04.010zbMath1068.41009OpenAlexW2125232050MaRDI QIDQ596812
Publication date: 10 August 2004
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2004.04.010
Computational learning theory (68Q32) Approximation by polynomials (41A10) Approximation by positive operators (41A36)
Related Items
Minimax estimation of qubit states with Bures risk ⋮ Unnamed Item ⋮ Confidence regions and minimax rates in outlier-robust estimation on the probability simplex ⋮ Universal Features for High-Dimensional Learning and Inference
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- \(K\)-moduli, moduli of smoothness, and Bernstein polynomials on a simplex
- The lower estimate for linear positive operators. II
- The genuine Bernstein-Durrmmeyer operator on a simplex
- Relative expected instantaneous loss bounds
- Approximation by Bernstein Polynomials
- Laplace's law of succession and universal encoding
- Admissibility properties or Gilbert's encoding for unknown source probabilities (Corresp.)
This page was built for publication: Bernstein polynomials and learning theory