Chapter DNeural nets by buildingPage 6 of 8

Neural nets by building

Instrument the single-neuron logic-gate trainer

Page 6 advances one concrete single-neuron logic-gate trainer: explain the decision, run the code, inspect failure, measure evidence, and keep only what is ready to ship.

~14 minTesting and observability

Before you start

Why this matters

Without running code, predict the output of this page's example and name the intermediate value that would prove your prediction. Then write one sentence answering: “What could look successful while actually being wrong?” For this stage, focus on neuron that will not learn OR. Keep the prediction nearby; comparing it with the real output is the first debugging exercise, not a quiz about syntax.

1Learn the idea

Read

Build focus

Instrumentation should explain behavior without collecting the raw material unnecessarily. For this artifact, record enough to calculate binary cross-entropy, four-example accuracy, parameter gradient magnitude, and the probability margin around 0.5. Include version or configuration identifiers so two runs can be compared. A log line is useful only if it answers a debugging question; dumping entire inputs creates noise and may create a privacy problem.

The artifact's user-facing goal is specific: learn weights and a bias that reproduce the OR truth table instead of hand-tuning until one example happens to pass. Its accepted input is four binary input pairs with binary OR targets. Those statements are intentionally narrower than “build an AI system.” Narrow scope lets us inspect every input and expected result, and it prevents a toy result from being presented as a production claim. The sample emits a compact metric record that a test or dashboard could aggregate.

Read

Run the example

Save this as lesson.py and run python3 lesson.py. It uses only the language standard library, so the example is reproducible offline.

trace={'epoch':200,'loss':0.14,'grad_norm':0.03,'min_margin':0.31}
assert trace['grad_norm']>0 and trace['min_margin']>0
print(trace)

Expected output: a trace with nonzero gradient and positive margin. Exact floating-point formatting may vary slightly, but the asserted behavior must not. Read the output as evidence about this stage, not merely proof that the interpreter started.

Read

Debug the stage

Trace z, sigmoid probability, error, and each parameter update for one OR example. If loss stays near 0.693, confirm that the bias changes and that labels are numeric zero or one. Clamp only the exponential input for numerical stability; do not clamp the learned probability so aggressively that gradients disappear. When rounded accuracy looks perfect, inspect probability margins to catch a brittle decision near 0.5.

At the testing and observability stage, save the smallest failing fixture beside the expected result. Change one cause at a time and rerun the exact command printed above; that makes the repair reviewable and keeps this chapter's progressive artifact reproducible.

Read

Evaluate before continuing

Evaluate all four truth-table rows every time—there is no reason to sample a four-row domain. Show cross-entropy, exact accuracy, minimum distance from 0.5, and learned weights. Compare against constant-zero and constant-one baselines. The neuron has mastered OR only when every row passes and the probabilities are comfortably on the correct side of the threshold.

For this testing and observability page, preserve the fixture and result as evidence for the next page. Label observations separately from conclusions: a passing assertion establishes the behavior it names, while broader usefulness requires the chapter's full evaluation set and stated operating limits.

Checking tutor…

Continue learning · glossary & guides
  • [ ] Can an event distinguish configuration, failure class, and duration?
  • [ ] Did I avoid logging secrets or unnecessary raw input?
  • [ ] Can two runs be compared with the recorded fields?
  • [ ] Can I show how the bias and both weights change OR probabilities?

Glossary: deep learning · Glossary: gradient descent

Previous · Next