Modified Fisher Scoring Algorithms Using Jacobi or Gauss-Seidel Subiterations

Computational Statistics, Vol. 12, No.4 1997

Posted: 2 Mar 1998

See all articles by Jun Ma

Jun Ma

Macquarie University - Department of Statistics

H. Malcolm Hudson

Macquarie University - Department of Statistics

Abstract

In a parameter estimation problem with large numbers of unknown parameters, traditional algorithms such as fisher scoring and Newton-Raphson become impractical. A typical case is solution by discretization of linear inverse problems; an example is medical image reconstruction from projections. This article introduces a modification to the Fisher scoring method. Instead of solving the linear system of equations of each Fisher scoring iteration exactly, the solution of these equations is approximated by using the Jacobi or Gauss-Seidel scheme. Simulation studies show that these modified algorithms, especially the one with Gauss-Seidel scheme, exhibit much faster convergence than competitors such as the EM algorithm.

JEL Classification: C10, C13

Suggested Citation

Ma, Jun and Hudson, H. Malcolm, Modified Fisher Scoring Algorithms Using Jacobi or Gauss-Seidel Subiterations. Computational Statistics, Vol. 12, No.4 1997, Available at SSRN: https://ssrn.com/abstract=58080

Jun Ma (Contact Author)

Macquarie University - Department of Statistics ( email )

Sydney, NSW 2109
Australia
+61-2-9850-8548 (Phone)
+61-2-9850-7669 (Fax)

H. Malcolm Hudson

Macquarie University - Department of Statistics ( email )

Sydney, NSW 2109
Australia
+61-2-9850-8557 (Phone)
+61-2-9850-7669 (Fax)

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Abstract Views
1,363
PlumX Metrics