Residual variance estimation in machine learning
(2009) Neurocomputing — Vol. 72, n° 16-18, p. 3692-3703 (2009)
Files
pdfdocument.pdf
Restricted Access - Adobe PDF
- 308.18 KB
Details
- Authors
- Abstract
- The problem of residual variance estimation consists of estimating the best possible generalization error obtainable by any model based on a finite sample of data. Even though it is a natural generalization of linear correlation, residual variance estimation in its general form has attracted relatively little attention in machine learning. In this paper, we examine four different residual variance estimators and analyze their properties both theoretically and experimentally to understand better their applicability in machine learning problems. The theoretical treatment differs from previous work by being based on a general formulation of the problem covering also heteroscedastic noise in contrary to previous work, which concentrates on homoscedastic and additive noise. In the second part of the paper, we demonstrate practical applications in input and model structure selection. The experimental results show that using residual variance estimators in these tasks gives good results often with a reduced computational complexity, while the nearest neighbor estimators are simple and easy to implement. (C) 2009 Elsevier B.V. All rights reserved.
- Affiliations
Citations
Liitiainen, E., Verleysen, M., Corona, F., & Lendasse, A. (2009). Residual variance estimation in machine learning. Neurocomputing, 72(16-18), 3692-3703. https://doi.org/10.1016/j.neucom.2009.07.004 (Original work published 2009)