Page 3 of 8~112 min topic

Deep learning

Build the first working two-layer XOR network

Page 3 implements the shortest complete path for the two-layer XOR network with inspectable intermediate values.

~14 min this pageImplementation

1Learn the idea

Read

Implement the minimal working path

Build only what the claim requires: two-layer net reaches XOR solutions that a single neuron cannot. Prefer boring, deterministic code over frameworks you cannot yet explain. Run the path twice; identical output on this fixture is a feature, not a lack of creativity.

Read

Run the working path

def xor_net(x):
 h1=max(0,x[0]-x[1]); h2=max(0,x[1]-x[0])
 return int(h1+h2>=.5)
print([xor_net(x) for x in [(0,0),(0,1),(1,0),(1,1)]])

Expected evidence: dead or dimensionally broken network. Read each printed intermediate as part of the argument that the path works—not as decoration.

Read

Trace one input end to end

Narrate the journey from raw input to result for a single example from XOR four-row table. If you cannot name an intermediate, the implementation is still too opaque for this lab. Only after this path is solid should you generalize data sources or UI.

Read

Lab notebook: intermediates worth printing

While implementing the two-layer XOR network, print or log at least three intermediates that map to the claim (two-layer net reaches XOR solutions that a single neuron cannot). Good intermediates are values a teammate could recompute with a calculator or diff. Bad intermediates are framework traces you cannot explain.

Re-run with XOR four-row table twice. If the second run differs, either the path is nondeterministic (document the seed) or you have hidden global state—both are lab bugs until named.

Read

Worked judgment

Stop adding features once the path supports show why a hidden layer is required for XOR while keeping the net tiny. Extra UI, extra tools, or extra models belong in later chapters. The mastery bar for this page is simply: a deterministic end-to-end path with intermediates.

Read

Why this stage matters for the two-layer XOR network

At the implementation stage for deep-learning-basics, the job is narrower than finishing a product demo. You are creating one progressive evidence piece about XOR four-row table that later pages inherit without redefining success. Keep that fixture small enough to inspect by hand, keep outputs copy-pasteable as text, and refuse to narrate this baseline as if it were a production SLA: single-neuron XOR attempt recorded as failing.

For this page specifically, success looks like a deterministic path with printed intermediates while still centering the user decision to show why a hidden layer is required for XOR while keeping the net tiny. If you cannot point to a file, command, or assertion that proves that for the two-layer XOR network, stay on this page instead of advancing.

Glossary: deep learning · Glossary: loss function

Previous · Next

Go deeper

Before you start

Why this matters

Without running code, predict the final output for fixture XOR four-row table. Name one intermediate value that would prove the prediction. Then answer: what could look successful while actually being wrong at this stage for the two-layer XOR network?

Check your understanding

Page assessment

Answer from memory. Completion is saved from this evidence, not from opening the next page.

1. Can you narrate every intermediate value?
2. Is the fixture deterministic and independently inspectable?
3. Did you avoid framework behavior you cannot explain yet?
4. Does the output still support the decision: show why a hidden layer is required for XOR while keeping the net tiny?

All responses are required.