Concentration of Maxima and Fundamental Limits in High-Dimensional Testing and Inference
Concentration of Maxima and Fundamental Limits in High-Dimensional Testing and Inference
复制标题
高维测试和推理中最大值和基本极限的集中
DOI:
10.1007/978-3-030-80964-5
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Stoev, Stilian
中科院分区:
文献类型:
--
作者:
Gao, Zheng;Stoev, Stilian
This text presents a collection of new results and recent developments on the phasetransition phenomena in sparse signal problems. The main theme is the study of the fundamental limits in high-dimensional testing and inference. Since the seminal works of Ingster (1998) and Donoho and Jin (2004), the subject has received a lot of attention in the literature with important contributions from Ji and Jin (2012); Genovese et al.(2012); Jin et al.(2014); Arias-Castro and Chen (2017); Butucea et al.(2018). These works, among many others, have discovered some fundamental limits in the so-called needle in haystack problems, where a sparse signal is observed with high-dimensional additive noise. In this setting, two archetypal problems arise—the signal detection and signal support recovery. The signal detection refers to a global hypothesis testing problem that amounts to determining the presence of non-zero signal in any of its dimensions. The support recovery, on the other hand, can be seen either as a multiple testing problem where the presence of non-zero signal is tested for each signal location of interest, or alternatively, as an inference problem that aims to estimate the signal support, ie, the locations of the non-zero signal components. The fundamental limits of these problems are studied in the so-called high-dimensional asymptotic regime where the dimension p of the underlying signal grows to infinity, and the sample size n is either bounded or grows slowly relative to p. From a probabilistic perspective, these aforementioned fundamental limits are stated as asymptotic zero-one type laws, as dimensionality diverges. Namely, consider a sparse signal with support size on the order of p1− β for some parameter β∈(0, 1). Parameterize the non-zero signal amplitude by (pr), for some r> 0 and a suitable monotone non-decreasing function (·). Then, for a broad range of error distributions and statistical problems, one encounters a sharp transition between the regimes where the problem is solvable and unsolvable depending on the signal magnitude r and signal sparsity β. More precisely, there exists a boundary function f (β) such that if the signal magnitudes are above the boundary, r> f (β), then the problem can be solved with vanishing loss as p→∞, with a suitable statistical procedure. On the other hand, if the signal is below that same boundary, ie, r< f (β), all statistical procedures fail to provide a solution with a vanishing loss, as p→∞. Of course, depending on whether one considers the detection (testing) or support recovery (inference) problems, different loss functions vii