Table of Contents
Fetching ...

Optimal regularized hypothesis testing in statistical inverse problems

Remo Kretschmann, Daniel Wachsmuth, Frank Werner

TL;DR

This work develops a regularized hypothesis-testing framework for statistical inverse problems, where the quantity of interest is accessible only through an ill-posed forward operator. By allowing bias through regularized probe functions $\Phi$, the authors construct level-$α$ tests via $\Psi_{\Phi,c}$ with a data-driven critical value $c^*$, and show any probe yields valid testing, addressing issues of bias and detector power. They derive an optimal probe $\Phi^\dagger$ that minimizes a convex objective $J_{T u^\dagger}^{\mathcal{Y}}$, attaining maximal finite-sample power, and prove this regularized test dominates unregularized approaches. To handle unknown $u^\dagger$, an adaptive method based on convex optimization and a two-sample procedure yields a level-$α$ test with power tending to 1 as noise vanishes. Numerical experiments in deconvolution demonstrate substantial power gains for the optimal and adaptive tests over the unregularized test, especially in highly ill-posed or incompatible settings, highlighting the practical impact of regularized testing in inverse problems.

Abstract

Testing of hypotheses is a well studied topic in mathematical statistics. Recently, this issue has also been addressed in the context of Inverse Problems, where the quantity of interest is not directly accessible but only after the inversion of a (potentially) ill-posed operator. In this study, we propose a regularized approach to hypothesis testing in Inverse Problems in the sense that the underlying estimators (or test statistics) are allowed to be biased. Under mild source-condition type assumptions we derive a family of tests with prescribed level $α$ and subsequently analyze how to choose the test with maximal power out of this family. As one major result we prove that regularized testing is always at least as good as (classical) unregularized testing. Furthermore, using tools from convex optimization, we provide an adaptive test by maximizing the power functional, which then outperforms previous unregularized tests in numerical simulations by several orders of magnitude.

Optimal regularized hypothesis testing in statistical inverse problems

TL;DR

This work develops a regularized hypothesis-testing framework for statistical inverse problems, where the quantity of interest is accessible only through an ill-posed forward operator. By allowing bias through regularized probe functions , the authors construct level- tests via with a data-driven critical value , and show any probe yields valid testing, addressing issues of bias and detector power. They derive an optimal probe that minimizes a convex objective , attaining maximal finite-sample power, and prove this regularized test dominates unregularized approaches. To handle unknown , an adaptive method based on convex optimization and a two-sample procedure yields a level- test with power tending to 1 as noise vanishes. Numerical experiments in deconvolution demonstrate substantial power gains for the optimal and adaptive tests over the unregularized test, especially in highly ill-posed or incompatible settings, highlighting the practical impact of regularized testing in inverse problems.

Abstract

Testing of hypotheses is a well studied topic in mathematical statistics. Recently, this issue has also been addressed in the context of Inverse Problems, where the quantity of interest is not directly accessible but only after the inversion of a (potentially) ill-posed operator. In this study, we propose a regularized approach to hypothesis testing in Inverse Problems in the sense that the underlying estimators (or test statistics) are allowed to be biased. Under mild source-condition type assumptions we derive a family of tests with prescribed level and subsequently analyze how to choose the test with maximal power out of this family. As one major result we prove that regularized testing is always at least as good as (classical) unregularized testing. Furthermore, using tools from convex optimization, we provide an adaptive test by maximizing the power functional, which then outperforms previous unregularized tests in numerical simulations by several orders of magnitude.
Paper Structure (18 sections, 24 theorems, 161 equations, 5 figures)

This paper contains 18 sections, 24 theorems, 161 equations, 5 figures.

Key Result

Theorem 2.3

Let Assumption ass:smooth hold true, $\alpha \in\left(0,1\right)$, $\Phi \in \mathcal{Y}$, and choose Then the test $\Psi_{\Phi, c^*}$ as in eq:test has level at most $\alpha$ for the testing problem eq:hypothesis_test.

Figures (5)

  • Figure 1: The convolution kernel $h$ for $a = 2$ (\ref{['plot:kernel_a2']}) and $a = 4$ (\ref{['plot:kernel_a4']}).
  • Figure 2: The function $\varphi_{l,\beta}$ (\ref{['plot:phi']}) and the truth $u_{l,\lambda,\gamma}^\dagger$ for $\lambda = 1$ (\ref{['plot:u1dag']}), $\lambda = \frac{2}{3}$ (\ref{['plot:u2dag']}), and $\lambda = \frac{1}{3}$ (\ref{['plot:u3dag']}) in case of $a = 2$ and $l = \frac{5}{128}$.
  • Figure 3: Exact powers of the unregularized test (\ref{['plot:unreg']}), the oracle test (\ref{['plot:oracle']}), and empirical power of the adaptive test for $\mathcal{Z} = H^{0.51}$ (\ref{['plot:adaptive_Ht']}) from $100$ samples against the noise level $\sigma$ in the compatible smooth scenario (S1) for $a \in \{2,4\}$, $l \in \{\frac{5}{128},\frac{5}{256}\}$, and $\lambda \in \left\{\frac{1}{3},\frac{2}{3},1\right\}$. The top row shows the results for $a = 2$ and $l = \frac{5}{128}$, the middle row the results for $a = 2$ and $l = \frac{5}{256}$, and the bottom row the results for $a = 2$ and $l = \frac{5}{128}$.
  • Figure 4: Exact powers of the unregularized test (\ref{['plot:unreg']}), the oracle test (\ref{['plot:oracle']}), and empirical power of the adaptive test for $\mathcal{Z} = H^{0.51}$ (\ref{['plot:adaptive_Ht']}) from $100$ samples against the noise level $\sigma$ in the compatible nonsmooth scenario (S2) for $a \in \{2,4\}$, $l \in \{\frac{5}{128},\frac{5}{256}\}$, and $\lambda \in \left\{\frac{1}{3},\frac{2}{3},1\right\}$. The top row shows the results for $a = 2$ and $l = \frac{5}{128}$, the middle row the results for $a = 2$ and $l = \frac{5}{256}$, and the bottom row the results for $a = 2$ and $l = \frac{5}{128}$.
  • Figure 5: Exact powers of the unregularized test (\ref{['plot:unreg']}), the oracle test (\ref{['plot:oracle']}), and empirical power of the adaptive test for $\mathcal{Z} = L^2$ (\ref{['plot:adaptive_L2']}), $\mathcal{Z} = H^{0.51}$ (\ref{['plot:adaptive_Ht']}), and $\mathcal{Z} = H^1$ (\ref{['plot:adaptive_H1']}) from $100$ samples against the noise level $\sigma$ in the incompatible smooth scenario (S3) for $a \in \{2,4\}$, $l = 5/128$, and $\lambda \in \left\{\frac{1}{3},\frac{2}{3},1\right\}$.

Theorems & Definitions (56)

  • Example 2.1
  • Remark 2.2
  • Theorem 2.3
  • proof
  • Remark 2.4
  • Remark 3.1
  • Theorem 3.2
  • proof
  • Remark 3.3
  • Theorem 3.4
  • ...and 46 more