Modified Fisher scoring algorithms using Jacobi or Gauss-Seidel subiterations

Jun Ma, H. Malcolm Hudson

    Research output: Contribution to journalArticle

    4 Citations (Scopus)

    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 al-gorithms, especially the one with Gauss-Seidel scheme, exhibit much faster convergence than competitors such as the EM algorithm.

    Original languageEnglish
    Pages (from-to)467-479
    Number of pages13
    JournalComputational Statistics
    Volume12
    Issue number4
    Publication statusPublished - 1997

    Keywords

    • Exponential family
    • Fisher scoring
    • Gauss-Seidel subiterations
    • Jacobi subiterations
    • Maximum penalized likelihood

    Fingerprint Dive into the research topics of 'Modified Fisher scoring algorithms using Jacobi or Gauss-Seidel subiterations'. Together they form a unique fingerprint.

    Cite this