Characterization of the Complexity of Computing the Minimum Mean Square Error of Causal Prediction

Abstract

This paper investigates the complexity of computing the minimum mean square prediction error for wide-sense stationary stochastic processes. It is shown that if the spectral density of the stationary process is a strictly positive, computable continuous function then the minimum mean square error (MMSE) is always a computable number. Nevertheless, we also show that the computation of the MMSE is a $\# P_{1}$ complete problem on the set of strictly positive, polynomial-time computable, continuous spectral densities. This means that if, as widely assumed, $FP_{1} \neq \# P_{1}$ , then there exist strictly positive, polynomial-time computable continuous spectral densities for which the computation of the MMSE is not polynomial-time computable. These results show in particular that under the widely accepted assumptions of complexity theory, the computation of the MMSE is generally much harder than an $NP_{1}$ complete problem.