On-line predictive linear regression
Abstract
We consider the on-line predictive version of the standard problem of linear regression; the goal is to predict each consecutive response given the corresponding explanatory variables and all the previous observations. We are mainly interested in prediction intervals rather than point predictions. The standard treatment of prediction intervals in linear regression analysis has two drawbacks: (1) the classical prediction intervals guarantee that the probability of error is equal to the nominal significance level epsilon, but this property per se does not imply that the long-run frequency of error is close to epsilon; (2) it is not suitable for prediction of complex systems as it assumes that the number of observations exceeds the number of parameters. We state a general result showing that in the on-line protocol the frequency of error for the classical prediction intervals does equal the nominal significance level, up to statistical fluctuations. We also describe alternative regression models in which informative prediction intervals can be found before the number of observations exceeds the number of parameters. One of these models, which only assumes that the observations are independent and identically distributed, is popular in machine learning but greatly underused in the statistical theory of regression.
Cite
@article{arxiv.math/0511522,
title = {On-line predictive linear regression},
author = {Vladimir Vovk and Ilia Nouretdinov and Alex Gammerman},
journal= {arXiv preprint arXiv:math/0511522},
year = {2011}
}
Comments
34 pages; 6 figures; 1 table. arXiv admin note: substantial text overlap with arXiv:0906.3123