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.
Clarke chain rule for finite exponential empirical risk
Statement
Let and let be the locally Lipschitz sample-margin functions in a homogeneous-classifier model, and suppose each admits the Clarke chain rule along absolutely continuous arcs. Set . Then
Along every absolutely continuous arc , for almost every and every choice , the derivative is
In particular, if the arc also satisfies the negative Clarke gradient-flow inclusion, its loss derivative is almost everywhere.
Statement references
Facts & Assumptions
Given: The finite sample margins, their local Lipschitz and chain-rule hypotheses, and the empirical exponential risk.
Clarke subdifferential and gradient-flow trajectory: Clarke subdifferentials are closed convex hulls of limiting ordinary gradients and their support functions are the Clarke generalized directional derivatives.
Homogeneous classifier margins and exponential training risk: the empirical exponential risk is the finite sum .
A point outside a nonempty closed convex set is strictly separated from it: a point outside a nonempty closed convex subset of a finite-dimensional Euclidean space is strictly separated from that set by a linear functional.
Proof
Put . At every differentiability point of , ordinary differentiation gives . The exponential has nonzero derivative, so is differentiable exactly where is; passing to limits of gradients and then closed convex hulls as in [F1] gives . Along an absolutely continuous arc, the assumed chain rule for and the one-variable chain rule give for every .
For any direction , the limsup of the finite sum of difference quotients is at most the sum of their limsups, so . The right side is the support function of the nonempty compact convex set by [F1]. If some lay outside , [F3] would give a direction with , contradicting . Thus . Using step 1.1 expands this inclusion to the displayed weighted-margin form.
Summing the ordinary arc derivatives from step 1.1 gives the displayed derivative formula. For a negative Clarke gradient-flow arc, step 2.1 supplies with ; substitution makes the derivative .
Depends on
Used by
Dependency tree · two levels
8 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
- Kaifeng Lyu and Jian Li, Gradient Descent Maximizes the Margin of Homogeneous Neural Networks, Appendix I.2–I.4 (standard reference, not scraped)
- Matus Telgarsky, Deep Learning Theory lecture notes, §§9.1 and 10.2 (standard reference, not scraped)