Generalized Linear Models are routinely used in data analysis. Classical estimators are based on the maximum likelihood principle and it is well known that the presence of outliers can have a large impact on them. Several robust procedures have been presented in the literature, being redescending M-estimators the most widely accepted. Based on non-convex loss functions, these estimators need a robust initial estimate, which is often obtained by subsampling techniques. However, as the number of unknown parameters increases, the number of subsamples needed in order for this method to be robust, soon makes it infeasible. Furthermore the subsampling procedure provides a non deterministic starting point. A new method for computing a robust initial estimator is proposed. This method is deterministic and demands a relatively short computational time, even for large numbers of covariates. The proposed method is applied to M-estimators based on transformations. In addition, an iteratively reweighted least squares algorithm is proposed for the computation of the final estimates. The new methods are studied by means of Monte Carlo experiments.
Initial robust estimation in generalized linear models / Agostinelli, C.; Valdora, M.; Yohai, V. J.. - In: COMPUTATIONAL STATISTICS & DATA ANALYSIS. - ISSN 0167-9473. - 134:(2019), pp. 144-156. [10.1016/j.csda.2018.12.010]
Initial robust estimation in generalized linear models
Agostinelli C.;
2019-01-01
Abstract
Generalized Linear Models are routinely used in data analysis. Classical estimators are based on the maximum likelihood principle and it is well known that the presence of outliers can have a large impact on them. Several robust procedures have been presented in the literature, being redescending M-estimators the most widely accepted. Based on non-convex loss functions, these estimators need a robust initial estimate, which is often obtained by subsampling techniques. However, as the number of unknown parameters increases, the number of subsamples needed in order for this method to be robust, soon makes it infeasible. Furthermore the subsampling procedure provides a non deterministic starting point. A new method for computing a robust initial estimator is proposed. This method is deterministic and demands a relatively short computational time, even for large numbers of covariates. The proposed method is applied to M-estimators based on transformations. In addition, an iteratively reweighted least squares algorithm is proposed for the computation of the final estimates. The new methods are studied by means of Monte Carlo experiments.File | Dimensione | Formato | |
---|---|---|---|
csda.pdf
accesso aperto
Tipologia:
Pre-print non referato (Non-refereed preprint)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
474.99 kB
Formato
Adobe PDF
|
474.99 kB | Adobe PDF | Visualizza/Apri |
csda-suppl.pdf
Solo gestori archivio
Tipologia:
Altro materiale allegato (Other attachments)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
53.79 MB
Formato
Adobe PDF
|
53.79 MB | Adobe PDF | Visualizza/Apri |
1-s2.0-S0167947318302895-main.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
576.86 kB
Formato
Adobe PDF
|
576.86 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione