Some Connections Between the Theory of Sufficient Statistics and the Identifiability Problem

In this paper the identifiability problem is formulated as a dual of the data reduction problem in statistical inference. Some classical results in the theory of sufficient statistics are dualized in order to obtain criteria for finding “maximal identifiable statistics” in parametric models. Applications to identifiability of linear dynamical systems are discussed.