XOR Solution using NN
We all know the XOR problem is not linearly solvable.
Here is my pure math solution
Slow down to watch updates
Epochs: 0
Error: 0
Inputs:[
00,
01,
10,
11,
] Output:[0,
1,
1,
0,
]The chart prints error for every 100 epochs. The error may increase in the first few 100 epochs and then start to decrease.
This Implementation is a JS modification to solve XOR problem using a NN
Its similar to my Python Implementation of NN from scratch here