Convergence rates for Penalised Least Squares Estimators in PDE-constrained regression problems
Abstract
We consider PDE constrained nonparametric regression problems in which the parameter f is the unknown coefficient function of a second order elliptic partial differential operator Lf, and the unique solution uf of the boundary value problem \[Lfu=g1 on O, u=g2 on ∂ O,\] is observed corrupted by additive Gaussian white noise. Here O is a bounded domain in Rd with smooth boundary ∂ O, and g1, g2 are given functions defined on O, ∂ O, respectively. Concrete examples include Lfu= u-2fu (Schr\"odinger equation with attenuation potential f) and Lfu=div (f∇ u) (divergence form equation with conductivity f). In both cases, the parameter space \[ F=\f∈ Hα( O)| f > 0\, ~α>0, \] where Hα( O) is the usual order α Sobolev space, induces a set of non-linearly constrained regression functions \uf: f ∈ F\. We study Tikhonov-type penalised least squares estimators f for f. The penalty functionals are of squared Sobolev-norm type and thus f can also be interpreted as a Bayesian `MAP'-estimator corresponding to some Gaussian process prior. We derive rates of convergence of f and of u f, to f, uf, respectively. We prove that the rates obtained are minimax-optimal in prediction loss. Our bounds are derived from a general convergence rate result for non-linear inverse problems whose forward map satisfies a modulus of continuity condition, a result of independent interest that is applicable also to linear inverse problems, illustrated in an example with the Radon transform.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.