Alphabeta Math
Pipeline-generated
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.

✓ 7 results · all verified · 7 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 7 also cleared it.

Generalized linear models and Fisher scoring

1 · Prerequisites

2 · Summary

This page specifies finite independent response vectors under an explicit product sampling law, then derives the generalized linear model's mean, variance, and likelihood derivatives. The algorithm defines one minimum-norm IRLS update; a separate theorem identifies it with Fisher scoring under additional regularity and invertible-information hypotheses. A scientific application must separately provide its model contract for observation units, predictor and response roles, target, conditioning, and model-adequacy assumptions. The canonical-link concavity result gives at most one finite stationary point, and any such point is the unique global maximizer, when the parameter domain is open and convex, the design has full column rank, the common scale is positive, the cumulant curvature is positive throughout the predictor image, and the fixed response vector has positive component densities throughout the parameter domain; it does not guarantee existence. The algorithm makes one finite update, with no convergence or termination claim. Deviance is defined only for nested models on common support with finite suprema, and nesting proves nonnegativity. No generic chi-square calibration, deviance-residual law, or goodness-of-fit conclusion is asserted.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Explicit exponential-family response contracts

Definition

Fix a finite integer n≥1 and a dispersion value ϕ. For each 1≤i≤n, let Yi⊆R carry its Borel sigma algebra and let νi be a sigma-finite positive measure on it. Let J⊆R be an open interval, let b:J→R be twice continuously differentiable, let ai(ϕ)>0, and let ci( ⋅ ,ϕ) be measurable. An explicit one-parameter exponential-family response contract supplies, for each θi∈J, a density or mass function relative to νi,

fi(yi;θi,ϕ)=exp⁡ ⁣{yiθi−b(θi)ai(ϕ)+ci(yi,ϕ)}.

The contract requires fi≥0, ∫fi( ⋅ ;θi,ϕ) dνi=1 for every θi∈J, and a fixed support Si∈Ai such that fi>0 on Si and fi=0 off Si, up to a νi-null set independent of θi. When the mean and variance identities are used, it also requires a finite second moment and locally uniform integrable envelopes for the first and second θi derivatives of fi on Si.

For a vector θ=(θ1,…,θn)∈Jn, the product sampling law is the finite product ⨂i=1nPi,θi,ϕ, where Pi,θi,ϕ has density fi relative to νi. The coordinate responses are independent in the sense of Independent random elements. Their product base measure is ν=⨂i=1nνi on ⨂i=1nAi. The next lemma verifies that the joint density is ∏ifi.

The design or conditioning convention, observation units, and response/index roles are part of the surrounding scientific model contract. A sampling-law specification is not evidence that the scientific model is empirically adequate.

Every scientific application also records a Scientific statistical model contracts: it names the observation space and record, scientific and analysis units, index meanings, response and predictor maps, target, observation mechanism, support, law, conditioning, and adequacy assumptions. The contract does not itself imply independence or common support; those are explicit hypotheses of this response-family definition. Here i is only a component index until the application assigns it a scientific unit or time meaning.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The product response law has the product density

Statement

In the setup of Explicit exponential-family response contracts, let Pθ=⨂i=1nPi,θi,ϕ and ν=⨂i=1nνi. Then the joint sampling law has density

qθ(y1,…,yn)=∏i=1nfi(yi;θi,ϕ)

relative to ν. At any y for which every factor fi(yi;θi,ϕ) is positive, the log likelihood is log⁡qθ(y)=∑ilog⁡fi(yi;θi,ϕ).

Facts & Assumptions

Given: The finite collection of sigma-finite component spaces, normalized densities, fixed supports, and product sampling law in Explicit exponential-family response contracts.

[F1]

Explicit exponential-family response contracts: each fi is a nonnegative measurable probability density relative to νi, and the joint sampling law is the finite product of the component laws.

[F2]

The product sigma-algebra and its finite iterates: the finite product sigma algebra is generated recursively by measurable rectangles.

[F3]

For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: for sigma-finite factors, the product measure is a measure and satisfies (ν1×ν2)(A1×A2)=ν1(A1)ν2(A2).

[F4]

