Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Smooth bilevel stationary problems and their hypergradients

Definition

Let p,d≥1, let Θ⊆Rp and W⊆Rd be open, and let f:Θ×W→R be C2 and g:W×Θ→R be C1. Here C1 means continuously differentiable on the open domain, and C2 means that the derivative map is itself continuously differentiable. Gradients are column vectors, vector norms are Euclidean, and the norm of a matrix or linear map is the induced Euclidean operator norm.

For (θ,w)∈Θ×W, define the inner stationarity residual F(θ,w):=∇wf(θ,w)∈Rd, its state Jacobian H(θ,w):=DwF(θ,w)∈Rd×d, and its parameter Jacobian B(θ,w):=DθF(θ,w)∈Rd×p. Thus H is the inner Hessian and B is the mixed derivative of the inner gradient. A point (θ0,w0) is stationary when F(θ0,w0)=0. If a C1 map w∗:P→Q, for open neighborhoods P⊆Θ of θ0 and Q⊆W of w0, satisfies w∗(θ0)=w0 and F(θ,w∗(θ))=0 for all θ∈P, it is a local stationary branch. The associated outer objective is J(θ):=g(w∗(θ),θ), and its column gradient ∇θJ is called the hypergradient of that branch. The definition of a local stationary branch imposes no global-minimality requirement.

For μ>0, the phrase globally μ-strongly convex in w means that f(θ,⋅) is defined on all of Rd and, for every u,v∈Rd, satisfies

f(θ,v)≥f(θ,u)+∇wf(θ,u)T(v−u)+μ2∥v−u∥22.

Depends on

Used by

Dependency tree · two levels

5 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