Interpreting Word Embeddings with Generalized Low Rank Models
Abstract
Glove and Skip-gram word embedding methods learn word vectors by decomposing a matrix of word co-occurrences into a product of low-rank matrices.
In this work, we propose an iterative algorithm for computing word embeddings based on constructing word occurrence matrices via Generalized Low Rank Models.
Our algorithm generalizes both Skip-gram and GloVe as well as giving rise to other embedding methods based on the speciﬁed occurrence matrix distribution and the number of iterations in the iterative algorithm.
In particular, using a
Tweedie distribution with one-step in the iterative framework results in the GloVe embedding whereas a multinomial distribution with full-convergence mode results in the skip-gram model.
Experimental results demonstrate improved results of our model over the GloVe method on a word analogy similarity task
Introduction
Word embeddings are low dimensional vector representations of words or phrases.
They are applied to word analogy tasks and used as feature vectors in numerous tasks within natural language processing, computational linguistics, and machine learning.
They are constructed by various methods which rely on the distributional hypothesis popularized by Firth: “words are characterized by the company they keep” [Firth, 1962].
Two seminal methodological approaches to ﬁnding word embeddings are
Skip-gram [Mikolov et al., 2013a] and GloVe [Pennington et al., 2014].
Both methods input a corpus
D , process it into a word co-occurence matrix Y , then output word vectors with some dimension d .
Skip-gram processes a corpus with w words and c contexts into a co-occurence matrix Y ∈ R w × c , where y ij is the number of times word w i is used in context c j in the corpus.
Next, Skip-gram [Pennington et al., 2014, Section 3.1] estimates
[Equation]
then deﬁnes the word vectors to be the rows of ˆ U and the context vectors are the rows of ˆ V .
GloVe processes a corpus with w words into a co-occurence matrix Y ∈ R w × w where y ij is the harmonic sum of the number of tokens between words w i and w j for each co-occurrences.
That is,
[Equation]
where D ( p 1 ) is the p th1 word in the corpus and l c is the length of the context window .
Next, GloVe estimates
[Equation]
where uuu i is the i th row of the matrix U , vvv j is the j th row of the matrix V , ψ i and ω
j are bias terms, and y max is some prespeciﬁed cutoff.
GloVe then deﬁnes the estimated word vectors to be the rows of 12 ˆ U + 12 ˆ V .
In both Skip-gram and GloVe, a matrix of co-occurences Y is introduced by processing the corpus, and an objective function is introduced to ﬁnd a low rank factorization related to the co-occurences
Y .
In this paper, we derive the corpus processing techniques and loss functions from principled model-based assumptions.
We introduce a model-based iterative algorithm, and show that (1) results from running the iterative algorithm until completion for a Multinomial model and (2) is a one step of the iterative algorithm for a Tweedie model.
This algorithms allows us to introduce methods intimately related to Skip-gram and GloVe and to introduce altogether new methods.
Related Work
In the introduction, we saw that Skip-gram and GloVe compute a co-occurence matrix Y which results from processing the corpus D and an objective function L to relate the matrix Y to a product of low rank matrices.
Many existing approaches for explaining word embedding methods do so by identifying or deriving the co-occurence matrix Y or the objective function L .
In this section, we review relevant work in this area, which helps frame our approach discussed in Section 4.
Much of the related work involves using the co-occurence matrix from Skip-gram, where the rows represent words, the columns represent context, and the entry of the matrix represents the frequency of the word-context pair: Deﬁne Y to be this matrix.
Early approaches to ﬁnding low-dimensional embeddings of words relied on the singular value decomposition [Landauer et al., 1998, Turney and Pantel, 2010].
These methods would truncate the singular value decomposition by zeroing out the small singular values.
Eckart and Young [1936] show that this is equivalent to using a loss function L which is invariant to orthogonal transformation.
For simplicity, these early approaches ﬁnd
[Equation]
where the Frobenius norm is the choice of loss function.
The co-occurence matrix and the loss function for Skip-gram can be read off from equation (1).
Cotterell et al.
ﬁnd a probabilistic interpretation of this loss function related to a Binomial distribution.
Mikolov et al.
[2013b] introduce Skip-gram with negative sampling (SGNS), a variant of Skip-gram.
If we view Skip-gram as maximizing the true positive rate of predicting a word will be in a given context, we can view SNGS as maximizing the true positive rate plus k times an approximation of the true negative rate.
When k = 0 , Skip-gram and SGNS coincide.
Levy and Goldberg [2014] use a heuristic argument to interpret SGNS as using a co-occurence matrix which is a shifted PMI.
Deﬁne the total number of times word w
i appears t i
= (cid:80) c
˜ j =
y i ˜ j , the total number of times context c
j appears t j = (cid:80) w ˜ i =1 y ˜ ij , and the total number of words t
= (cid:80) w,c ˜ i, ˜ j
=1 y ˜ i ˜
j .
The shifted PMI matrix has has entries log y ij t t i t j − log k .
However, they were unable to determine the loss function.
Later, Li et al.
[2015] and Landgraf and Bellay [2017] were able to explicitly identify both the loss function and the co-occurence matrix.
They ﬁnd a different co-occurence matrix than
Levy and Goldberg [2014], one that does not depend on k , while their loss function does depend on k .
Surprisingly, they argue that SGNS is using Y , the same matrix that Skip-gram uses.
The loss function is
[Equation]
Landgraf and Bellay [2017] explain that this loss function has a probabilistic interpretation, and they use that interpretation to recover the shifted PMI matrix as a plug in estimator within their model.
The approach in this paper will be to view the co-occurence matrix as having each entry be a random variable and connect the loss function to the likelihood of the random variable.
This approach was shown to be effective by Cotterell et al.
[2017] and Landgraf and Bellay [2017].
Before this, we need to review some relevant modeling background.
Generalized Low Rank Models
Generalized linear models model a response vector y as estimated given an input matrix X and an assumed link-linear relationship with the mean of y given X . A brief introduction to generalized linear models is given in the Appendix in Section 7.2. We now consider two important generalizations of generalized linear models: (1) extending the response to a matrix Y ∈ R n × m , and (2) an unsupervised low-rank relationship for the systematic component η . Principal components analysis (PCA) Jolliffe [2011], is one well-known method for computing a low-rank approximation to a matrix Y which satisﬁes both (1) and (2).
In PCA, we write y ij ∼
Normal( uuu T
i vvv j , σ 2 ) where each y ij is independent, and uuu i ,
vvv j ∈ R d for some dimension d (cid:28) n, m .
The maximum likelihood estimator for uuu i is taken to be a low-dimensional embedding of the i th row of the response Y .
A similar extension from linear models to generalized linear models allows us to generalize from PCA to generalized low rank models [Udell et al., 2014] allowing us to estimate model-based low-dimensional embeddings of non-normal data.
Deﬁnition 1 For some exponential dispersion family ED( µ, ϕ ) with mean parameter µ and dispersion parameter ϕ , the model for Y ∈ R n × m is a generalized low rank model with link function g when
[Equation]
where uuu i ,vvv j ∈ R
d are the rows of matrices U ∈ R n × d and V ∈ R m × d , respectively, and ψψψ,
ωωω ∈ R
d are offset or bias terms. The difference between the generalized low rank model, and the generalized linear model from Deﬁnition (3) is in the systematic component (third line of Deﬁnition (4)). In generalized low rank models, the link-transformed mean is modeled as a low rank matrix which is the product of two matrices with small number of columns d .
In other words, generalized low rank models ﬁnd low-dimensional embeddings of the mean of the response on a scale determined by the link function.
In Section 4 we present an iterative algorithm inspired by IRLS which to estimate the maximum likelihood estimator of a generalized low rank model. In Section 5, we show that this method allows us to compute word embeddings.  Methodology In Section 7.2 of the Appendix following our introduction of generalized linear models, we introduced the IRLS method for computing the MLE ˆ βββ , and in Section 3 we introduced generalized low rank models.
We now present Algorithm 1 for performing an algorithm analogous to IRLS on a cooccurrence matrix Y to produce embedding matrices ˆ U and ˆ V .
This algorithm gives us an effective procedure for constructing word embeddings ˆ U and ˆ V from a corpus D .
4.1 Our Proposed Method
Our proposed method has three steps:
Choose a co-occurence matrix
Y ∈ R w × c to summarize the document.
(Note, in some cases that c = w .)
Choose a plausible exponential dispersion family to model the entries of the co-occurence matrix
Run IRLS using the chosen exponential dispersion family to output word vectors
We will in practice always make a default choice of the link function that only depends on the distribution.
This makes it so that there is no need to input the link function into the algorithm.
Data: Co-occurrence Matrix Y ∈ R w × c
Require: Distribution ED ( x ; µ, ϕ ) , number of steps T , Dimension d
Result: ˆ U ∈ R w × d , ˆ V ∈ R c × d , ˆ ψψψ ∈ R w , ˆ ωωω ∈ R c
Initialize µ (0) =
Y ;
Compute W (0) and Z (0) according to Equations (8) and (9); for t = 0 : T do
Evaluate the least squares problem arg
[Equation]
Update µ ( t +1) according to µ ij = uuu
Ti vvv j + ω i + ψ j ;
Update W ( t +1) according to Equation (8);
Update Z ( t +1) according to Equation (9); end return ˆ U ( T ) , ˆ V ( T ) , ˆ ψψψ ( T ) , ˆ ωωω ( T )
We regularize the word vectors by including the penalty
[Equation]
(3) with λ = .
002 for two reasons.
One is to reduce some noise in the estimation of the word vectors.
Udell et al.
[2014, Lemma 7.3] show that penalizing by (3) is equivalent to penalizing by λ (cid:107) UV T (cid:107) ∗ , the nuclear norm of UV T .
Since penalizing the nuclear norm UV T shrinks the dimension of the embedding and larger dimensional embeddings tend to be better [Melamud et al., 2016], we choose a small tuning parameter to reduce noise while still preserving the dimension.
Another reason is to symmetrically distribute the singular values of ˆ U ˆ V T to both matrices ˆ U and ˆ V .
Write the singular value decomposition ˆ U ˆ V T = U Σ V T , for U and V orthogonal and Σ diagonal.
Mu et al.
[2018, Theorem 1] shows that using penalty (3) results in having ˆ U
= U Σ 1 / 2 Q and ˆ V = V Σ 1 / 2 Q for some orthogonal matrix Q .
This is desirable since it was argued by Levy et al.
[2015] that it has empirically been shown that a symmetric distribution of singular values works optimally on semantic tasks.
4.2 Examples 4.2.1 First example: GloVe
The ﬁrst step of our algorithm is to pick a co-occurence matrix Y ∈ R w × w that summarizes the corpus.
We will pick the one used by GloVe, so that y ij = (cid:80) p 1 <p 2 , | p 1 − p 2 |≤ l c , D ( p 1 )=
w i , D ( p 2 )=
w j 1 | p 1 − p 2 | .
Now we must determine a plausible distribution for the co-occurence matrix that lies within the exponential dispersion family.
Recall that the Tweedie distribution has the property mentioned in equation (5) that it is a sum of Poisson many independent Gamma distributions.
An informal way to write this is that
[Equation]
where the InvGamma distribution is deﬁned to be the reciprocal of the Gamma distribution.
The
InvGamma distribution is supposed on the positive real line.
We will argue that the Tweedie distribution is a reasonable distribution for the entries of the cooccurence matrix.
We will do this by connecting the Poisson and Gamma distributions in displayed above to attributes of the corpus.
It seems intuitively reasonable that the number of times word w i and word w j co-occur within the corpus could be modeled as having a Poisson distribution.
It’s also possible that the number of tokens between word w i and word w j at some co-occurence is appromximately InvGamma for some choice of rate and scale parameters.
Note there’s an approximation being made here where the number of tokens is an integer but the InvGamma isn’t necessarily.
Now we need to ﬁnd the weight W and the pseudo-response Z that the Tweedie distribution provides.
This only amounts to plugging in the cumulant generating function b which we found in 7.1.
When we do this, we ﬁnd that
[Equation]
When we initialize the algorithm with ˆ µ (0)
=
Y , the pseudo response simpliﬁed to z ij = log y ij .
When you further choose p = 1 . 25 , the weight simpliﬁes to y 3 / 4 ij .
In summary, we’ve shown that:
Result[-
-]
1 Inputting the harmonic co-occurence matrix used by GloVe, Tweedie distribution with power p = 1.25, number of iterations T = 1 into our algorithm
results
in GloVe ( without the weights being truncated.) Given this connection, we can extend GloVe by either early stopping the algorithm some time after the ﬁrst iteration or running the algorithm either until completion.
4.3 Second example: SVD, Skip-gram, and more
We will pick a new co-occurence matrix to summarize the corpus.
In this case, we will pick the co-occurence matrix
Y ∈ R w × c so that Y ij is the number of times word
w i appears in context c j .
4.3.1 The SVD
For step 2 of the algorithm, we could propose that the entries of Y follow a Gaussian distribution.
For step 3, the algorithm will always converge in one iteration, so our method recovers the method of computing a truncated SVD by Eckart and Young [1936].
4.3.2 Skip-gram
For step 2 of the algorithm, we could propose that the entries of Y follow a multinomial distribution.
Speciﬁcally, we could propose that the the row of Y corresponding to the i th word has the distribution
[Equation]
where πππ ∈ R c is vector of probabilities of appearing within each context and (cid:80) wi =1 y ij is the total number of times word w i appears in the corpus.
This was the approach taken by Cotterell et al.
It would be interesting to propose the weight and pseudo-response here so that we can see what the form of the one-step estimator would be.
We suspect that it could recover the estimator of Arora et al.
[2016], since they ﬁnd their estimator via the second order Taylor expansion of the likelihood, completely analogous to Newton’s method, which is the basis for IRLS.
One iteration of algorithm would result in an estimator which is equivalent to doing a second-order Taylor expansion around the co-occurence matrix Y .
4.3.3 New estimator
In the previous section, there was a problem with the model description: the co-occurence matrix
Y had entries appearing on both the left-hand and right-hand side!
This problem appeared since it is unknown to us what the total number of times word w i will appear in the corpus.
This means that the Poisson distribution is a more appropriate model for the co-occurence matrix Agresti [2014,
Section 7.2.1].
For step 2, we could instead propose a Poisson distribution to model the entries of the co-occurence matrix.
It seems likely to the authors that this would lead to improvements.
Experiments
In Section 4 we introduced an IRLS algorithm to compute word embeddings such as those produced by GloVe.
We now conduct quantitative evaluation experiments on an English word analogy task, a variety of word similarity tasks [Mikolov et al., 2013a] to demonstrate the performance of the algorithm.
First, in Section 5.1 we introduce the analogy similarity task for evaluating word vectors.
In Section 5.2 our parameter conﬁgurations and training procedure.
In Sections 5.3-5.6 we present results of our algorithm in numerous scenarios showcasing improvement through multiple steps and robustness to other model parameters.
5.1 Word Analogies
We introduce the word analogy task following the presentation of [Pennington et al., 2014].
The word analogy task is a dataset of 19 , 544 statements of the basic form “a is to b as c is to __”, which are divided into a semantic and syntactic subsets.
The semantic statements are typically analogies relating to people, places, or nouns such as “Athens is to Greece as Berlin is to __”, while the syntactic questions relate to verb or adjective forms such as “dance is to dancing as ﬂy is to __”.
The basic analogy statement is answered by ﬁnding the closest vector uuu d to uuu b − uuu a + uuu c 1 in the embedding space via cosine similarity 2 .
The task has been shown under speciﬁc assumptions to be provably solvable by methods such as GloVe and Skip-gram [Ethayarajh et al., 2018, Gittens et al., 2017] and as such is closely related to solving the objectives introduced in Sections 1 and 4.
5.2 Training Details
We train our models on the English text8 corpus 3 with approximately 17 million tokens.
We ﬁlter out word types that occur fewer than 50 times to obtain a vocabulary size of approximately 11 , 000 ; a ratio consistent with other embedding literature experiments 4 .
The adjustable model conﬁgurations in our algorithm are the choice of power parameter p , penalty tuning parameter λ , and co-occurrence processing step.
We experiment with different choices of p ∈ { 1 . 1 , 1 . 25 , 1 . 5 , 1 . 75 , 1 . 9 } , different choices of processing including no processing, clamping the weights (as in GloVe) and truncating the outliers in the co-occurrence matrix (elaborated on in
Section 5.5, and set the penalty tuning parameter λ = 0 . 002 .
The estimated word vectors are the rows of 12 ˆ U + 12 ˆ V .
[Table] For all of our experiments, we set the dimension of the word vectors to d = 150 , and the objective function at each iteration is optimized using Adagrad [Duchi et al., 2011] with a ﬁxed learning rate of 0 .
Models are trained for up to 50 epochs ( 50 passes through the co-occurrence matrix) with batches of size 512 .
5.3 Experiment 1: Multiple Iteration Effects
We present results of multiple steps of our IRLS algorithm compared to the GloVe method.
In particular, to match the GloVe objective function and processing, we set the weight function in our model from f ( y ) =
y 2 − p to f ( y ) =
(cid:16) y y max (cid:17) 2 − p with y max = 10 and p = 1 . 25 , and note when initializing µ = y , the solution to 2 is exactly the solution of the IRLS algorithm at the ﬁrst step.
Results of the IRLS algorithm with these conﬁgurations is shown in Table 1.
We remark on a few observations based on the results in Table 1.
First, as the number of steps increases, the accuracy on the analogy task increases as well with the models at steps 3 - 5 doing relatively similarly and over 1% higher than the GloVe model.
Second, relatively few steps are needed with the accuracy being relatively similar for steps 3 - 5 in comparison to steps 1 and 2 .
Finally, we note that in this case running the algorithm for only 2 iteration is sufﬁcient to see an improvement over the one-step estimates.
5.4 Experiment 2: Effects of Varying p
Here we examine the effect of the choice of the power p in the tuning parameter when you run a
Tweedie generalized low rank model.
[Table] The Results in Table 2 show that values of p which are high perform poorly, while values of p around 1 . 25 and 1 . 5 perform similarly.
We ﬁnd that p = 1 . 5 performs the best, and view this value of p as a good choice as it accounts for zero-inﬂation present in Y .
5.5 Experiment 3: Effects of Co-Occurrence Matrix Transformations
With power p = 1 . 25 , we explore the effect of different strategies to handle large entries in the co-occurence matrix Y .
One strategy is to simply input Y into step 3 of our algorithm.
A second strategy is to truncate the weight W that results from step 3 of our algorithm, in a strategy similar to GloVe.
A third strategy is to input min { Y, Y max } into step 3 of our algorithm, where for us
Y max = 10010 = 10 , where 100 is the threshold chosen by GloVe Pennington et al.
[2014] and our corpus is 110th of the size of their corpus.
[Table]
We see that the clear best strategy is to truncate the weights at each step in the iterative algorithm, in a manner similar to GloVe.
5.6 Experiments: Regularization Effects
[Table]
Finally, we experiment with whether the penalty introduced in Equation (3) improves results and accurately reduces noise in the estimate.
We also consider not including the diagonal elements of
Y as a form of regularization and experiment here as well, as these terms are often large (can be considered as outliers) and do not contain a great deal of information.
Table 4 demonstrates the included regularization improves results.
Conclusion
We presented a general methodology for computing word vectors from a corpus, and demonstrate that many commonly used methods are special cases this methodology.
Our methodology allows us to analyze the distributional properties of the co-occurrence matrices and yields better objective functions for estimating word functions more particular to the characteristics of the corpora.
Experimental results on a small corpus demonstrates our method improves results on a word analogy similarity task.
It is our hope that this methodology can lead to the development of better, statistically sound word embeddings, and improve results on many other downstream tasks.
Appendix
In this section, we develop some background in exponential dispersion families [Jorgensen, 1997], generalized linear models [Agresti, 2014], and generalized low rank models [Udell et al., 2014].
7.1 Exponential dispersion families and the Tweedie distribution
We begin by discussing exponential dispersion families, the distribution of the response in generalized linear models.
Deﬁnition 2 Let y ∈ R be a random variable.
If the density function f
( y ; θ, φ ) of y satisﬁes
[Equation]
over its support, then the distribution of y is in the exponential dispersion family .
The parameter θ is the natural parameter , ϕ is the dispersion parameter , and the function b is the cumulant generating function .
In many cases, the function a ( ϕ ) is very simple, meaning that, for instance, a ( ϕ ) = 1 or a ( ϕ ) = ϕ .
The function c ( y ; ϕ ) can be viewed as the normalizing constant ensuring that the density integrates to one.
When y follows a distribution in the exponential dispersion family with natural parameter θ , its mean µ = b (cid:48) ( θ ) , so we can equivalently specify the mean µ or the natural parameter θ .
Many classical distributions such as the Poisson, Normal, Binomial, and Gamma distribution are exponential dispersion families.
For example, when y ∼ Normal( µ, σ 2 ) is a normal distribution with mean µ and variance σ 2 , its log density satisﬁes
[Equation]
showing that here the natural parameter θ = µ , the dispersion parameter ϕ
= σ 2 , the functions b ( θ ) =
12 θ 2 , a ( ϕ ) = ϕ ,
and c ( y ; ϕ ) = 12 log( [Equation]
The Tweedie distribution [Jorgensen, 1997], of particular importantance to us, also lies within the exponential dispersion family.
Instead of deﬁning the Tweedie distribution through the form of its density, we will deﬁne it through the relationship between its mean and variance.
This relies on a result from [Jorgensen, 1987, Theorem 1] that distributions within the exponential dispersion family are deﬁned by the relationship between their mean and variance.
Deﬁnition
A random variable y has a Tweedie distribution with power parameter p ∈ { 0 }∪ [1 , ∞ ) when var
[Equation]
and the distribution of y is an exponential dispersion family.
In this case, we write y ∼
Tweedie p ( µ, ϕ ) , where µ = E ( y ) is the mean.
The Normal distribution discussed above has a variance that does not depend on the mean.
In our new notation, this means that the Normal distribution is a Tweedie distribution with power parameter p = 0 .
The Poisson distribution has variance equal to the mean and is in the exponential dispersion family, so is a Tweedie distribution with power parameter p
= 1 and dispersion parameter ϕ
= 1 .
A Gamma distribution with shape parameter α and rate parameter β is a Tweedie distribution with power p = 2 , mean µ = αβ , and dispersion parameter ϕ
= α − 1 .
We will only consider Tweedie distributions with power parameter p ∈ (1 , 2) .
These distributions are also known as compound Poisson-Gamma distributions due to the representation
[Equation]
where n ∼ Poisson( λ ) and g i i .
i .
d . ∼ Gamma( α, β ) , and λ = µ 2 − p (2 − p ) ϕ , α = 2 − p p − 1 , and
β = µ 1 − p ( p − 1) ϕ
[Smyth, 1996].
It is important to note that the Tweedie distribution has positive mass at zero, an important characteristic for capturing the zero-inﬂation prominent in some co-occurence matrices.
Speciﬁcally,
[Equation]
Using other arguments related to representations of the mean and variance in terms of the cumulant generating function b , Jorgensen [1997] show that the Tweedie distribution has b ( θ ) =
12 − p ((1 − p ) θ ) 2 − p 1 − p .
7.2 Generalized linear models, the MLE, and iteratively re-weighted least squares
We start by introducing the linear model.
Given a response yyy ∈ R n comprising n observations, the model for yyy is a linear model with covariates xxx i ∈
R p when y i ind .
∼ Normal( xxx Ti βββ, σ 2 ) for all i ∈ { 1 , . . . , n } .
In vector notation, this reads that yyy ∼ Normal
( Xβββ, σ 2 I ) , where X ∈ R n × p is a matrix with i th row
xxx
i .
Generalized linear models remove the the assumptions of normality and that the mean is a linear function of the coefﬁcients βββ .
Deﬁnition
For some exponential dispersion family ED( µ, ϕ ) with mean parameter µ and dispersion parameter ϕ , the model for yyy ∈ R n is a generalized linear model with link function g when
[Equation]
In the ﬁrst line of the displayed relationships, the distribution of the response yyy is described.
In the third line, the systematic component η i expresses the effect of the covariates xxx i .
The second line connects the distribution to the covariates through the link function.
That is, the covariates effect a link-transformed mean.
Generalized linear models are used as the default modeling framework in many ﬁelds of applied science for non-normal distributions [McCullagh and Nelder, 1989].
When g ( µ ) = µ is the identity map and ED is the Normal distribution, the generalized linear model is simply the linear model.
When g ( µ ) = logit( µ ) = log 1 − µµ and ED is the Binomial distribution, the generalized linear model is logistic regression.
Further, a generalized linear model can be viewed as a no-hidden-layer neural network with activation function g .
The coefﬁcient βββ is unknown and a target of estimation in the generalized linear model.
The standard approach to compute βββ in a generalized linear model is maximum likelihood estimation [Fisher, 1922, Section 7] to produce the maximum likelihood estimator , or MLE ˆ βββ , with ˆ βββ deﬁned to be the maximizer of the likelihood of yyy given X .
Deﬁne (cid:96) ( βββ ) to be the negative log likelihood.
A natural way to estimate the MLE is through Fisher scoring, a version of Newton’s method on the log likelihood which uses the expectation of the Hessian in place of the Hessian [Agresti, 2014,
Section 4.5].
In notation, Fisher scoring produces a sequence of estimates { ˆ βββ ( t ) } ∞ t =1 starting with some initialization ˆ βββ (0) so that
[Equation]
where ∇ (cid:96) is the gradient and D 2 (cid:96) is the Hessian of the likelihood (cid:96) .
Upon plugging in the gradient and expected hessian of (cid:96) for an exponential family, a surprising identity emerges: each iteration of
Fisher scoring is equivalent to minimizing a weighted least squares objective:
[Equation]
where the weight W ( t ) is diagonal with
[Equation]
and the pseudo-response for observation i is
[Equation]
where ηηη ( t ) =
X ˆ βββ ( t ) and µ ( t )
i = g − 1 ( η ( t ) i ) .
7.3 Generalized low rank models
[-Deﬁnition 
-]