The Modern Mathematics of Deep Learning

Approximation count scaling

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: 3.1 A rule based on distance

The ratio d/ε combines the input dimension d and positive approximation tolerance ε.

It is used to describe how a construction scales with dimension and precision.

Source formula example

d/{\varepsilon}

illustration · This evaluates the ratio; it does not establish the source complexity bound.

Symbols

$d$: Input dimension.
$ε$: A positive approximation tolerance.

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 = 4
epsilon = 0.25

Calculated here

Result expression: { d, epsilon, ratio: d / epsilon }

Returns

Example result

d: 4
epsilon: 0.25
ratio: 16

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. This evaluates the ratio; it does not establish the source complexity bound.

Source: Inline notation