Rademacher complexity

English

Etymology

Named after Hans Rademacher.

Noun

Rademacher complexity

  1. In computational learning theory, a measure of the richness of a class of real-valued functions with respect to a probability distribution.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.