Arithmetic and lattice operations preserve measurability whenever they are defined: finite pointwise products of measurable real-valued functions are measurable.

[F5]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for nonnegative product-measurable functions on sigma-finite product spaces, the integral equals either iterated integral.

[F6]

The measure with density f relative to μ: if q is nonnegative measurable, q dν is the measure A↦∫Aq dν.

[F7]

Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system: measures agreeing on a generating pi-system and on an increasing finite-measure exhaustion from that pi-system are equal.

Proof

1.1F1F2F4

For each coordinate projection πi(y)=yi, the preimage of a measurable set is a measurable rectangle, so fi∘πi is product-measurable by [F2]. Their finite product qθ=∏i(fi∘πi) is product-measurable by [F4].

2.1F1F3F5step 1.1

Construct ν and Pθ by repeated finite products using [F3]. Repeated Tonelli [F5], applied to the nonnegative factors, gives ∫∏iAiqθ dν=∏i∫Aifi dνi=∏iPi,θi,ϕ(Ai)=Pθ(∏iAi) for every measurable rectangle. Taking the rectangle to be the whole product and using normalization from [F1] gives ∫qθ dν=1.

3.1F1F2F6F7step 2.1algebra∎

By [F6], Q(A):=∫Aqθ dν is a probability measure, and step 2.1 shows that Q and Pθ agree on the rectangle pi-system. That system contains the whole product, which is a one-set increasing finite-measure exhaustion for both probability measures, so [F2] and [F7] give Q=Pθ. Whenever every factor is positive, taking the logarithm of the product gives the stated sum.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Mean and variance from the cumulant function

Statement

Fix i and ϕ in Explicit exponential-family response contracts, and write a=ai(ϕ). Under its fixed-support, twice differentiable density, local integrable derivative-envelope, and finite-second-moment hypotheses,

Eθi,ϕ[Yi]=b′(θi),Var⁡θi,ϕ(Yi)=a b′′(θi).

Facts & Assumptions

Given: The normalized density fi(y;θi,ϕ) on the open interval J, its fixed support, locally uniform integrable envelopes for its first two parameter derivatives, and Eθi,ϕ[Yi2]<∞.

[F1]

Explicit exponential-family response contracts: fi(y;θi,ϕ)=exp⁡{(yθi−b(θi))/a+ci(y,ϕ)} is normalized for every θi on a fixed support, with b∈C2(J) and the stated derivative envelopes.

[F2]

The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a): if a function is continuous on a closed interval and differentiable in its interior, an endpoint difference equals its derivative at an interior point times the interval length.

[F3]

Dominated convergence: almost-everywhere convergence under one integrable majorant permits passing the limit through the integral.

[F4]

The Lebesgue integral is linear on L1(μ): the integral is linear on integrable functions.

[F5]

Expectation of a nonnegative or integrable random variable: the expectation of an integrable real random variable is its finite signed integral.

[F6]

Integrating against a density agrees with integrating the product: if P=f dν, then for nonnegative measurable g, ∫g dP=∫gf dν; the signed identity follows by positive and negative parts once absolute integrability is verified.

[F7]

Integrable real and complex functions, and their integrals: a real measurable function is integrable exactly when the integral of its absolute value is finite.

[F8]

Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative integral is monotone and homogeneous for nonnegative scalars.

[F9]

Moments, variance, and covariance on a probability space: for a square-integrable real random variable, variance is the expectation of its centered square.

Proof

1.1F1algebra

Differentiating the displayed density pointwise on its fixed support gives ∂θifi=fi(y−b′(θi))/a and ∂θi2fi=fi{(y−b′(θi))2/a2−b′′(θi)/a}. Off the fixed support the density vanishes outside a fixed νi-null exception for every θi, so these derivative identities hold νi-almost everywhere on the whole response space.

2.1F1F2F3F4F5F6F7F8step 1.1algebra

