Rademacher complexity

名词 n.

英文释义

名词 n.
  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.
0 次浏览 数据来源: Wiktionary