Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck pass
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 N,d≥1 and let q1,…,qN:Rd→R be the locally Lipschitz sample-margin functions in a homogeneous-classifier model, and suppose each qi admits the Clarke chain rule along absolutely continuous arcs. Set L(θ)=∑i=1Ne−qi(θ). Then

∂∘L(θ)⊆{−∑i=1Ne−qi(θ)hi:hi∈∂∘qi(θ)}.

Along every absolutely continuous arc θ(t), for almost every t and every choice hi(t)∈∂∘qi(θ(t)), the derivative is

ddtL(θ(t))=−⟨∑i=1Ne−qi(θ(t))hi(t),θ˙(t)⟩.

In particular, if the arc also satisfies the negative Clarke gradient-flow inclusion, its loss derivative is −∥θ˙(t)∥22 almost everywhere.

Facts & Assumptions

Given: The finite sample margins, their local Lipschitz and chain-rule hypotheses, and the empirical exponential risk.

[F1]

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.

[F2]

Homogeneous classifier margins and exponential training risk: the empirical exponential risk is the finite sum L=∑ie−qi.

[F3]

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

technique · apply the smooth scalar chain rule to each margin and use support functions to prove the finite-sum subdifferential inclusion
1.1F1F2givenalgebra

Put fi(θ)=e−qi(θ). At every differentiability point of qi, ordinary differentiation gives ∇fi=−e−qi∇qi. The exponential has nonzero derivative, so fi is differentiable exactly where qi is; passing to limits of gradients and then closed convex hulls as in [F1] gives ∂∘fi(θ)=−e−qi(θ)∂∘qi(θ). Along an absolutely continuous arc, the assumed chain rule for qi and the one-variable chain rule give (fi∘θ)′=−e−qi⟨hi,θ˙⟩ for every hi∈∂∘qi(θ).

2.1F1F2F3step 1.1algebra

For any direction v, the limsup of the finite sum of difference quotients is at most the sum of their limsups, so L∘(θ;v)≤∑ifi∘(θ;v). The right side is the support function of the nonempty compact convex set C:=∑i∂∘fi(θ) by [F1]. If some g∈∂∘L(θ) lay outside C, [F3] would give a direction v with ⟨g,v⟩>sup⁡c∈C⟨c,v⟩=∑ifi∘(θ;v), contradicting ⟨g,v⟩≤L∘(θ;v). Thus ∂∘L(θ)⊆C. Using step 1.1 expands this inclusion to the displayed weighted-margin form.

3.1step 1.1step 2.1algebra∎

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 hi with θ˙=∑ie−qihi; substitution makes the derivative −⟨θ˙,θ˙⟩=−∥θ˙∥22.

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