For any sequence of nonzero hk→0 with θi+hk∈J, the difference quotients (fi( ⋅ ;θi+hk,ϕ)−fi( ⋅ ;θi,ϕ))/hk converge pointwise almost everywhere to ∂θifi. The mean value theorem [F2] bounds their absolute values by the local first-derivative envelope, so [F3] passes the limit through the integral. Each quotient has integral (1−1)/hk=0 by normalization and [F4]; hence ∫∂θifi dνi=0. Since 2∣y∣≤1+y2, monotonicity and homogeneity [F8], normalization, linearity [F4], and the density identity [F6] give E∣Yi∣≤12(1+E[Yi2])<∞. Thus Yi is integrable by [F7], so its positive and negative parts are integrable. Applying [F6] to those two parts and subtracting by [F4] and [F5] identifies E[Yi]=∫yfi dνi. Substituting step 1.1 into ∫∂θifi dνi=0, and using normalization [F1] and linearity [F4], gives ∫yfi dνi=b′(θi).

3.1F1F2F3F4F5F6F9step 1.1step 2.1algebra∎

Apply the same sequential difference-quotient argument to ∂θifi, now using the local second-derivative envelope, to get ∫∂θi2fi dνi=0. Substituting step 1.1 gives ∫(y−b′(θi))2fi dνi=a b′′(θi). By [F6] this is E[(Yi−b′(θi))2]; by step 2.1, b′(θi)=E[Yi], so [F9] identifies the centered second moment with the variance.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Generalized linear model with explicit conditioning

Definition

Fix n≥1, p≥1, a finite design matrix X∈Rn×p with rows xiT, a dispersion value ϕ, and an open parameter domain Θ⊆Rp. A generalized linear model (GLM) on this design consists of the response family in Explicit exponential-family response contracts, a differentiable one-to-one link g:M→g(M) on a specified mean domain M, and a specified map τ:M→J satisfying b′(τ(μ))=μ. For β∈Θ, put

ηi=xiTβ,μi=g−1(ηi),θi=τ(μi),

and require ηi∈g(M) and θi∈J for every i. The canonical link is the choice g=τ, equivalently θi=ηi. When θi=ηi and the component scales are common, write ai(ϕ)=a(ϕ)>0; this common-scale restriction is part of every formula that uses a(ϕ).

The joint sampling density is the product density from The product response law has the product density. For an observed y=(y1,…,yn) with fi(yi;θi,ϕ)>0 for every i, define its log likelihood by

ℓ(β;y,ϕ)=∑i=1n{yiθi−b(θi)ai(ϕ)+ci(yi,ϕ)}.

For a differentiable log likelihood, the score is U(β;y,ϕ):=∇βℓ(β;y,ϕ). When its entries have finite second moments, the expected score outer-product information is I(β,ϕ):=Eβ,ϕ[UUT]. This page treats X as fixed or conditions on its realized value; it supplies no random-design asymptotic conclusion.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Canonical-link score and Hessian

Statement

Let (Yi)i=1n follow Generalized linear model with explicit conditioning with a common scale a(ϕ)>0, canonical link θi=ηi=xiTβ, and twice differentiable b. For an observed y with fi(yi;ηi,ϕ)>0 for every i,

∇βℓ(β;y,ϕ)=XT(y−μ)a(ϕ),∇β2ℓ(β;y,ϕ)=−XTdiag⁡(b′′(ηi))Xa(ϕ).

Facts & Assumptions

Given: A finite fixed design X, an admissible β, the common-scale canonical-link GLM, and an observed response vector whose component densities are positive at the corresponding canonical parameters.

[F1]

Generalized linear model with explicit conditioning: ηi=xiTβ, the canonical link is θi=ηi, and the common-scale log likelihood is the finite sum of component log densities.

[F2]

The product response law has the product density: the joint density is the product of component densities, so wherever all factors are positive its log likelihood is their sum.

[F3]

Generalized linear model with explicit conditioning: for the canonical link, θi=ηi=τ(μi) and b′(τ(μi))=μi.

[F5]

Matrix differentials obey the sum rule, product rule, and adjoint rule: in the real Frechet sense, d(AB)=dA B+A dB and d(A+B)=dA+dB.

Proof

1.1F1F2F3F4algebra

By [F1] and [F2], ℓ(β;y,ϕ)=∑i{yixiTβ−b(xiTβ)}/a(ϕ)+C(y,ϕ), where C is independent of β. For each coordinate j, the chain rule [F4] gives ∂βjℓ=∑ixij{yi−b′(ηi)}/a(ϕ). By [F3], b′(ηi)=b′(τ(μi))=μi, so these entries assemble as XT(y−μ)/a(ϕ).

