Variance estimation for high-dimensional regression models
Journal of Multivariate Analysis
Methodology for long-term prediction of time series
Neurocomputing
On Nonparametric Residual Variance Estimation
Neural Processing Letters
Non-parametric residual variance estimation in supervised learning
IWANN'07 Proceedings of the 9th international work conference on Artificial neural networks
Input selection for radial basis function networks by constrained optimization
ICANN'07 Proceedings of the 17th international conference on Artificial neural networks
LS-SVM hyperparameter selection with a nonparametric noise estimator
ICANN'05 Proceedings of the 15th international conference on Artificial neural networks: formal models and their applications - Volume Part II
Rates of convergence of nearest neighbor estimation under arbitrary sampling
IEEE Transactions on Information Theory
Review: Data-derived soft-sensors for biological wastewater treatment plants: An overview
Environmental Modelling & Software
Hi-index | 0.01 |
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.