Intelligence compounds.

Step 1 of 4 / Define

Define the task and keep some points aside.

Can a local average reduce noise in a measured signal? Seven training points are what we run and tune on. Seven other points are held out, and used only to check the result.

Training: measured

2, 4, 3, 5, 8, 6, 9

Training: reference

2, 3, 4, 5, 6, 7, 8

Held-out: measured

4, 2, 6, 5, 9, 7, 8

Held-out: reference

3, 4, 5, 6, 7, 8, 9

Step 2 of 4 / Run

Run a baseline.

The first method returns each measurement unchanged. Its output is the starting point that any proposed change has to beat.

output[i] = measured[i]

Baseline output (training)

2, 4, 3, 5, 8, 6, 9

Step 3 of 4 / Evaluate

Score it on both sets.

Compare each output with its reference, square the differences, and take the mean. Lower is better. The training error is measured on points we tune against; the held-out error is measured on points we never touch.

error = mean((output − reference)²)

Baseline training error

1.143

Baseline held-out error

1.857

Step 4 of 4 / Improve

Propose a change. Keep it only if it holds up.

The proposal averages each measurement with its neighbors; at the two edges it averages two points. The rule: accept it only if the held-out error drops as well as the training error.

output[i] = mean(measured[max(0,i−1):i+2])

Candidate output (training)

3, 3, 4, 5.333, 6.333, 7.667, 7.5

Training error

1.143 → 0.274

Held-out error

1.857 → 0.448

Decision

Accepted: both errors dropped

For contrast, a shortcut that copies the training answers scores 0.000 on training but 2.857 on held-out, worse than the baseline. The rule rejects it. Two small sets still cannot show that the neighbor average generalizes; that would take more signals.