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 , let and be open, and let be and be . Here means continuously differentiable on the open domain, and 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 , define the inner stationarity residual , its state Jacobian , and its parameter Jacobian . Thus is the inner Hessian and is the mixed derivative of the inner gradient. A point is stationary when . If a map , for open neighborhoods of and of , satisfies and for all , it is a local stationary branch. The associated outer objective is , and its column gradient is called the hypergradient of that branch. The definition of a local stationary branch imposes no global-minimality requirement.
For , the phrase globally -strongly convex in means that is defined on all of and, for every , satisfies
Depends on
Used by
- Adjoint hypergradient with a measured linear-solve residual Algorithm
- A scalar ridge penalty and its validation hypergradient Example
- A singular Hessian leaves the minimizing branch undetermined Example
- An exact primal state can have a wrong finite-unroll derivative Example
- Exact stationary sensitivities and finite training derivatives are different Remark
- Hypergradient of a smooth local stationary branch Theorem
- Residual bounds for exact and approximate-state adjoint hypergradients Theorem
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
- Stephen Gould et al., On Differentiating Parameterized Argmin and Argmax Problems with Application to Bi-level Optimization, §3 (standard reference, not scraped)
- MIT OpenCourseWare 18.S096, Matrix Calculus for Machine Learning and Beyond, Lecture 4 Part 2, §6.3.1 (standard reference, not scraped)
- J. Lebl, Basic Analysis II, §8.5.1 (standard reference, not scraped)