Loss functions
Define the regression loss workbench data contract
Page 2 advances one concrete regression loss workbench: explain the decision, run the code, inspect failure, measure evidence, and keep only what is ready to ship.
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 wrong or deceptive loss signal. 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
Make malformed input fail before it reaches the interesting algorithm. The accepted contract is equal-length finite numeric target and prediction lists. This boundary matters because silent truncation from zip, NaN values, unit mismatch, and optimizing a score that does not match product cost; allowing a bad value through makes later debugging look like an algorithm problem. Keep transformation functions separate from scoring or prediction so a test can identify which boundary changed the data.
The artifact's user-facing goal is specific: compare mean squared error and mean absolute error on ordinary predictions and one costly outlier. Its accepted input is equal-length finite numeric target and prediction lists. 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 example implements or probes the input boundary. Copy it into a fresh file and run it without extra packages.
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.
import math
def valid(a,b): return len(a)==len(b)>0 and all(math.isfinite(x) for x in a+b)
print(valid([1,2],[1.2,1.8])); assert not valid([1],[1,2])
Expected output: True, while the unequal arrays assertion passes. 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
Print every residual and transformed contribution before averaging. A single large squared term should visibly dominate MSE; if it does not, verify operand order, exponent placement, and the denominator. Reject unequal lengths because Python's zip silently drops extras. Reject NaN and infinity before aggregation, and keep target units visible so a mathematically correct score is not interpreted in the wrong scale.
At the data contract 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
Compare MAE and MSE on the same holdout rows and show the largest contributor to each. Then translate the error into the product unit, such as minutes, dollars, or degrees. If underprediction costs more than overprediction, evaluate an asymmetric business cost separately; do not claim that minimizing a convenient textbook loss automatically minimizes operational harm.
For this data contract 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.
Continue learning · glossary & guides
- [ ] Which malformed values are rejected before the algorithm?
- [ ] Can transformation and prediction be tested separately?
- [ ] Does the error identify the violated field or shape?
- [ ] Can I explain which rows dominate each loss and why?