Home
Random
Nearby
Log in
Settings
Donate
About Wikidata
Disclaimers
Search
(Q18354077)
Watch
English
Sample complexity
attribute of machine learning models
In more languages
edit
Statements
defining formula
n
>
N
:
P
r
ρ
n
[
E
(
h
n
)
−
E
H
∗
≥
ε
]
<
δ
.
{\displaystyle n>N:Pr_{\rho ^{n}}[{\mathcal {E}}(h_{n})-{\mathcal {E}}_{\mathcal {H}}^{*}\geq \varepsilon ]<\delta .}
1 reference
imported from Wikimedia project
English Wikipedia
maintained by WikiProject
WikiProject Mathematics
0 references
Identifiers
Encyclopedia of China (Third Edition) ID
41644
0 references
Freebase ID
/m/0114dpwp
0 references
Microsoft Academic ID
2778445095
0 references
OpenAlex ID
C2778445095
1 reference
stated in
OpenAlex
retrieved
26 January 2022
reference URL
https://docs.openalex.org/download-snapshot/snapshot-data-format
Quora topic ID
Sample-Complexity
1 reference
stated in
Quora
Sitelinks
Wikipedia
(3 entries)
edit
enwiki
Sample complexity
fawiki
پیچیدگی نمونه
srwiki
Složenost uzorka
Wikibooks
(0 entries)
edit
Wikinews
(0 entries)
edit
Wikiquote
(0 entries)
edit
Wikisource
(0 entries)
edit
Wikiversity
(0 entries)
edit
Wikivoyage
(0 entries)
edit
Wiktionary
(0 entries)
edit
Multilingual sites
(0 entries)
edit
![{\displaystyle n>N:Pr_{\rho ^{n}}[{\mathcal {E}}(h_{n})-{\mathcal {E}}_{\mathcal {H}}^{*}\geq \varepsilon ]<\delta .}](https://wikimedia.org/api/rest_v1/media/math/render/svg/2da99b452d9daa2f0ae5ff36f7e8967047b11e61)
