{'fraction_non_alphanumeric': 0.016624040920716114, 'fraction_numerical': 0.0, 'mean_word_length': 5.165354330708661, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On the rate of convergence of the ECME algorithm for multiple regression models with t-distributed errors

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 t-distributed errors. By approaching this computing problem through the use of two data augmentation schemes, as well as variations of these well-known algorithms, we offer a more composite view on the performance of each.