Residual variance estimation in machine learning

  • Authors:
  • Elia Liitiäinen;Michel Verleysen;Francesco Corona;Amaury Lendasse

  • Affiliations:
  • Department of Information and Computer Science, Helsinki University of Technology, P.O. Box 5400, Espoo, Finland;Machine Learning Group, Université Catholique de Louvain, 3 Place du Levant, B-1348 Louvain-la-Neuve, Belgium;Department of Information and Computer Science, Helsinki University of Technology, P.O. Box 5400, Espoo, Finland;Department of Information and Computer Science, Helsinki University of Technology, P.O. Box 5400, Espoo, Finland

  • Venue:
  • Neurocomputing
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

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.