Estimation.Orthogonal­Learning.Population

Population-side orthogonal-learning definitions: directional derivatives, Neyman orthogonality, and nuisance-induced second-order bias.

Directional­Deriv 4 core · 0 supporting This file packages directional derivatives of an orthogonal statistical-learning loss in the target coordinate, the nuisance coordinate, and the mixed target-nuisance coordinate.

Directional Derivatives for Losses

This file packages directional derivatives of an orthogonal statistical-learning loss in the target coordinate, the nuisance coordinate, and the mixed target-nuisance coordinate. These derivative bundles provide the analytic inputs used to state first-order optimality and Neyman orthogonality for population risks.

The public bundles are HasDirDerivTheta, HasDirDerivG, and HasMixedDirDeriv. The predicate FirstOrderInequality records the integrated target-direction first-order condition at the true nuisance.

structure HasDirDerivTheta reviewed
Causalean.Estimation.OrthogonalLearning

Directional derivative of the learning-system loss in the target coordinate, at a fixed nuisance g. Bundles a candidate directional-derivative function dℓ_θ, giving a real number for each target θ and observation z, the witness that for every target θ in the system's target class and every observation z, the loss's difference quotient along the segment from θ₀ to θ at nuisance g converges to dℓ_θ θ z as the step size shrinks to zero, and measurability of dℓ_θ θ in the observation for every target θ.

Definition (Lean source)
Ω :
Type u_1
shared
μ :
shared
Z :
Type u_2
shared
P_Z :
shared
Θ :
Type u_3
shared
G :
Type u_4
shared
S :
LearningSystem Ω μ Z P_Z Θ G
g :
G
dℓ_θ :
Θ → Z → ℝ
pointwise_tendsto :
∀ θ ∈ S.Θ_set,
∀ z,
Tendsto (fun t : ℝ => (S.ℓ z (S.θ₀ + t • (θ - S.θ₀)) g - S.ℓ z S.θ₀ g) / t) (𝓝[≠] 0) (𝓝 (dℓ_θ θ z))
dℓ_θ_meas :
∀ θ, Measurable (dℓ_θ θ)
Causalean.Estimation.OrthogonalLearning.HasDirDerivTheta · Causalean/Estimation/OrthogonalLearning/Population/DirectionalDeriv.lean:56 · uses LearningSystem
structure HasDirDerivG reviewed
Causalean.Estimation.OrthogonalLearning

Directional derivative of the learning-system loss in the nuisance coordinate. Bundles a candidate pointwise directional-derivative function, the witness that the loss's difference quotient along the segment from the distinguished nuisance to any candidate nuisance converges pointwise to that function, and measurability of each resulting observation function.

Definition (Lean source)
Ω :
Type u_1
shared
μ :
shared
Z :
Type u_2
shared
P_Z :
shared
Θ :
Type u_3
shared
G :
Type u_4
shared
S :
LearningSystem Ω μ Z P_Z Θ G
dℓ_g :
G → Z → ℝ
pointwise_tendsto :
∀ g ∈ S.G_set,
∀ z,
Tendsto (fun t : ℝ => (S.ℓ z S.θ₀ (S.g₀ + t • (g - S.g₀)) - S.ℓ z S.θ₀ S.g₀) / t) (𝓝[≠] 0) (𝓝 (dℓ_g g z))
dℓ_g_meas :
∀ g, Measurable (dℓ_g g)
Causalean.Estimation.OrthogonalLearning.HasDirDerivG · Causalean/Estimation/OrthogonalLearning/Population/DirectionalDeriv.lean:77 · uses LearningSystem
structure HasMixedDirDeriv reviewed
Causalean.Estimation.OrthogonalLearning

Mixed target-nuisance directional derivative of the learning-system loss, at the truth (θ₀, g₀). Bundles a target-direction directional-derivative bundle Dθ_at g anchored at every accessible nuisance value g, a real-valued mixed directional-derivative function dℓ_θg of the target, the nuisance, and the observation, the witness that for every target θ and nuisance g in the system's classes and every observation z, the target-direction derivative anchored at the perturbed nuisance g₀ + t(g - g₀) converges, as t → 0, to dℓ_θg θ g z, and measurability of dℓ_θg θ g in the observation for every target θ and nuisance g.

Definition (Lean source)
Ω :
Type u_1
shared
μ :
shared
Z :
Type u_2
shared
P_Z :
shared
Θ :
Type u_3
shared
G :
Type u_4
shared
S :
LearningSystem Ω μ Z P_Z Θ G
A target-direction DD bundle anchored at *each* accessible nuisance.
Dθ_at :
∀ g : G, HasDirDerivTheta S g
The mixed directional-derivative value field.
dℓ_θg :
Θ → G → Z → ℝ
pointwise_tendsto :
∀ θ ∈ S.Θ_set,
∀ g ∈ S.G_set,
∀ z,
Tendsto (fun t : ℝ => ((Dθ_at (S.g₀ + t • (g - S.g₀))).dℓ_θ θ z - (Dθ_at S.g₀).dℓ_θ θ z) / t) (𝓝[≠] 0) (𝓝 (dℓ_θg θ g z))
dℓ_θg_meas :
∀ θ g, Measurable (dℓ_θg θ g)
Causalean.Estimation.OrthogonalLearning.HasMixedDirDeriv · Causalean/Estimation/OrthogonalLearning/Population/DirectionalDeriv.lean:97 · uses LearningSystem
def FirstOrderInequality reviewed
Causalean.Estimation.OrthogonalLearning

