ⓘ Generalized linear array model. In statistics, the generalized linear array model is used for analyzing data sets with array structures. It based on the general ..


ⓘ Generalized linear array model

In statistics, the generalized linear array model is used for analyzing data sets with array structures. It based on the generalized linear model with the design matrix written as a Kronecker product.


1. Overview

The generalized linear array model or GLAM was introduced in 2006. Such models provide a structure and a computational procedure for fitting generalized linear models or GLMs whose model matrix can be written as a Kronecker product and whose data can be written as an array. In a large GLM, the GLAM approach gives very substantial savings in both storage and computational time over the usual GLM algorithm.

Suppose that the data Y {\displaystyle \mathbf {Y} } is arranged in a d {\displaystyle d} -dimensional array with size n 1 × n 2 × … × n d {\displaystyle n_{1}\times n_{2}\times \ldots \times n_{d}} ; thus, the corresponding data vector y = vec Y {\displaystyle \mathbf {y} ={\textbf {vec}}\mathbf {Y}} has size n 1 n 2 n 3 ⋯ n d {\displaystyle n_{1}n_{2}n_{3}\cdots n_{d}}. Suppose also that the design matrix is of the form

X = X d ⊗ X d − 1 ⊗ … ⊗ X 1. {\displaystyle \mathbf {X} =\mathbf {X} _{d}\otimes \mathbf {X} _{d-1}\otimes \ldots \otimes \mathbf {X} _{1}.}

The standard analysis of a GLM with data vector y {\displaystyle \mathbf {y} } and design matrix X {\displaystyle \mathbf {X} } proceeds by repeated evaluation of the scoring algorithm

X ′ W ~ δ X θ ^ = X ′ W ~ δ z ~, {\displaystyle \mathbf {X} {\tilde {\mathbf {W} }}_{\delta }\mathbf {X} {\hat {\boldsymbol {\theta }}}=\mathbf {X} {\tilde {\mathbf {W} }}_{\delta }{\tilde {\mathbf {z} }},}

where θ ~ {\displaystyle {\tilde {\boldsymbol {\theta }}}} represents the approximate solution of θ {\displaystyle {\boldsymbol {\theta }}}, and θ ^ {\displaystyle {\hat {\boldsymbol {\theta }}}} is the improved value of it; W δ {\displaystyle \mathbf {W} _{\delta }} is the diagonal weight matrix with elements

w i − 1 = ∂ η i ∂ μ i 2 var y i, {\displaystyle w_{ii}^{-1}=\left{\frac {\partial \eta _{i}}{\partial \mu _{i}}}\right^{2}{\text{var}}y_{i},}


z = η + W δ − 1 y − μ {\displaystyle \mathbf {z} ={\boldsymbol {\eta }}+\mathbf {W} _{\delta }^{-1}\mathbf {y} -{\boldsymbol {\mu }}}

is the working variable.

Computationally, GLAM provides array algorithms to calculate the linear predictor,

η = X θ {\displaystyle {\boldsymbol {\eta }}=\mathbf {X} {\boldsymbol {\theta }}}

and the weighted inner product

X ′ W ~ δ X {\displaystyle \mathbf {X} {\tilde {\mathbf {W} }}_{\delta }\mathbf {X} }

without evaluation of the model matrix X. {\displaystyle \mathbf {X}.}


1.1. Overview Example

In 2 dimensions, let X = X 2 ⊗ X 1, {\displaystyle \mathbf {X} =\mathbf {X} _{2}\otimes \mathbf {X} _{1},} then the linear predictor is written X 1 Θ X 2 ′ {\displaystyle \mathbf {X} _{1}{\boldsymbol {\Theta }}\mathbf {X} _{2}} where Θ {\displaystyle {\boldsymbol {\Theta }}} is the matrix of coefficients; the weighted inner product is obtained from G X 1 ′ W G X 2 {\displaystyle G\mathbf {X} _{1}\mathbf {W} G\mathbf {X} _{2}} and W {\displaystyle \mathbf {W} } is the matrix of weights; here G M {\displaystyle G\mathbf {M}} is the row tensor function of the r × c {\displaystyle r\times c} matrix M {\displaystyle \mathbf {M} } given by

G M = M ⊗ 1 ′ ∗ 1 ′ ⊗ M {\displaystyle G\mathbf {M}=\mathbf {M} \otimes \mathbf {1}*\mathbf {1} \otimes \mathbf {M}}

where ∗ {\displaystyle *} means element by element multiplication and 1 {\displaystyle \mathbf {1} } is a vector of 1s of length c {\displaystyle c}.

These low storage high speed formulae extend to d {\displaystyle d} -dimensions.


2. Applications

GLAM is designed to be used in d {\displaystyle d} -dimensional smoothing problems where the data are arranged in an array and the smoothing matrix is constructed as a Kronecker product of d {\displaystyle d} one-dimensional smoothing matrices.

  • squares Generalized linear array model Generalized linear mixed model Generalized linear model Generalized logistic distribution Generalized method of moments
  • Models New York: Cambridge University Press. pp. 119 124. ISBN 978 - 0 - 521 - 68689 - 1. Hardin, James Hilbe, Joseph 2007 Generalized Linear Models and
  • Generalized keyboards are musical keyboards, a type of isomorphic keyboard, with regular, tile - like arrangements usually with rectangular or hexagonal
  • designed, RNA - Seq can also be used for new model organisms whose genome has not been sequenced yet. An array or slide is a collection of features spatially
  • generalized inverse. Matrices and matrix multiplication reveal their essential features when related to linear transformations, also known as linear maps
  • Leon - Montiel, R. de J. Moya - Cessa, H. 2011 Modeling non - linear coherent states in fiber arrays International Journal of Quantum Information. 9
  • from a model - fitting procedure using those data. Even if a model - fitting procedure has been used, R2 may still be negative, for example when linear regression
  • processing, linear algebra, array and complex operations, curve fitting and statistics. Lis is a scalable parallel library for solving systems of linear equations
  • Vega, A. Weiner, A. M. Lin, C. 2003 Generalized grating equation for virtually - imaged phased - array spectral dispersers Applied Optics. 42 20
  • can be described as a linear model with N basis terms, the proper color transformation will be the weighted sum of N fixed linear transformations, not
  • library for manipulating sets and relations of integer points bounded by linear constraints. The following operations are supported: intersection, union
  • ADMB or AD Model Builder is a free and open source software suite for non - linear statistical modeling It was created by David Fournier and now being developed

Users also searched: