Theoremcore
Perceptron convergence theorem
Also called Novikoff's theorem.
On linearly separable data the perceptron makes a bounded number of mistakes.
On linearly separable data the perceptron makes a bounded number of mistakes.
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 8TYE96 Edit this page History Report an error