Rasch model estimation

Estimation of a Rasch model is used to estimate the parameters of the Rasch model.

Various techniques are employed to estimate the parameters from matrices of response data.

The most common approaches are types of maximum likelihood estimation, such as joint and conditional maximum likelihood estimation.

Joint maximum likelihood (JML) equations are efficient, but inconsistent for a finite number of items, whereas conditional maximum likelihood (CML) equations give consistent and unbiased item estimates.

Person estimates are generally thought to have bias associated with them, although weighted likelihood estimation methods for the estimation of person parameters reduce the bias.

The Rasch model for dichotomous data takes the form: where

denote the observed response for person n on item i.

The probability of the observed data matrix, which is the product of the probabilities of the individual responses, is given by the likelihood function The log-likelihood function is then where

is the total raw score for person n,

Solution equations are obtained by taking partial derivatives with respect to

The resulting estimates are biased, and no finite estimates exist for persons with score 0 (no correct responses) or with 100% correct responses (perfect score).

The same holds for items with extreme scores, no estimates exists for these as well.

This bias is due to a well known effect described by Kiefer & Wolfowitz (1956).

, and a more accurate (less biased) estimate of each

The conditional likelihood function is defined as in which is the elementary symmetric function of order r, which represents the sum over all combinations of r items.

For example, in the case of three items, Details can be found in the chapters by von Davier (2016) for the dichotomous Rasch model and von Davier & Rost (1995) for the polytomous Rasch model.

Some kind of expectation-maximization algorithm is used in the estimation of the parameters of Rasch models.

Algorithms for implementing Maximum Likelihood estimation commonly employ Newton–Raphson iterations to solve for solution equations obtained from setting the partial derivatives of the log-likelihood functions equal to 0.

Convergence criteria are used to determine when the iterations cease.