Partition of unity
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.
Local structure · Describe charts, local coordinates and localization.
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.1 When data live on a smaller shape
A partition of unity is a collection of nonnegative functions whose values add to one on the domain. The source uses them to localize a function to chart neighborhoods.
Local contributions can be combined to recover a global function.
Source formula example
illustration · This finite calculation uses two functions on [0,1]; the support and smoothness conditions in the source need additional verification.
Symbols
- A partition function.
- A point in the domain.
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
Code changed. Reset to restore this example’s data flow.
Initial values in code
x=0.25
Calculated here
Result expression: { x, phi1, phi2, sum: phi1 + phi2 }
phi1=1 - xUses:xphi2=xUses:x
Returns
x- 0.25
phi1- 0.75
phi2- 0.25
sum- 1
Read numbers from input and return the result. JavaScript basics.
Result
Technical statement
The numerical values are invented. This finite calculation uses two functions on [0,1]; the support and smoothness conditions in the source need additional verification.
Source: Inline notation