Rademacher complexity
E1997106
UNEXPLORED
Rademacher complexity is a measure of the richness of a hypothesis class in statistical learning theory, quantifying its capacity to fit random noise and thereby controlling generalization error.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Rademacher complexity canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.