Recovering Structure of Noisy Data through Hypothesis Testing
Recovering Structure of Noisy Data through Hypothesis Testing
复制标题
DOI:
10.1109/isit44484.2020.9174229
复制
发表时间:
2020-06
期刊:
影响因子:
--
通讯作者:
Minoh Jeong;Alex Dytso;Martina Cardone;H. V. Poor
中科院分区:
文献类型:
--
作者:
Minoh Jeong;Alex Dytso;Martina Cardone;H. V. Poor
This paper considers a noisy data structure recovery problem. Specifically, the goal is to investigate the following question: Given a noisy observation of the data, according to which permutation was the original data sorted? The main focus is on scenarios where data is generated according to an isotropic Gaussian distribution, and the perturbation consists of adding Gaussian noise with diagonal scalar covariance matrix. This problem is posed within a hypothesis testing framework. First, the optimal decision criterion is characterized and shown to be identical to the hypothesis of the observation. Then, by leveraging the structure of the optimal decision criterion, the probability of error is characterized. Finally, the logarithmic behavior (i.e., the exponent) of the probability of error is derived in the regime where the dimension of the data goes to infinity.