How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
One-hidden-layer particle-measure model
Definition
Assume AC for the flow clause below. Let be an input probability space, let , let be measurable, and put for hidden affine parameters . Assume belongs to for each . On , define the feature map . For a finite nonnegative Borel measure on for which the Bochner integral exists, its particle-measure predictor is
The corresponding objective is , whenever the scalar integral is finite, with a risk functional and a regularizer. For the empirical particle law with integer defined on measurable by , one has , so every positive-width finite one-hidden-layer network is a particle-measure predictor (with an optional constant output bias added separately). For width , the zero finite nonnegative measure has Bochner predictor and represents the empty-sum network before adding its optional output bias. This zero measure is a finite-predictor representation; it is not a probability law for the Wasserstein-flow clause. A feature-energy Wasserstein gradient flow means an curve of probability measures satisfying the finite-action continuity equation with Borel velocity equal almost everywhere to the negative minimum-norm element of the constrained subdifferential of the first-variation potential. This is the earlier model-flow definition; no existence or uniqueness follows from this definition. The flow use below requires all of the feature-energy regularity hypotheses. In particular, the classical ReLU feature map is not asserted here to meet those hypotheses merely because it is positively homogeneous.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
16 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Lénaïc Chizat and Francis Bach, On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport (standard reference, not scraped)
- Luigi Ambrosio, Nicola Gigli, and Giuseppe Savaré, Gradient Flows in Metric Spaces and in the Space of Probability Measures (standard reference, not scraped)