Skip to content
nonconvexcard

XOR is not linearly separable

ProofFoundation⏱ 15 minDeep Learningperceptronxorseparability

Problem

Prove there is no (w,b)(w,b) with sign⁡(⟨w,x⟩+b)\sign(\langle w,x\rangle+b) equal to XOR on {0,1}2\{0,1\}^2, then exhibit a two-hidden-unit ReLU network that computes it exactly.

Write a complete argument. Every inequality you use should be one you could state precisely.

Solution

Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.

Related problems

All problems
SolvedProblemFieldTypeDifficultyTime
The proximal operator of the l1 normAdvanced OptimizationProofBeginner15 min
Derive the backpropagation recursionDeep LearningProofIntermediate30 min
Gradient magnitude through a deep chainDeep LearningProofIntermediate30 min
Implement backpropagation from scratch runDeep LearningCodingIntermediate3 hours
Logistic regression diverges on separable dataClassical MLProofIntermediate30 min