Nonparametric time series prediction through adaptive model selection

被引:59
作者
Meir, R [1 ]
机构
[1] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel
[2] Isaac Newton Inst, Cambridge, England
基金
以色列科学基金会;
关键词
time series prediction; adaptive model selection; structural risk minimization; mixing processes;
D O I
10.1023/A:1007602715810
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describing the mixing nature of process. We make use of recent results from the theory of empirical processes, and adapt the uniform convergence framework of Vapnik and Chervonenkis to the problem of time series prediction, obtaining finite sample bounds. Furthermore, by allowing both the model complexity and memory size to be adaptively determined by the data, we derive nonparametric rates of convergence through an extension of the method of structural risk minimization suggested by Vapnik. All our results are derived for general L error measures, and apply to both exponentially and algebraically mixing processes.
引用
收藏
页码:5 / 34
页数:30
相关论文
共 44 条
[1]  
8Doukhan P., 2012, Mixing: Properties and Examples, V85
[2]  
[Anonymous], 1982, ESTIMATION DEPENDENC
[3]  
Arcones M. A., 1994, J. Theor. Probab., V7, P47, DOI [10.1007/BF02213360, DOI 10.1007/BF02213360]
[4]   Risk bounds for model selection via penalization [J].
Barron, A ;
Birgé, L ;
Massart, P .
PROBABILITY THEORY AND RELATED FIELDS, 1999, 113 (03) :301-413
[5]   UNIVERSAL APPROXIMATION BOUNDS FOR SUPERPOSITIONS OF A SIGMOIDAL FUNCTION [J].
BARRON, AR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (03) :930-945
[6]  
BARRON AR, 1994, MACH LEARN, V14, P115, DOI 10.1007/BF00993164
[7]   MINIMUM COMPLEXITY DENSITY-ESTIMATION [J].
BARRON, AR ;
COVER, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (04) :1034-1054
[8]   Fat-shattering and the learnability of real-valued functions [J].
Bartlett, PL ;
Long, PM ;
Williamson, RC .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1996, 52 (03) :434-452
[9]   Almost linear VC-dimension bounds for piecewise polynomial networks [J].
Bartlett, PL ;
Maiorov, V .
NEURAL COMPUTATION, 1998, 10 (08) :2159-2173
[10]  
BLUM A, 1996, ON LINE ALGORITHMS M