• Media type: E-Book; Thesis
  • Title: On minimax detection of localized signals from indirect or correlated data
  • Contributor: Pohlmann, Markus [VerfasserIn]; Munk, Axel [AkademischeR BetreuerIn]; Werner, Frank [AkademischeR BetreuerIn]; Rudolph, Daniel [AkademischeR BetreuerIn]
  • imprint: Göttingen, 2022
  • Extent: 1 Online-Ressource; Illustrationen, Diagramme
  • Language: English
  • Identifier:
  • Keywords: Statistics ; Minimax testing ; Signal detection ; Gaussian processes ; ARMA processes ; Inverse problems ; Frame decompositions ; Wavelets ; Hochschulschrift
  • Origination:
  • University thesis: Dissertation, Georg-August-Universität Göttingen, 2022
  • Footnote:
  • Description: This is a cumulative thesis consisting of two papers, in which we treat two problems related to the detectability of local anomalies within certain types of data. In the first paper, we suppose that a segment of a Gaussian process is observed, i.e. a random vector consisting of $n$ consecutive samples of said process. We assume that the process is stationary, except that its mean may be increased or decreased for a short period of time. We call such a short-term change in its mean a bump. Whether or not a bump in the observed segment can be detected, i.e. whether its existence can be reliab...

    This is a cumulative thesis consisting of two papers, in which we treat two problems related to the detectability of local anomalies within certain types of data.In the first paper, we suppose that a segment of a Gaussian process is observed, i.e. a random vector consisting of $n$ consecutive samples of said process. We assume that the process is stationary, except that its mean may be increased or decreased for a short period of time. We call such a short-term change in its mean a bump. Whether or not a bump in the observed segment can be detected, i.e. whether its existence can be reliably inferred with high significance by a statistical test, depends on its height and its length. We suppose that the length of the bump is known, and aim to find the minimal height, that is required for detection, in an asymptotic setting, i.e. when $n\to\infty$. This problem is equivalent to the problem of detecting a rectangular signal of known length from noisy samples. However, in our setting, the noise is not independent. We provide the corresponding asymptotic detection boundary, i.e. we present sharp asymptotic upper and lower bounds for the minimal height that is required for reliable detection.In the second paper, we discuss whether or not a signal can be detected, when it is known to be an element of some (known) collection of functions (for example multiples of wavelets), or a linear combinations of those functions, and when only indirect and noisy observations are available, i.e. we suppose that only the image of the signal under some linear transformation (a forward operator $A$), that is additionally corrupted by Gaussian white noise, can be observed. We discuss, under which conditions there exist tests that can reliably detect any such signal with high significance. Previously, only the detection of signals which are assumed to be composed of functions which constitute the singular value decomposition (SVD) of the operator $A$, has been analyzed. We provide asymptotic (which, in this setting, means that the variance of the added noise becomes small) as well as non-asymptotic results, and show that, under appropriate conditions, our results are asymptotically sharp.$v2022-06-27$v2022-06-27$xN$4LF
  • Access State: Open Access