2.1F4F5step 1.1algebra∎

Differentiating the coordinate expression in step 1.1 with respect to βk gives ∂βk∂βjℓ=−∑ixijxikb′′(ηi)/a(ϕ) by [F4]. The sum and matrix-product rules [F5] identify these entries with −XTdiag⁡(b′′(ηi))X/a(ϕ).

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Likelihood deviance for nested models on common support

Definition

Fix an observed response vector y for which the component densities are positive throughout both models' parameter sets, and two stated GLMs with the same response family, base support, and log-likelihood function ℓ(β;y). They are nested here only when a stated embedding identifies the fitted parameter set with a subset Θfit⊆Θsat of the saturated reference parameter set. Require both sets to be nonempty and both suprema to be finite real numbers. The likelihood deviance is

D(y)=2{sup⁡β∈Θsatℓ(β;y)−sup⁡β∈Θfitℓ(β;y)}.

The definition makes no claim about deviance residuals, goodness-of-fit diagnostics, or a reference distribution. The two full-text GLM notes cited above support likelihood setup but do not supply a deviance-diagnostics treatment; the nonnegativity result below is proved only from the stated set inclusion.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Strict concavity and uniqueness of a finite stationary maximizer

Statement

Suppose the canonical-link GLM has an open convex parameter domain Θ⊆Rp, full-column-rank design X, common scale a(ϕ)>0, and b′′(ηi)>0 at every predictor vector in XΘ. For a fixed response vector y whose component densities are positive throughout Θ, ℓ( ⋅ ;y,ϕ) is strictly concave on Θ. It has at most one stationary point; if a stationary point exists, it is the unique global maximizer. This conclusion does not assert that a finite maximizer exists.

Facts & Assumptions

Given: The canonical-link GLM hypotheses in the Statement and a fixed response vector whose log likelihood is defined throughout Θ.

[F1]

Canonical-link score and Hessian: the Hessian is −XTdiag⁡(b′′(ηi))X/a(ϕ).

[F2]

The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a): if a function is continuous on a closed interval and differentiable in its interior, its endpoint difference is its derivative at an interior point times the interval length.

Proof

1.1F1F2givenalgebra

Fix distinct β0,β1∈Θ, put d=β1−β0, and define q(t)=ℓ(β0+td;y,ϕ) for 0≤t≤1. Convexity keeps this segment in Θ. By [F1], q′′(t)=dT∇2ℓ(β0+td)d=−a(ϕ)−1∑ib′′(xiT(β0+td))(xiTd)2<0, because Xd≠0 by full column rank and every displayed b′′ is positive. The mean value theorem [F2] applied to q′ makes q′ strictly decreasing. For any 0<t<1, another application of [F2] gives (q(t)−q(0))/t=q′(u) for some u∈(0,t) and (q(1)−q(t))/(1−t)=q′(v) for some v∈(t,1); strict decrease gives the first secant slope larger than the second, which rearranges to q(t)>(1−t)q(0)+tq(1). Thus every nonconstant segment is strictly concave.

2.1F2step 1.1algebra∎

Two distinct stationary points would give q′(0)=q′(1)=0 on their connecting segment, contradicting strict decrease. If β0 is stationary and β1≠β0, then q′(0)=0 and strict decrease gives q′(t)<0 for 0<t≤1; [F2] applied to q yields ℓ(β1;y,ϕ)−ℓ(β0;y,ϕ)=q′(c)<0 for some c∈(0,1). Thus any stationary point is the unique global maximizer when it exists.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

One minimum-norm IRLS step

Definition

