Sparse variational regularization with oversmoothing penalty term in the scale of sequence spaces
Robert Plato, Bernd Hofmann
TL;DR
This work addresses linear ill-posed operator equations $A u=v$ with $A:\ell_r\to V$ that satisfy a conditional stability bound in a weaker sequence space. It analyzes variational regularization using penalties $\mathcal{R}_p(u)=\|u\|_p^p$ and $\mathcal{R}_0(u)=\|u\|_0$, deriving stability and convergence rates even in oversmoothing scenarios where $u^\dagger$ may lie outside the penalty domain. A priori parameter choices yield explicit rates: $\|u_{\alpha_\delta}^\delta-u^\dagger\|_r=\mathcal{O}(\delta^{\gamma_1})$ and $\mathcal{R}_p(u_{\alpha_\delta}^\delta)=\mathcal{O}(\delta^{-\gamma_2})$ with $\gamma_1=(a/r)\,(r-q)/(a-q)$ and $\gamma_2=((q-p)a)/(a-q)$; oversmoothing is handled via hard-thresholding auxiliaries. Post-processing with hard-thresholding can enforce sparsity, yielding $v_{\beta_\delta}^\delta=H_{\beta_\delta}(u_{\alpha_\delta}^\delta)$ that preserves the same convergence rates while ensuring $\mathcal{R}_p(v_{\beta_\delta}^\delta)=\mathcal{O}(\delta^{-\gamma_2})$. Overall, the paper advances sparse regularization in sequence spaces, providing a rigorous framework for oversmoothing penalties and sparsity-promoting post-processing in Banach-space settings.
Abstract
In this work, we consider a class of linear ill-posed problems with operators that map from the sequence space $ \ell_r $ ($r \ge 1$) into a Banach space and in addition satisfy a conditional stability estimate in the scale of sequence spaces $ \ell_q, \, q \ge 0 $. For the regularization of such problems in the presence of deterministic noise, we consider variational regularization with a penalty functional either of the form $ \mathcal{R} =\Vert \cdot \Vert_p^p $ for some $ p > 0 $ or in form of the counting measure $\mathcal{R}_0 = \Vert \cdot \Vert_0 $. The latter case guarantees sparsity of the corresponding regularized solutions. In this framework, we present first stability and then convergence rates for suitable a priori parameter choices. The results cover the oversmoothing situation, where the desired solution does not belong to the domain of definition of the considered penalty functional. The analysis of the oversmoothing case utilizes auxiliary elements that are defined by means of hard thresholding. Such technique can also be used for post processing to guarantee sparsity.
