pith. sign in

arxiv: 1611.06173 · v2 · pith:5DDK4APPnew · submitted 2016-11-18 · 🧮 math.ST · math.DS· stat.TH

Empirical risk minimization and complexity of dynamical models

classification 🧮 math.ST math.DSstat.TH
keywords riskdynamicalmathcalempiricalminimizationmodelscomplexitycontinuous
0
0 comments X
read the original abstract

A dynamical model consists of a continuous self-map $T: \mathcal{X} \to \mathcal{X}$ of a compact state space $\mathcal{X}$ and a continuous observation function $f: \mathcal{X} \to \mathbb{R}$. This paper considers the fitting of a parametrized family of dynamical models to an observed real-valued stochastic process using empirical risk minimization. The limiting behavior of the minimum risk parameters is studied in a general setting. We establish a general convergence theorem for minimum risk estimators and ergodic observations. We then study conditions under which empirical risk minimization can effectively separate the signal from the noise in an additive observational noise model. The key, necessary condition in the latter results is that the family of dynamical models has limited complexity, which is quantified through a notion of entropy for families of infinite sequences. Close connections between entropy and limiting average mean widths for stationary processes are established.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.