The Modern Mathematics of Deep Learning

Bounded update direction

Penguin learning project

The project uses 342 complete Palmer penguin records: 240 training-pool and 102 held-out rows. The selected training rows determine feature scaling and model parameters. Source CSV

This project trains weights with softmax, unlike the homepage lab, which uses nearest species averages. Same penguin measurements; different classification methods. Predictions can differ.

Optimization theory · Study convergence and loss geometry under assumptions.

The project supplies finite observations and fitted parameters. A held-out sample does not establish population bounds or prove a theorem.

Consider this concept alongside the project; its source assumptions may differ. These observations do not prove a theorem.

Input: 12 × 2; Held-out evaluation: 102 · #58 · 40.6 mm, 193 mm. Known answer: Adélie; Prediction: Adélie · [≈0.7383, ≈0.2444, ≈0.01737].

Used in these source sections: 1.2.1 Finding better settings

The condition ‖D⁽ᵏ⁾‖₂ ≤ 1 bounds the Euclidean length of the update direction.

A bound restricts the size of each update direction.

Source formula example

\|D^{(k)}\|_{2}\leq 1

illustration · This checks one update direction; it does not prove the condition for all steps.

Symbols

$D⁽ᵏ⁾$: The update direction at step k.
$\Vert ·\Vert ₂$: Euclidean vector norm.

Source formula example

This source example uses its own inputs and assumptions. Editing it does not change the project.

Edit a value or the code, then run the example. This is a finite demonstration, not a proof of the paper’s theorem.

This example’s data flow

Initial values in code

D = [0.6, 0.8]

Calculated here

Result expression: { D, norm, bounded: norm <= 1 }

norm = Math.sqrt(D.reduce((s, v) => s + v * v, 0)) Uses: D

Returns

Example result

D: array (2 items): [0.6, 0.8]
norm: 1
bounded: true

JavaScript

Read numbers from input and return the result. JavaScript basics.

Result

Enable JavaScript to run this example.

Technical statement

The numerical values are invented unless the source values are stated. This checks one update direction; it does not prove the condition for all steps.

Source: Inline notation