Inputs are an observed response vector y with fi(yi;θi,ϕ)>0 for every i, a finite design matrix X, an admissible finite current parameter β, and a GLM with common scale a(ϕ)>0. Require each μ˙i=dμi/dηi to be finite and nonzero and each Vi=b′′(θi) to be finite and positive.

  1. Compute ηi=xiTβ and μi=g−1(ηi).
  2. Compute the working response and positive weight zi=ηi+yi−μiμ˙i,wi=μ˙i2a(ϕ)Vi.
  3. Form W1/2=diag⁡(wi) using Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, and put A=W1/2X, r=W1/2z. By The Moore--Penrose pseudoinverse A+ as the solution of the four Penrose equations and Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse, form A+. Return βnew=A+r, the unique minimum-Euclidean-norm member of the nonempty weighted least-squares minimizer set by For every right-hand side b, A+b is the unique least-squares solution of minimum Euclidean norm.

The Moore--Penrose convention makes the procedure single-valued even when X is rank deficient; the underlying least-squares minimizer need not then be unique. Existence and the minimum-norm property follow from Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse and For every right-hand side b, A+b is the unique least-squares solution of minimum Euclidean norm. The output need not lie in Θ, and this definition makes no claim that repeated updates terminate or converge to a maximizer.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The minimum-norm IRLS step is well-defined for every design rank

Statement

For every input satisfying the Definition of One minimum-norm IRLS step, every intermediate quantity in its three instructions is uniquely determined and finite. Its output βnew∈Rp is the unique minimum-Euclidean-norm member of the nonempty set argmin⁡γ∈Rp∑i=1nwi(zi−xiTγ)2. This holds for every rank of X, including X=0. The weighted normal matrix H=XTWX is positive semidefinite and has kernel ker⁡H=ker⁡X; its singularity does not obstruct this output. No assertion that the output lies in the model parameter domain, or that repeated updates converge, is made.

Facts & Assumptions

[F1]

The algorithm specifies a finite real response vector and design, an admissible finite current parameter, a positive common scale, finite nonzero μ˙i, finite positive Vi, and the formulas for zi,wi,A,r and the return value. One minimum-norm IRLS step

[F2]

In the GLM, ηi=xiTβ is in the inverse link's domain; that inverse gives the unique real μi, and the specified maps determine the component natural parameters. Generalized linear model with explicit conditioning

[F3]
[F4]

Every finite real matrix has a unique Moore–Penrose pseudoinverse satisfying the four Penrose equations. The Moore--Penrose pseudoinverse A+ as the solution of the four Penrose equations, Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse

[F5]

For a finite real matrix A and every finite real target vector r, the vector A+r is a least-squares minimizer and is the unique such minimizer of minimum Euclidean norm. For every right-hand side b, A+b is the unique least-squares solution of minimum Euclidean norm

Proof

technique · apply the supplied finite-matrix existence and uniqueness results to the weighted design and identify the exact objective

Given: Any input satisfying the algorithm's Definition.

1.1F1F2algebra

Each predictor is a finite sum of products of real design and parameter entries, and each mean is a unique finite real value by [F2]. The observed response coordinates are finite real numbers by [F1]. Thus zi=ηi+(yi−μi)/μ˙i is finite and uniquely determined because its denominator is nonzero. Likewise wi=μ˙i2/(a(ϕ)Vi) is finite and strictly positive: its numerator is positive and its denominator is a finite positive real number. These operations refer to real arithmetic, with no floating-point overflow assertion.

2.1F1F3F4step 1.1construct

By [F3] each wi has one finite positive square root. Consequently the diagonal matrix D=diag⁡(wi), the weighted design A=DX, and the target r=Dz are unique finite real matrices or vectors with the specified dimensions. By [F4] the p×n matrix A+ exists uniquely for every rank of A, so the returned A+r exists uniquely in Rp. No inverse of XTWX was required at this stage.

3.1F3F5step 2.1algebra

For every γ∈Rp, the diagonal construction gives ∥Aγ−r∥22=∑iwi(xiTγ−zi)2. Since a nonnegative real number and its square have the same minimizing arguments, [F5] makes A+r a member of the displayed weighted least-squares minimizer set and the unique member of minimum Euclidean norm. In particular that set is nonempty even when X is rank deficient. The minimum-norm property is the conclusion of the supplied theorem, not an extra condition imposed on the algorithm's inputs.

4.1step 1.1step 2.1step 3.1algebra

