Rademacher complexity
id:
rademacher-complexity-273-10738363
title:
Rademacher complexity
text:
In computational learning theory, Rademacher complexity, named after Hans Rademacher, measures richness of a class of sets with respect to a probability distribution. The concept can also be extended to real valued functions.
brand slug:
wiki
category slug:
encyclopedia
description:
Measure of complexity of real-valued functions
original url:
https://en.wikipedia.org/wiki/Rademacher_complexity
date created:
date modified:
2024-04-21T16:41:33Z
main entity:
{"identifier":"Q22305517","url":"https://www.wikidata.org/entity/Q22305517"}
image:
fields total:
13
integrity:
14