Alphabeta Math
Pipeline-generated
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.

✓ 3 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Bilevel learning, hypergradients, and implicit layers — Examples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A scalar ridge penalty and its validation hypergradient

Example

Let the hyperparameter be λ∈(0,∞) and the inner state be w∈R. For one unit-feature, unit-response training datum, define the scalar ridge objective f(λ,w)=12(w−1)2+λ2w2, and define the validation objective g(w,λ)=12w2. The unique inner minimizer is w∗(λ)=1/(1+λ), so J(λ)=g(w∗(λ),λ)=1/(2(1+λ)2) and J′(λ)=−1/(1+λ)3. The local hypergradient formula gives the same derivative.

Facts & Assumptions

Given: λ>0, f(λ,w)=12(w−1)2+λ2w2, and g(w,λ)=12w2. Verify the stationary branch, direct outer derivative, and hypergradient.

[F1]

Smooth bilevel stationary problems and their hypergradients: H=∂w∇wf, B=∂λ∇wf, J(λ)=g(w∗(λ),λ), and gradients are column vectors.

[F2]

Hypergradient of a smooth local stationary branch: for an invertible stationary Hessian, J′=∂λg−BTH−T∇wg.

Verification

1.1givenF1algebra

Differentiate the inner loss: ∂wf=(1+λ)w−1 and H=1+λ>0. Thus its stationary point is w∗=1/(1+λ). Completing the square gives f(λ,w)=12(1+λ)(w−11+λ)2+λ2(1+λ), so this stationary point is the unique global minimizer.

2.1givenstep 1.1algebra

Substitution into the outer loss gives J(λ)=1/(2(1+λ)2), whose direct derivative is J′(λ)=−1/(1+λ)3.

3.1F1F2step 1.1step 2.1algebra∎

At w∗, the mixed derivative is B=∂λ((1+λ)w−1)=w∗=1/(1+λ), the state derivative is ∇wg=w∗=1/(1+λ), and ∂λg=0. Formula [F2] therefore gives −BH−1∇wg=−1/(1+λ)3, agreeing with step 2.1.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

A singular Hessian leaves the minimizing branch undetermined

Example

For θ∈R and state (u,v)∈R2, let f(θ,(u,v))=12(u−θ)2 and outer objective g((u,v),θ)=v. The global minimizer set is {(θ,v):v∈R} and the inner Hessian is (1000), which is singular. The two smooth minimizing branches (θ,0) and (θ,θ) give outer objectives 0 and θ, with derivatives 0 and 1. Thus without a branch-selection rule the minimizing set determines no unique hypergradient, and the nonsingular-Hessian hypothesis of the local formula fails.

Facts & Assumptions

Given: The smooth inner loss and outer objective in the example. Verify the minimizing set, Hessian, and the two branch derivatives.

[F1]

Smooth bilevel stationary problems and their hypergradients: a local stationary branch is a C1 selection w∗(θ) satisfying the stationarity residual equation.

[F2]

Hypergradient of a smooth local stationary branch: an invertible state Hessian at a stationary base point guarantees a unique local C1 stationary branch and its inverse-Hessian hypergradient formula.

Verification

1.1givenalgebra

The inner loss is nonnegative and equals zero exactly when u=θ, independently of v. Therefore its full global minimizer set is {(θ,v):v∈R}.

1.2givenalgebra

Its state gradient is (u−θ,0)T and its Hessian is (1000), whose kernel contains (0,1)T and is therefore singular.

2.1F1step 1.1givenalgebra

The maps w0∗(θ)=(θ,0) and w1∗(θ)=(θ,θ) are both C1 and lie in the minimizing set from step 1.1 for every θ. Their outer objectives are g(w0∗(θ),θ)=0 and g(w1∗(θ),θ)=θ, so their derivatives are respectively 0 and 1.

3.1F2step 1.2step 2.1algebra∎

Since these two admissible selections yield distinct derivatives and step 1.2 violates the invertibility hypothesis in [F2], the input does not determine one hypergradient through the argmin set, and the local formula does not apply.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

An exact primal state can have a wrong finite-unroll derivative

Example

Fix q∈(0,1) and define G(z,θ)=qz+(1−q)θ for z,θ∈R, with initialization z0(θ)=0, recurrence zk+1(θ)=G(zk(θ),θ), and outer objective g(z,θ)=z. The exact fixed-point branch is z∗(θ)=θ, so the exact hypergradient of J(θ)=g(z∗(θ),θ) is 1. For every finite K≥1, the K-step iterate is zK(θ)=(1−qK)θ. At θ0=0 it equals the exact state and its fixed-point residual rK:=zK(0)−G(zK(0),0) is zero, but its derivative is 1−qK≠1. Thus an exact primal state and zero primal residual do not force the finite-unroll derivative to equal the implicit hypergradient.

Facts & Assumptions

Given: q∈(0,1), G(z,θ)=qz+(1−q)θ, z0(θ)=0, and g(z,θ)=z. For comparison with the stationary-branch formula, set f(θ,z):=12(z−θ)2 on Θ=W=R; both f and g are polynomials, so they meet the C2 and C1 assumptions on these open domains. The stationarity equation is z−θ=0, which is equivalent to z=G(z,θ) because 1−q>0. Compare the exact fixed-point derivative with the derivative of a finite iterate at θ0=0.

[F1]

Smooth bilevel stationary problems and their hypergradients: the exact stationary branch defines the outer objective whose derivative is the implicit hypergradient.

[F2]

Finite fixed-point iteration sensitivity error bounds and the limits of residual control: a finite contraction iterate differentiates its finite composition, and its derivative can differ from the fixed-point sensitivity even with zero primal residual.

[F3]

Hypergradient of a smooth local stationary branch: for a C2 inner objective and C1 outer objective with invertible stationary Hessian, the local branch hypergradient is ∂θg−BTH−T∇zg.

Verification

1.1givenF1algebra

Solving z=G(z,θ) gives (1−q)z=(1−q)θ. Since 1−q>0, the unique fixed point is z∗(θ)=θ, and therefore J(θ)=z∗(θ) has derivative 1. Also Gz=q<1.

1.2givenalgebraconstruct

For K=0, z0(θ)=(1−q0)θ=0. If zK(θ)=(1−qK)θ, then zK+1=q(1−qK)θ+(1−q)θ=(1−qK+1)θ. Induction gives the displayed finite-iterate formula for every K≥1.

2.1F1F3givenstep 1.1algebra

The inner objective has ∂zf=z−θ, so its stationary branch is the same z∗(θ)=θ as the fixed-point branch. Here H=1, B=−1, ∂θg=0, and ∇zg=1. Formula [F3] therefore gives 0−(−1)(1)−1(1)=1, verifying the exact hypergradient under the bilevel prerequisites.

2.2givenstep 1.2algebra

At θ0=0, step 1.2 gives zK(0)=0=z∗(0) and the fixed-point residual is zK(0)−G(zK(0),0)=0−G(0,0)=0. The stopped outer objective is JK(θ)=g(zK(θ),θ)=(1−qK)θ, so JK′(0)=1−qK.

3.1F2step 2.1step 2.2algebra∎

Because 0<q<1 and K≥1, qK>0, hence 1−qK≠1. Thus the zero residual at the exact state does not make the finite-unroll derivative equal to the exact hypergradient.

Sources