The weighted normal matrix is symmetric, and for every u∈Rp one has uTHu=∑iwi(xiTu)2=∥Au∥22≥0, so H is positive semidefinite. If Xu=0, then Hu=XTWXu=0. Conversely, if Hu=0, the displayed sum is zero, and its finitely many nonnegative terms with strictly positive wi force every xiTu=0; hence Xu=0. This proves ker⁡H=ker⁡X. Steps 2.1–3.1 apply equally when this kernel is nontrivial.

5.1F1F4step 2.1step 3.1step 4.1algebra∎

If X=0, then A=0. The zero matrix satisfies the Penrose equations, so uniqueness in [F4] gives A+=0 and the algorithm returns 0. The weighted objective is then constant in γ, so every vector is a minimizer and 0 is its unique minimum-norm member, consistent with step 3.1. A single response, zero observed responses, and other ranks use the same proof whenever the original admissibility conditions hold. Thus all stated well-definedness claims hold without an invertibility condition or a condition that the returned vector remain in the model domain.

Source notes

This is the explicit well-definedness discharge for the local algorithm. The proof uses the complete locally proved square-root, pseudoinverse-existence, and minimum-norm least-squares suppliers named above. The weighted objective is checked directly, and no Fisher-scoring equivalence or convergence theorem is assumed to prove existence of the procedure's output.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Nested-model deviance is nonnegative

Statement

For the deviance in Likelihood deviance for nested models on common support, D(y)≥0.

Facts & Assumptions

Given: Nonempty nested parameter sets Θfit⊆Θsat, a common log likelihood ℓ(β;y), and finite real suprema.

[F1]

Likelihood deviance for nested models on common support: D(y)=2{sup⁡Θsatℓ(β;y)−sup⁡Θfitℓ(β;y)} and Θfit⊆Θsat.

Proof

1.1F1given

Every value ℓ(β;y) with β∈Θfit is also among the values over Θsat by [F1]. Therefore sup⁡Θfitℓ(β;y)≤sup⁡Θsatℓ(β;y).

2.1F1step 1.1algebra∎

The suprema are finite real numbers by the definition's hypotheses, so their ordered difference is nonnegative; multiplying by 2>0 gives D(y)≥0.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

IRLS equals the Fisher-scoring step when information is invertible

Statement

Under the admissibility hypotheses of One minimum-norm IRLS step, assume also that each map ηi↦θi is differentiable, each map ηi↦μi is differentiable with finite nonzero derivative μ˙i, and Vi:=b′′(θi)>0. Each response has finite second moment, its density has the fixed common support and locally uniform integrable envelopes for its first and second θi derivatives required by Explicit exponential-family response contracts, and each component score has finite second moment. If I(β)=XTWX is invertible, let U(β) and I(β) be the score and expected score outer-product information from General-link score and Fisher information. Then the weighted least-squares output satisfies

βnew=β+I(β)−1U(β).

Facts & Assumptions

Given: The algorithm's finite admissible current β, common scale, finite nonzero link derivative, and finite positive variance values; the differentiable natural-parameter map; finite component response second moments; fixed common support and locally integrable first- and second-derivative envelopes; finite component score second moments; and invertible I(β).

[F1]

General-link score and Fisher information: U=XT(μ˙i(yi−μi)/(aVi))i and I=XTdiag⁡(μ˙i2/(aVi))X.

[F2]

One minimum-norm IRLS step: zi=ηi+(yi−μi)/μ˙i, wi=μ˙i2/(aVi), and βnew minimizes ∑iwi(zi−xiTγ)2.

Proof

1.1F1F2algebra

For every i, [F2] gives wi(zi−ηi)={μ˙i2/(aVi)}{(yi−μi)/μ˙i}=μ˙i(yi−μi)/(aVi). Since η=Xβ, multiplying by XT and using [F1] yields XTW(z−Xβ)=U(β).

2.1F1F2F3step 1.1givenalgebra∎

Apply [F3] to the weighted least-squares map T=W1/2X and target W1/2z. Its normal equation is XTW(Xβnew−z)=0, so I(β)(βnew−β)=XTW(z−Xβ)=U(β) by step 1.1. The assumed invertibility of I(β) now gives βnew=β+I(β)−1U(β).

5 · Examples, counterexamples and false statements

None yet.

Sources