Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

Finite-budget regularized gradient on a Stiefel constraint

Definition

For integers 1≤p≤n, define the real Stiefel constraint set

St⁡(n,p):={X∈Rn×p:XTX=Ip}.

Equip Rn×p with the Frobenius inner product ⟨U,V⟩F=tr⁡(UTV) and norm ∥U∥F=⟨U,U⟩F. Let H=Rn×p, let Y be a real Hilbert space, let U⊆H be open and contain St⁡(n,p), and let F:U→Y be continuously Fréchet differentiable. Given data y∈Y, a reference matrix Xref∈H, and λ≥0, define the residual and regularized objective by

r(X):=∥F(X)−y∥Y,Φ(X):=12∥F(X)−y∥Y2+λ2∥X−Xref∥F2.

Supply an ambient gradient oracle G:U→H satisfying DΦ(X)[Z]=⟨G(X),Z⟩F for every X∈U and Z∈H, an initial frame X0∈St⁡(n,p), a residual tolerance τ≥0, a finite integer budget K≥0, and a step schedule α0,…,αK−1 with every αk>0. For a square matrix M, put sym⁡(M):=(M+MT)/2. The tangent-projection and metric-dual calculation for this C1 objective, well-definedness of every tangent polar call, and finite-budget feasibility are justified by the finite-budget return and feasibility lemma. No smoothness beyond C1 is required. The procedure is:

  1. Set the current frame to X0 and the schedule index to k=0. If r(X)≤τ, return (X,r(X),target-met).

  2. While k<K, compute G(X) and the Stiefel gradient g:=G(X)−Xsym⁡(XTG(X)). If g=0, return (X,r(X),stationary).

  3. Set η:=−αkg and form the polar-retracted candidate

    Xtrial:=(X+η)((X+η)T(X+η))−1/2.

  4. Evaluate Φ(Xtrial) and r(Xtrial). If Φ(Xtrial)>Φ(X), return (X,r(X),objective-rejected). Otherwise accept Xtrial as the current frame. If its residual is at most τ, return (X,r(X),target-met); otherwise increment k by one and repeat the loop.

  5. When k=K, return (X,r(X),budget-exhausted).

This procedure is restricted to the stated finite-dimensional real Stiefel constraint and the displayed polar retraction. It gives no convergence, global-optimality, or noisy-data stability guarantee, and it makes no finite-precision claim. It does not apply to positivity constraints or other nonlinear manifolds without a separately specified compatible retraction and proof.

Depends on

Used by

Dependency tree · two levels

20 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