In other words, the above theorem implies that if we add the conditions defined in Equation (4)) to Ng's theorem, it is possible to obtain a succinct representation (Equation (5)) whose predictive performance is nearly as good as that of Ng's theorem, albeit with a probabilistic penalty f 1 (m) and an error penalty f 2 (m).
the penalties are negligible because f 1 (m) = o(1) and f 2 (m) = o(1).