Information bounds for inference in stochastic evolution equations observed under noise
Gregor Pasemann, Markus Reiß
TL;DR
The paper develops a comprehensive information-theoretic framework for estimation in stochastic evolution equations observed with noise, deriving tight minimax lower bounds via Hellinger distances between cylindrical Gaussian observation laws. It shows how the information content depends on the noise level, observation time, spatial dimension, and the way a coefficient enters the generator, and it provides parametric estimators that achieve these bounds in many commuting scenarios. The results cover key SPDEs, including Ornstein–Uhlenbeck, fractional Laplacians, transport, and source terms, and reveal an ellbow phenomenon in nonparametric settings where rates interpolate between parametric-like and nonparametric regimes depending on T and ε. The findings illuminate the intrinsic difficulty of inference in SPDEs and establish precise rate-optimal strategies and limitations for both parametric and nonparametric coefficients, with implications for spatially inhomogeneous models and high-dimensional settings.
Abstract
We consider statistics for stochastic evolution equations in Hilbert space with emphasis on stochastic partial differential equations (SPDEs). We observe a solution process under additional measurement errors and want to estimate a real or functional parameter in the drift. Main targets of estimation are the diffusivity, transport or source coefficient in a parabolic SPDE. By bounding the Hellinger distance between observation laws under different parameters we derive lower bounds on the estimation error, which reveal the underlying information structure. The estimation rates depend on the measurement noise level, the observation time, the covariance of the dynamic noise, the dimension and the order, at which the parametrised coefficient appears in the differential operator. A general estimation procedure attains these rates in many parametric cases and proves their minimax optimality. For nonparametric estimation problems, where the parameter is an unknown function, the lower bounds exhibit an even more complex information structure. The proofs are to a large extent based on functional calculus, perturbation theory and monotonicity of the semigroup generators.
