Rademacher complexity

短语

释义与例句

n.
  1. 1.

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

词源

Named after Hans Rademacher.

来源：wiktionary