Generalized linear array model

In statistics, the generalized linear array model(GLAM) is used for analyzing the data sets with array structure. It based on the generalized linear model with the regression matrix written as a Kronecker product.

Overview

In the article published in the Journal of the Royal Statistical Society series B, 2006, Currie, Durban and Eilers introduced the generalized linear array model or GLAM. GLAMs 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 the data $mathbf\; Y$ is arranged in a $d$-dimensional array with size $n\_1\; imes\; n\_2\; imesldots\; imes\; n\_d$; thus,the corresponding data vector $mathbf\; y\; =\; extbf\{vec\}(mathbf\; Y)$ has size $n\_1n\_2n\_3cdots\; n\_d$. Suppose also that the regression matrix $mathbf\; X\; =\; mathbf\; X\_dotimesmathbf\; X\_\{d-1\}otimesldotsotimesmathbf\; X\_1$.

The standard analysis of a GLM with data vector $mathbf\; y$ and regression matrix $mathbf\; X$ proceeds by repeated evaluation of the scoring algorithm

where represents the approximate solution of , and is the improved value of it; $mathbf\; W\_delta$ is the diagonal weight matrix with elements

$w\_\{ii\}^\{-1\}\; =\; left(frac\{partialeta\_i\}\{partialmu\_i\}\; ight)^2\; ext\{var\}(y\_i),$

and is the working variable.

Computationally, GLAM provides array algorithms to calculate the linear predictor, and the weighted inner product $mathbf\; X\text{'}\; ilde\{mathbf\; W\}\_deltamathbf\; X$ without evaluation of the model matrix $mathbf\; X$.

Example: In 2 dimensions, let $mathbf\; X\; =\; mathbf\; X\_2otimesmathbf\; X\_1$ then the linear predictor is written where is the matrix of coefficients; the weighted inner product is obtained from $G(mathbf\; X\_1)\text{'}\; mathbf\; W\; G(mathbf\; X\_2)$ and $mathbf\; W$ is the matrix of weights; here $G(mathbf\; M)$ is the row tensor function of the $r\; imes\; c$ matrix $mathbf\; M$ given by

$G(mathbf\; M)\; =\; (mathbf\; M\; otimes\; mathbf\; 1\text{'})\; *\; (mathbf\; 1\text{'}\; otimes\; mathbf\; M)$ where $*$ means element by element multiplcation and $mathbf\; 1$ is a vector of 1's of length $c$.

These low storage high speed formulae extend to $d$-dimensions.

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

References

* I.D Currie, M. Durban and P. H. C. Eilers (2006) Generalized linear array models with applications to multidimensional smoothing,"Journal of Royal Statistical Society - Series B", 68, part 2, 259-280.