The population first-order inequality for an orthogonal statistical-learning system and target-derivative data at the distinguished nuisance requires every candidate target's integrated directional derivative at the distinguished target to be nonnegative. It is a directly assumed stationarity condition; without further differentiability and risk-convexity hypotheses, it does not characterize the distinguished target as a global minimizer.

Definition (Lean source)
Ω :
Type u_1
shared
Z :
Type u_2
shared
Θ :
Type u_3
shared
G :
Type u_4
shared
S :
LearningSystem Ω μ Z P_Z Θ G
Dθ :
θ ∈ S.Θ_set :
FirstOrderInequality S Dθ :
Prop
0 ≤ ∫ z, Dθ.dℓ_θ θ z ∂P_Z
Neyman­Orthogonal 5 core · 0 supporting This file formulates Neyman orthogonality for an orthogonal statistical-learning loss as the vanishing of the integrated mixed directional derivative in every admissible target and nuisance direction. ★ neymanOrthog_iff_score_deriv_zero

Neyman Orthogonality for Losses

This file formulates Neyman orthogonality for an orthogonal statistical-learning loss as the vanishing of the integrated mixed directional derivative in every admissible target and nuisance direction. It also records domination predicates intended for limit--integral interchange arguments.

The main predicate is NeymanOrthogLoss. The auxiliary predicates DiffQuotientEnvelopeTheta, DiffQuotientEnvelopeG, and MixedScoreDCTBridge package dominated-convergence hypotheses, and neymanOrthog_iff_score_deriv_zero proves the score-derivative reformulation under the bridge hypothesis.

def NeymanOrthogLoss reviewed
Causalean.Estimation.OrthogonalLearning

For an orthogonal statistical-learning system and mixed target--nuisance derivative data, the Neyman-orthogonality condition for the loss states that every admissible target and nuisance direction has zero observation-law integral of its mixed directional derivative.

Definition (Lean source)
Ω :
Type u_1
shared
Z :
Type u_2
shared
Θ :
Type u_3
shared
G :
Type u_4
shared
S :
LearningSystem Ω μ Z P_Z Θ G
θ ∈ S.Θ_set :
g ∈ S.G_set :
NeymanOrthogLoss S M :
Prop
∫ z, M.dℓ_θg θ g z ∂P_Z = 0
def DiffQuotientEnvelopeTheta reviewed
Causalean.Estimation.OrthogonalLearning

For an orthogonal statistical-learning system and a nuisance function, the target-direction difference-quotient envelope condition gives each candidate target a positive neighborhood radius and an integrable envelope that bounds the absolute loss difference quotient almost everywhere for every smaller nonzero perturbation.

Definition (Lean source)
Ω :
Type u_1
shared
Z :
Type u_2
shared
Θ :
Type u_3
shared
G :
Type u_4
shared
S :
LearningSystem Ω μ Z P_Z Θ G
g :
G
θ ∈ S.Θ_set :
DiffQuotientEnvelopeTheta S g :
Prop
∃ δ : ℝ,
0 < δ
clause 1
∃ env : Z → ℝ,
Integrable env P_Z
∀ᵐ z ∂P_Z, ∀ t : ℝ, t ∈ Ioo (-δ) δ → t
≠ 0 → ‖(S.ℓ z (S.θ₀ + t • (θ - S.θ₀)) g - S.ℓ z S.θ₀ g) / t‖ ≤ env z
Causalean.Estimation.OrthogonalLearning.DiffQuotientEnvelopeTheta · Causalean/Estimation/OrthogonalLearning/Population/NeymanOrthogonal.lean:71 · uses LearningSystem
def DiffQuotientEnvelopeG reviewed
Causalean.Estimation.OrthogonalLearning

For an orthogonal statistical-learning system, the nuisance-direction difference-quotient envelope condition gives each admissible nuisance a positive neighborhood radius and an integrable envelope that bounds the absolute loss difference quotient almost everywhere for every smaller nonzero perturbation.

Definition (Lean source)
Ω :
Type u_1
shared
Z :
Type u_2
shared
Θ :
Type u_3
shared
G :
Type u_4
shared
S :
LearningSystem Ω μ Z P_Z Θ G
g ∈ S.G_set :
DiffQuotientEnvelopeG S :
Prop
∃ δ : ℝ,
0 < δ
clause 1
∃ env : Z → ℝ,
Integrable env P_Z
∀ᵐ z ∂P_Z, ∀ t : ℝ, t ∈ Ioo (-δ) δ → t
≠ 0 → ‖(S.ℓ z S.θ₀ (S.g₀ + t • (g - S.g₀)) - S.ℓ z S.θ₀ S.g₀) / t‖ ≤ env z
Causalean.Estimation.OrthogonalLearning.DiffQuotientEnvelopeG · Causalean/Estimation/OrthogonalLearning/Population/NeymanOrthogonal.lean:87 · uses LearningSystem
def MixedScoreDCTBridge reviewed
Causalean.Estimation.OrthogonalLearning

