Theoremadvanced
Cover-Hart theorem
Also called nearest neighbor error bound.
The 1-nearest-neighbor error is at most about twice the Bayes error.
The 1-nearest-neighbor error is at most about twice the Bayes error.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag B8ZFXM Edit this page History Report an error