Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

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.

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