Hakuluettelo:
Käännös:
Rademacher complexity (suomeksi)
- Määritelmät:
- In computational learning theory, a measure of the richness of a class of real-valued functions with respect to a probability distribution.
Viimeisimmät haut: Rademacher complexity, diapaussi, storm-stayed, skugs, self-fulfillments, plastronal