By Topic

AR(∞) estimation and nonparametric stochastic complexity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Gerencser, L. ; Comput. & Autom. Inst., Hungarian Acad. of Sci., Budapest, Hungary

Let H* be the transfer function of a linear stochastic system such that H* and its inverse are in H(D). Writing the system as an AR(∞) system, the best AR (k) approximation of the system is estimated using the method of least squares. A useful representation theorem for the parameter estimation error is presented. The effect of undermodeling and parameter uncertainty (due to estimation) on honest prediction, and the optimal choice of k, are questioned. This question is answered and the result is applied to the AR approximation of ARMA systems. The excess of the mean of the nonparametric stochastic complexity with respect to the AR class of an ARMA system with zeros less than 1/β in moduli is found asymptotically to be less than σ2log2N/logβ after N samples

Published in:

Information Theory, IEEE Transactions on  (Volume:38 ,  Issue: 6 )