ES 667 · Lecture 5 Computed from the four-point line-fitting example

Learning-rate schedules

A fixed rate makes one compromise for the whole run. First compare the compromise; then watch a decaying rate keep the fast start and settle down later.

A large fixed rate reaches a useful region sooner

Both runs see exactly the same examples in the same order. The only change is the learning rate. We mark the first update where the full-loss gap falls below 0.5.

Controlled comparisonSame dataset, initial parameters, sampled indices, and 80-update window.
larger fixed rateθₜ₊₁ = θₜ − 0.10 gₜ
smaller fixed rateθₜ₊₁ = θₜ − 0.02 gₜ

Full-loss gap during the first 80 updates

fixed η = 0.10 fixed η = 0.02 gap = 0.5
update 0 / 80
fixed η = 0.10
first gap below 0.5not reached
update 8 gap0.386
roletravel quickly
fixed η = 0.02
first gap below 0.5not reached
update 56 gap0.499
trade-offarrives later

The small rate is not wrong; it is slow when distance matters

A large rate gets into the useful region seven times sooner in this run. The next question is whether we must keep taking those large steps after we arrive.

8 vs 56first threshold crossing, not a universal speed ratio

Exact experiment. Example A uses x = [−1, 0, 1, 2], y = [−1, 1, 3, 6], and θ₀ = (2, −1). The 360 sampled indices are the exact output of numpy.random.default_rng(12).integers(0, 4, 360).

Checking deterministic results…