Bernstein polynomials and learning theory Original Research Article

When learning processes depend on samples but not on the order of the information in the sample, then the Bernoulli distribution is relevant and Bernstein polynomials enter into the analysis. We derive estimates of the approximation of the entropy function x log x that are sharper than the bounds from Voronovskajaʹs theorem. In this way we get the correct asymptotics for the Kullback–Leibler distance for an encoding problem.