Rademacher complexity
English
Etymology
Named after Hans Rademacher.
Noun
Rademacher complexity
- In computational learning theory, a measure of the richness of a class of real-valued functions with respect to a probability distribution.