Rademacher complexity
nounEtymology Named after Hans Rademacher.
1
In computational learning theory, a measure of the richness of a class of real-valued functions with respect to a probability distribution.
noun
Etymology Named after Hans Rademacher.
In computational learning theory, a measure of the richness of a class of real-valued functions with respect to a probability distribution.
Entry derived from the Wiktionary, under licence CC BY-SA 4.0 — list of authors.
Do you accept non-essential analytics cookies?