The Modern Mathematics of Deep Learningexplained for non-mathematicians

Inverse square-root factor

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.

Approximation and depth · Study approximation error and network size under stated conditions.

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: 4.2 Approximating with random pieces

n⁻¹ᐟ² equals 1/√n for positive n. The source uses it as an approximation-rate factor.

The factor decreases as the number of features grows.

Source formula example

n−1/2n^{-1/2}

illustration · This evaluates one factor; it does not prove an approximation rate or identify its hidden constants.

Symbols

nn
A positive integer feature count.

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

  • n = 4

Calculated here

Result expression: { n, factor: 1 / Math.sqrt(n) }

Returns

Example result
n
4
factor
0.5

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 a source value is specified. This evaluates one factor; it does not prove an approximation rate or identify its hidden constants.

Source: Inline notation