An analysis of the indicator saturation estimator as a robust regression estimator
An algorithm suggested by Hendry (1999) for estimation in a regression with more regressors than observations, is analyzed with the purpose of finding an estimator that is robust to outliers and structural breaks.� This estimator is an example of a one-step M-estimator based on Huber's skip function.� The asymptotic theory is derived in the situation where there are no outliers or structural breaks using empirical process techniques.� Stationary processes, trend stationary autoregressions and unit root processes are considered.
|Date of creation:||01 Jan 2008|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.economics.ox.ac.uk/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Nielsen, Bent, 2005.
"Strong Consistency Results For Least Squares Estimators In General Vector Autoregressions With Deterministic Terms,"
Cambridge University Press, vol. 21(03), pages 534-561, June.
- Bent Nielsen, 2003. "Strong consistency results for least squares estimators in general vector autoregressions with deterministic terms," Economics Series Working Papers 2003-W23, University of Oxford, Department of Economics.
- Bent Nielsen, 2003. "Strong consistency results for least squares estimators in general vector autoregressions with deterministic terms," Economics Papers 2003-W23, Economics Group, Nuffield College, University of Oxford.
When requesting a correction, please mention this item's handle: RePEc:oxf:wpaper:2008-wo3. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Caroline Wise)
If references are entirely missing, you can add them using this form.