DSAverse

Initializing Sorting Algorithms...

Sorting

Trees

Graphs

Preparing interactive visualizations...

Back to Neural Networks

The Perceptron

One artificial neuron: a weighted sum, a threshold, and a learning rule that only moves when it is wrong. Watch it find a line — and fail forever on XOR.

Builds onLogistic Regression Dot Product

Every number computed in your browser

Act 1 of 5 · Neuronstep 1 of 22

w₁

−0.30

w₂

0.10

0.00

X[n, features] =[10, 2]w[2]

Shaded: the side the perceptron calls orange. Dashed red ring: a point on the wrong side. Yellow ring: the point being visited.

Speed

A perceptron is one artificial neuron. It takes the two coordinates of a point, multiplies each by a weight, adds a bias and checks the sign: z = w₁x₁ + w₂x₂ + b, and it answers 1 (orange) when z ≥ 0, else 0 (blue). These 10 points need sorting. It starts with w = (−0.3, 0.1) and b = 0.0.

\hat y = \begin{cases} 1 & w_1x_1 + w_2x_2 + b \ge 0 \\ 0 & \text{otherwise} \end{cases}, \qquad w = (-0.30, 0.10),\; b = 0.00

The Perceptron

One artificial neuron: a weighted sum, a threshold, and a learning rule that only moves when it is wrong. Watch it find a line — and fail forever on XOR.

Builds onLogistic Regression Dot Product

Every number computed in your browser

Act 1 of 5 · Neuronstep 1 of 22

w₁

−0.30

w₂

0.10

0.00

X[n, features] =[10, 2]w[2]

Shaded: the side the perceptron calls orange. Dashed red ring: a point on the wrong side. Yellow ring: the point being visited.

Speed

\hat y = \begin{cases} 1 & w_1x_1 + w_2x_2 + b \ge 0 \\ 0 & \text{otherwise} \end{cases}, \qquad w = (-0.30, 0.10),\; b = 0.00

DSAverse

The Perceptron

See also

The Perceptron

See also