Equations (3.2)--(3.3) - Global gradient flows
ProvedFeatureDistortion.GradientFlowWellPosedNotation: , 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 , every continuous real-linear map , every , every , and every continuous real-linear map , three assertions hold together. First, there exist functions and with and such that for every real their derivatives within are and , the latter being a derivative in the space of continuous linear maps. Second, for every two pairs and with those initial conditions and differential equations, and for every real . Third, there exists with and derivative within equal to for every real . Here denotes continuous real-linear maps and the Euclidean adjoint. The derivatives at zero are within the half-line. Values at negative times have no restrictions, and uniqueness of is not asserted. All dimensions may be zero, and no rank, normalization, or consistency hypotheses are imposed.
Formalization note: Formal ODE bridge for the source-backed parent; global existence and FT uniqueness are analytic obligations implicit in the source flow notation, not a separately numbered paper theorem. 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. Section 3.1, PDF p. 6, equations (3.2)--(3.3). 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 GradientFlowWellPosed :
∀ (n d k : ℕ) (X : Vec d →L[ℝ] Vec n) (Y : Vec n)
(v₀ : Vec k) (B₀ : Features d k),
(∃ γ : Trajectory d k, IsFineTuningFlow X Y v₀ B₀ γ) ∧
(∀ γ₁ γ₂ : Trajectory d k,
IsFineTuningFlow X Y v₀ B₀ γ₁ → IsFineTuningFlow X Y v₀ B₀ γ₂ →
∀ t : ℝ, 0 ≤ t → γ₁.head t = γ₂.head t ∧ γ₁.features t = γ₂.features t) ∧
(∃ v : ℝ → Vec k, IsLinearProbingFlow X Y v₀ B₀ v) := by sorry
end FeatureDistortion
Read-back
What the Lean code literally says, in plain math · gpt-6
For every triple of natural numbers , every continuous real-linear map , every , every , and every continuous real-linear map , three assertions hold together. First, there exist functions and with and such that for every real their derivatives within are and , the latter being a derivative in the space of continuous linear maps. Second, for every two pairs and with those initial conditions and differential equations, and for every real . Third, there exists with and derivative within equal to for every real . Here denotes continuous real-linear maps and the Euclidean adjoint. The derivatives at zero are within the half-line. Values at negative times have no restrictions, and uniqueness of is not asserted. All dimensions may be zero, and no rank, normalization, or consistency hypotheses are imposed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.