Rademacher complexity
noun1
- In computational learning theory, a measure of the richness of a class of real-valued functions with respect to a probability distribution.
This dictionary works without the internet: on your phone · in Chrome
This dictionary works without the internet: on your phone · in Chrome