Alex's Notes

Home

❯

general

❯

The perceptron rule using binary step converges in finite time if the dataset is linearly separable

The perceptron rule using binary step converges in finite time if the dataset is linearly separable

Jan 20, 20241 min read

  • maths

Statement

Lemma

The perceptron rule using binary step activation function converges in finite time if and only if the dataset is linearly separable.

Proof


Graph View

  • Statement
  • Proof

Backlinks

  • Week 2 - Neural networks
  • Perceptron rule

Created with Quartz v4.5.1 © 2025

  • GitHub
  • Discord Community