Rademacher complexity

English dictionary entry

Meanings

noun
  1. In computational learning theory, a measure of the richness of a class of real-valued functions with respect to a probability distribution.

Word forms

Rademacher complexity

Etymology

Named after Hans Rademacher.

This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.