For an orthogonal statistical-learning system and mixed target--nuisance derivative data, the mixed-derivative limit--integral bridge says the integrated centered quotient along every admissible nuisance perturbation tends to the integral of the corresponding mixed directional derivative.

Definition (Lean source)
Ω :
Type u_1
shared
Z :
Type u_2
shared
Θ :
Type u_3
shared
G :
Type u_4
shared
S :
LearningSystem Ω μ Z P_Z Θ G
θ ∈ S.Θ_set :
g ∈ S.G_set :
MixedScoreDCTBridge S M :
Prop
Tendsto (fun t : ℝ => ((∫ z, (M.Dθ_at (S.g₀ + t • (g - S.g₀))).dℓ_θ θ z ∂P_Z) - (∫ z, (M.Dθ_at S.g₀).dℓ_θ θ z ∂P_Z)) / t) (𝓝[≠] 0) (𝓝 (∫ z, M.dℓ_θg θ g z ∂P_Z))
theorem neymanOrthog_iff_score_deriv_zero reviewed
Causalean.Estimation.OrthogonalLearning

Integrated-derivative reformulation of Neyman orthogonality. Assume the stated limit--integral bridge for the bundled derivatives. Then Neyman orthogonality is equivalent to zero directional derivative of the integrated map for every admissible target and nuisance direction.

Formal statement
Ω :
Type u_1
shared
Z :
Type u_2
shared
Θ :
Type u_3
shared
G :
Type u_4
shared
S :
LearningSystem Ω μ Z P_Z Θ G
hBridge :
↔ ∀ θ ∈ S.Θ_set, ∀ g ∈ S.G_set, Tendsto (fun t : ℝ => ((∫ z, (M.Dθ_at (S.g₀ + t • (g - S.g₀))).dℓ_θ θ z ∂P_Z) - (∫ z, (M.Dθ_at S.g₀).dℓ_θ θ z ∂P_Z)) / t) (𝓝[≠] 0) (𝓝 0)
Proof (Lean source)
theorem neymanOrthog_iff_score_deriv_zero (S : LearningSystem Ω μ Z P_Z Θ G) (M : HasMixedDirDeriv S) (hBridge : MixedScoreDCTBridge S M) : NeymanOrthogLoss S M ↔ ∀ θ ∈ S.Θ_set, ∀ g ∈ S.G_set, Tendsto (fun t : ℝ => ((∫ z, (M.Dθ_at (S.g₀ + t • (g - S.g₀))).dℓ_θ θ z ∂P_Z) - (∫ z, (M.Dθ_at S.g₀).dℓ_θ θ z ∂P_Z)) / t) (𝓝[≠] 0) (𝓝 0) := by refine ⟨?_, ?_⟩ · intro hNO θ hθ g hg have hbr := hBridge θ hθ g hg have hzero : (∫ z, M.dℓ_θg θ g z ∂P_Z) = 0 := hNO θ hθ g hg simpa [hzero] using hbr · intro hScore θ hθ g hg have hbr := hBridge θ hθ g hg have hScr := hScore θ hθ g hg haveI : (𝓝[≠] (0 : ℝ)).NeBot := NormedField.nhdsNE_neBot 0 exact tendsto_nhds_unique hbr hScr
Second­Order­Bias 1 core · 0 supporting This file defines the nuisance-induced bias term for a sample-split orthogonal statistical learning system.

Integrated Target-Derivative Difference in Orthogonal Statistical Learning

This file defines the nuisance-induced bias term for a sample-split orthogonal statistical learning system. The term compares the integrated target-direction derivative at the true nuisance with the corresponding integrated pointwise derivative at a plug-in nuisance.

The exported definition is Bias_n. Relating it to a population-risk derivative or to a quantitative Taylor expansion requires additional analytic bridges that are not exported here.

def Bias_n reviewed
Causalean.Estimation.OrthogonalLearning

The integrated pointwise target-derivative difference measures, in an orthogonal statistical-learning system, how the integrated derivative data at the true nuisance changes when replaced by derivative data at a plug-in nuisance, evaluated at a target estimate. It is the first population integral minus the corresponding plug-in integral.

Definition (Lean source)
Ω :
Type u_1
shared
Z :
Type u_2
shared
Θ :
Type u_3
shared
G :
Type u_4
shared
S :
LearningSystem Ω μ Z P_Z Θ G
Dθ_truth :
g :
G
Dθ_at_ghat :
θhat :
Θ
Bias_n S Dθ_truth Dθ_at_ghat θhat :
ℝ
(∫ z, Dθ_truth.dℓ_θ θhat z ∂P_Z) - (∫ z, Dθ_at_ghat.dℓ_θ θhat z ∂P_Z)