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 , , a finite design matrix with rows , a dispersion value , and an open parameter domain . 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 on a specified mean domain , and a specified map satisfying . For , put
and require and for every . The canonical link is the choice , equivalently . When and the component scales are common, write ; this common-scale restriction is part of every formula that uses .
The joint sampling density is the product density from The product response law has the product density. For an observed with for every , define its log likelihood by
For a differentiable log likelihood, the score is . When its entries have finite second moments, the expected score outer-product information is . This page treats as fixed or conditions on its realized value; it supplies no random-design asymptotic conclusion.
Depends on
Used by
- One minimum-norm IRLS step Algorithm
- Likelihood deviance for nested models on common support Definition
- A mean-matched count law can be overdispersed relative to Poisson Example
- A one-observation Bernoulli-logit Fisher-scoring step Example
- A one-observation Poisson-log Fisher-scoring step Example
- Complete separation prevents a finite logistic MLE Example
- Rank deficiency gives singular information and nonunique weighted least squares Example
- The Bernoulli identity-link boundary leaves the regular family Example
- The minimum-norm IRLS step is well-defined for every design rank Lemma
- Canonical-link score and Hessian Theorem
- General-link score and Fisher information Theorem
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
- Philippe Rigollet, MIT 18.650 Statistics for Applications, Lecture 10: Generalized Linear Models, PDF pp. 23–33, 40–52 (standard reference, not scraped)
- Ryan Tibshirani, Generalized Linear Models, CMU Advanced Methods for Data Analysis, PDF pp. 1–5 (standard reference, not scraped)