Rademacher complexity

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

English Wikipedia has an article on:
Wikipedia

Etymology[edit]

Named after Hans Rademacher.

Noun[edit]

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.
Retrieved from "https://en.wiktionary.org/w/index.php?title=Rademacher_complexity&oldid=43025409"