Asymptotics of predictive stochastic complexity

László Gerencsér · 2002

This paper presents the basic ideas of the theory of stochastic complexity with rigorous asymptotic results in the field of time-series analysis and system identification, which demonstrate the applicability of stochastic complexity to these difficult statistical problems.>

Read the paper · More papers on PaperTik