Exercises — Open problems and future directions
This page tests whether you truly own the ideas from the parent note. Every problem has a fully worked solution hidden inside a collapsible callout so you can self-test: read the problem, try it, then reveal.
The problems climb a ladder of difficulty. Before we start, we lock down the one symbol that recurs everywhere, so nothing is used before it is built.
Prerequisite topics you may want open: Statistical Learning Theory, Causal Inference, Transfer Learning, Bayesian Methods.
Level 1 — Recognition
Exercise 1.1
Match each phenomenon to its one-line definition: (a) superposition, (b) catastrophic forgetting, (c) distribution shift, (d) confounder.
Recall Solution
- (a) Superposition — a network stores more concepts than it has neurons by letting features overlap in activation space (e.g. 1000 concepts packed into 100 neurons).
- (b) Catastrophic forgetting — training on Task B overwrites the weights that encoded Task A, so Task A performance collapses.
- (c) Distribution shift — the deployment data differs from the training data , so learned patterns misfire.
- (d) Confounder — a hidden variable that causes both and , creating a correlation between them that is not a cause.
Exercise 1.2
True or false: "With enough passive observational data, a model can always compute ." Explain in one sentence.
Recall Solution
False. Passive observation can only ever refine ; it never becomes when a confounder exists, because observation cannot cut the causal edge the way a real intervention does. You need either a randomized experiment or explicit causal assumptions.
Level 2 — Application
Exercise 2.1
A classifier reaches training risk and, on shifted deployment data, . Compute the distribution shift penalty.
Recall Solution
By definition the penalty is the extra risk from the shift: What this means: 27 percentage points of the model's failure come purely from the world changing, not from an intrinsically hard task.
Exercise 2.2
The ice-cream / drowning tables. Temperature with . Suppose: and on hot days ice cream is almost always sold: , so .
Compute (a) the observational and (b) the interventional . Interpret the gap.
Use the parent formulas:
Recall Solution
(a) Observational — weight by , which leans hot because ice cream co-occurs with heat: (b) Interventional — the operator cuts the edge , so we weight by the natural each: Interpretation: observation says , intervention says . The extra points is pure confounding — forcing everyone to buy ice cream does not drown people; hot weather did the work. The figure below shows the "graph surgery": on the left the arrow from temperature into ice cream is kept (observation); on the right it is cut with the red scissors (). Notice that only the arrow disappears — the arrow driving drownings stays, which is exactly why the interventional number is still nonzero but smaller.

Level 3 — Analysis
Exercise 3.1
The parent note claims a " orders of magnitude" sample-efficiency gap: a child learns a category from about example, a large model from roughly tokens. Express the ratio as an order of magnitude and check the claim.
Recall Solution
Ratio . Taking gives . So the gap is indeed 9 orders of magnitude. The claim checks out. The lesson: adding data linearly cannot close a nine-decade gap; the fix must be structural (better inductive biases), not just bigger datasets.
Exercise 3.2 — Why sharp Hessians make shift catastrophic
The parent note Taylor-expands risk in distribution space. Before using it, we name its two ingredients:
The expansion (a second-order Taylor series, the standard tool for approximating a smooth function near a point): Take the first-order term to be zero (a good model sits near a flat spot where the slope ), , and suppose points along 's top eigenvector with eigenvalue . Estimate the second-order risk increase, and compare to a "flat" model with .
Recall Solution
When aligns with the eigenvector, . So Sharp model: — a risk jump from a tiny shift. Flat model: — a smaller jump for the same shift. Why: the eigenvalue is the curvature of the risk surface. Big curvature = steep valley walls = a small sideways step costs a lot. In the figure below, look at the two parabolas: both start at the same point, but at the same horizontal shift (dotted line) the orange (sharp) curve has climbed to while the teal (flat) curve has barely risen to . The only difference between them is the curvature .

Level 4 — Synthesis
Exercise 4.1 — Design a fair invariance objective
Domain adaptation seeks features — a learned transformation that maps a raw input to a shorter, more useful representation — that look the same across the source (training) and target (deployment) worlds. Two symbols to fix first:
A student proposes minimizing only the KL term. Explain the degenerate solution and repair the objective.
Recall Solution
Degenerate solution: set , a constant, for every input. Then and are both a spike at , so — perfect. But a constant feature carries no information about , so the classifier cannot separate classes: source risk is terrible. Repair: optimize the joint objective with the trade-off knob from above, The first term punishes throwing away label-relevant information (kills the constant collapse); the second term, weighted by , punishes source/target mismatch. The tension between them selects features that are both discriminative and shift-invariant. Choosing too large re-invites the collapse; too small ignores the shift — hence the sweep.
Level 5 — Mastery
Exercise 5.1 — A regularizer against forgetting
Two tasks share a single weight . Task A alone is minimized at with loss . Task B alone is minimized at with loss (Task B's loss is stiffer — coefficient ).
After learning A we want to learn B without forgetting A. Minimize the combined objective The anchor term is an elastic weight consolidation-style penalty: says "how important weight was for Task A". Find , and interpret where it lands relative to and .
Recall Solution
Differentiate and set to zero — the standard tool for a smooth minimum, because at a minimum the slope is flat: Expand: . Interpretation: sits between A's optimum and B's optimum , pulled toward B (weight ) but held back by A's anchor (weight ). It is exactly the precision-weighted average . Larger (A more important) would drag back toward ; would give pure B at (total forgetting). This is the mathematical heart of continual learning. In the figure below, the orange combined curve has its lowest point at (marked dot), sitting between the dotted lines at A's optimum and B's optimum — the anchor pulls the pure-B minimum leftward toward A.

Exercise 5.2 — Limiting cases
Using from 5.1 with general anchor strength , find and evaluate the limits and . Confirm they match the "no memory" and "frozen memory" extremes.
Recall Solution
Same derivative with symbolic :
- : — pure Task B, total catastrophic forgetting of A.
- : — pinned at Task A, frozen, unable to learn B.
- : , matching 5.1. Why this matters: real continual learning tunes per-weight to sit in the useful middle — retain what mattered, still adapt.
Recall Self-check clozes (the hidden words below are blanked out — say each aloud, then reveal to check)
Each ==...== marks a term the vault hides until you tap/reveal it. Cover the line, answer from memory, then reveal.
The observational quantity ML learns is == but interventions require ==. The -operator changes the weighting from to == because it cuts the incoming edge to ==. A large Hessian eigenvalue in distribution space means high curvature, so small shifts cause large risk increases. In EWC-style continual learning, the anchor strength trades forgetting against new-task learning; gives total forgetting, gives a frozen model.