Proposition A.20 - Perfect-feature LP recovery
ProvedFeatureDistortion.PerfectFeatureLinearProbingNotation: , is the input dimension, the feature dimension, the data map, the labels, the features, and the head. Adjoint means Euclidean transpose. The loss is , with no normalization. The probability model, when present, is explicitly specified below; deterministic flow statements involve no random data assumption.
For every triple of natural numbers and every choice of continuous real-linear maps and , real-linear isometric bijection , and , put , , , , , and . Assume , , , , , and injectivity on of both and , where denotes orthogonal projection. Then two assertions hold: for every , if and only if ; and for every and every function with and derivative within equal to at every real , in the Euclidean topology as . All adjoints are Euclidean. The hypotheses exclude zero dimensions and require and ; if there are no qualifying data the implication is vacuous. Existence of is not asserted here, and its values at negative times are unconstrained.
Formalization note: Source-derived Proposition A.20 and its rotated-feature extension; convergence is a conclusion, with explicit identifiability assumptions. Source: Kumar, Raghunathan, Jones, Ma, and Liang, Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distribution, ICLR 2022, https://arxiv.org/pdf/2202.10054v1. Appendix A.7, PDF pp. 45--46, Proposition A.20, equations (A.208)--(A.211), and the following rotation paragraph on PDF p. 46. Source-backed parent: Section 3.4, PDF p. 10, Proposition 3.7, equations (3.10)--(3.11); Appendix A.7, PDF pp. 45--47.
import Definitions.Def_FeatureDistortion_Model open MeasureTheory Filter open scoped Topology
namespace FeatureDistortion
theorem PerfectFeatureLinearProbing :
∀ (n d k : ℕ) (P : Problem n d k), Admissible P →
(∀ v : Vec k,
trainingLoss P.data (labels P) v (initialFeatures P) = 0 ↔ v = alignedHead P) ∧
(∀ (v₀ : Vec k) (v : ℝ → Vec k),
IsLinearProbingFlow P.data (labels P) v₀ (initialFeatures P) v →
Tendsto v atTop (𝓝 (alignedHead P))) := by sorry
end FeatureDistortion
Read-back
What the Lean code literally says, in plain math · gpt-6
For every triple of natural numbers and every choice of continuous real-linear maps and , real-linear isometric bijection , and , put , , , , , and . Assume , , , , , and injectivity on of both and , where denotes orthogonal projection. Then two assertions hold: for every , if and only if ; and for every and every function with and derivative within equal to at every real , in the Euclidean topology as . All adjoints are Euclidean. The hypotheses exclude zero dimensions and require and ; if there are no qualifying data the implication is vacuous. Existence of is not asserted here, and its values at negative times are unconstrained.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.