Absorbing the bias, and what it costs
proof▲▲△The proof in I.2.B03 assumed the bias had been absorbed by appending a constant to every input. Prove the two formulations are equivalent, then show that absorption changes — and quantify the effect on the mistake bound.
Hint
Appending a coordinate changes the norm of every input. Compute the new .
Solution
Step 1 — the construction. Define augmented vectors
Step 2 — the scores agree. By the definition of the inner product,
Identical for every , so the two models classify identically and have the same decision boundary in .
Step 3 — the updates agree. The augmented update is . Reading off its components: the first give , and the last gives . Exactly Definition 7. So the two runs are the same run, step for step.
Step 4 — what it costs. The norm grows:
so the radius becomes , and the bound becomes
Step 5 — quantify. For the data of I.2.B02, so , and against : the numerator rises by . For data scaled so that , the rise is , or . The penalty is severe only when the data lies close to the origin, because then the appended is comparable to the data’s own scale.
The practical reading. This is the same phenomenon as feature scaling. The constant feature has magnitude regardless of the units the other features are measured in, so if the inputs are in millimetres the bias feature is negligible and if they are normalised to unit variance it is not. A bound that changes when you change units is telling you the units matter — and here they do.
Why the theorem is stated in the absorbed form anyway. With separate, Step 2 of I.2.B03 acquires a -update term that must be bounded separately, and the proof becomes two interleaved inductions instead of one. Absorption buys a clean proof at the price of a slightly looser constant, which is the usual trade and worth naming as such rather than hiding.