Minimax-robust prediction of discrete time series

From MaRDI portal
Publication:3322936





We discuss a robust approach for predicting a weakly stationary discrete time series whose spectral density f is not exactly known. We assume that we know that \(f\in {\mathcal D}\), where \({\mathcal D}\) is a convex set of spectral densities fulfilling some not too stringent conditions. We prove the existence of a most indeterministic density \(f^ 0\) in \({\mathcal D}\), and we show that the classical optimal linear predictor for a time series with spectral density \(f^ 0\) is minimax-robust in the sense that it minimizes the maximal possible prediction error. We investigate some special models \({\mathcal D}\), and, in doing so, we illustrate a generally applicable method for determining the robust predictor. In particular, we discuss model sets \({\mathcal D}\) which are defined by conditions on a finite part of the autocovariance sequence of the corresponding time series. These examples are of particular interest as the most indeterministic density is an autoregressive one, i.e. the robust predictor is finite. We discuss connections between this type of model set \({\mathcal D}\) and maximum entropy and generalized maximum entropy spectral estimates.




Cited in
(27)








This page was built for publication: Minimax-robust prediction of discrete time series

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3322936)