Rademacher complexity English

Meaning Rademacher complexity meaning

What does Rademacher complexity mean?

Rademacher complexity noun

— In computational learning theory, a measure of the richness of a class of real-valued functions with respect to a probability distribution.