On the rate of convergence of the ECME algorithm for multiple regression models with t-distributed errors

Jeanne Kowalski, M. T U Xin, Roger S. Day, José R. Mendoza-Blanco

Research output: Contribution to journalArticle

Abstract

Although much work has been done on comparing and contrasting the EM and ECME algorithms, in terms of their rates of convergence, it is not clear what mechanism underlies each and, furthermore, what factors may determine and influence their rates of convergence. In this paper, we examine the convergence rates and properties of these two popular optimisation algorithms as used in computing the maximum likelihood estimates from regression models with {-distributed errors. By approaching this computing problem through the use of two data augmentation schemes, as well as variations of these wellknown algorithms, we offer a more composite view on the performance of each.

Original languageEnglish (US)
Pages (from-to)269-281
Number of pages13
JournalBiometrika
Volume84
Issue number2
StatePublished - 1997
Externally publishedYes

Fingerprint

Multiple Regression
Multiple Models
Regression Model
Rate of Convergence
Data Augmentation
Computing
Maximum Likelihood Estimate
Convergence Properties
Likelihood Functions
Convergence Rate
Optimization Algorithm
Composite
Maximum likelihood
Composite materials
Regression model
Multiple regression
Rate of convergence
Influence

Keywords

  • ECME
  • EM
  • Maximum likelihood
  • R-distribution
  • Step-length newton's method

ASJC Scopus subject areas

  • Agricultural and Biological Sciences(all)
  • Agricultural and Biological Sciences (miscellaneous)
  • Statistics and Probability
  • Mathematics(all)
  • Applied Mathematics

Cite this

Kowalski, J., Xin, M. T. U., Day, R. S., & Mendoza-Blanco, J. R. (1997). On the rate of convergence of the ECME algorithm for multiple regression models with t-distributed errors. Biometrika, 84(2), 269-281.

On the rate of convergence of the ECME algorithm for multiple regression models with t-distributed errors. / Kowalski, Jeanne; Xin, M. T U; Day, Roger S.; Mendoza-Blanco, José R.

In: Biometrika, Vol. 84, No. 2, 1997, p. 269-281.

Research output: Contribution to journalArticle

Kowalski, J, Xin, MTU, Day, RS & Mendoza-Blanco, JR 1997, 'On the rate of convergence of the ECME algorithm for multiple regression models with t-distributed errors', Biometrika, vol. 84, no. 2, pp. 269-281.
Kowalski, Jeanne ; Xin, M. T U ; Day, Roger S. ; Mendoza-Blanco, José R. / On the rate of convergence of the ECME algorithm for multiple regression models with t-distributed errors. In: Biometrika. 1997 ; Vol. 84, No. 2. pp. 269-281.
@article{c301443de6464bdcb511f4d3a7c16347,
title = "On the rate of convergence of the ECME algorithm for multiple regression models with t-distributed errors",
abstract = "Although much work has been done on comparing and contrasting the EM and ECME algorithms, in terms of their rates of convergence, it is not clear what mechanism underlies each and, furthermore, what factors may determine and influence their rates of convergence. In this paper, we examine the convergence rates and properties of these two popular optimisation algorithms as used in computing the maximum likelihood estimates from regression models with {-distributed errors. By approaching this computing problem through the use of two data augmentation schemes, as well as variations of these wellknown algorithms, we offer a more composite view on the performance of each.",
keywords = "ECME, EM, Maximum likelihood, R-distribution, Step-length newton's method",
author = "Jeanne Kowalski and Xin, {M. T U} and Day, {Roger S.} and Mendoza-Blanco, {Jos{\'e} R.}",
year = "1997",
language = "English (US)",
volume = "84",
pages = "269--281",
journal = "Biometrika",
issn = "0006-3444",
publisher = "Oxford University Press",
number = "2",

}

TY - JOUR

T1 - On the rate of convergence of the ECME algorithm for multiple regression models with t-distributed errors

AU - Kowalski, Jeanne

AU - Xin, M. T U

AU - Day, Roger S.

AU - Mendoza-Blanco, José R.

PY - 1997

Y1 - 1997

N2 - Although much work has been done on comparing and contrasting the EM and ECME algorithms, in terms of their rates of convergence, it is not clear what mechanism underlies each and, furthermore, what factors may determine and influence their rates of convergence. In this paper, we examine the convergence rates and properties of these two popular optimisation algorithms as used in computing the maximum likelihood estimates from regression models with {-distributed errors. By approaching this computing problem through the use of two data augmentation schemes, as well as variations of these wellknown algorithms, we offer a more composite view on the performance of each.

AB - Although much work has been done on comparing and contrasting the EM and ECME algorithms, in terms of their rates of convergence, it is not clear what mechanism underlies each and, furthermore, what factors may determine and influence their rates of convergence. In this paper, we examine the convergence rates and properties of these two popular optimisation algorithms as used in computing the maximum likelihood estimates from regression models with {-distributed errors. By approaching this computing problem through the use of two data augmentation schemes, as well as variations of these wellknown algorithms, we offer a more composite view on the performance of each.

KW - ECME

KW - EM

KW - Maximum likelihood

KW - R-distribution

KW - Step-length newton's method

UR - http://www.scopus.com/inward/record.url?scp=0002260147&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0002260147&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0002260147

VL - 84

SP - 269

EP - 281

JO - Biometrika

JF - Biometrika

SN - 0006-3444

IS - 2

ER -