Rademacher complexity
Meanings
noun
- In computational learning theory, a measure of the richness of a class of real-valued functions with respect to a probability distribution.
Word forms
Etymology
Named after Hans Rademacher.
Previous
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.