论文标题
翻译功能线性组合的网格预测和测试
Off-the-grid prediction and testing for linear combination of translated features
论文作者
论文摘要
我们考虑一个模型,其中通过加性高斯噪声过程观察了信号(离散或连续)。信号是根据有限但越来越多的翻译功能的线性组合发出的。这些功能通过其位置连续参数化,并取决于某些比例参数。首先,我们通过考虑到比例参数可能会有所不同,扩展了离网估计器的先前预测结果。预测边界是类似的,但是我们改善了两个连续特征位置之间的最小距离,以实现这些界限。接下来,我们提出了该模型的合适性测试,并给出了测试风险和最小值分离速率的非反应性上限。特别是,我们的测试包括信号检测框架。我们推断出最小能量上的上限,称为线性系数的$ \ ell_2 $ norm,以在存在噪声的情况下成功检测信号。本文考虑的一般模型是经典高维回归模型的非线性扩展。事实证明,在这个框架中,我们对最小值分离速率的上限匹配(最高到对数因子),在与特征固定字典相关的高维线性模型中,信号检测的最小值分离速率上的下限。我们还提出了一项程序,以测试观察到的信号的特征是否属于给定有限收集,假设线性系数可能会有所不同,但已规定了零假设下的符号。给出了测试风险上的非反应性上限。我们在真实线上具有高斯特征的尖峰反卷积模型和Dirichlet内核,并在压缩传感文献中使用Dirichlet内核进行了说明。
We consider a model where a signal (discrete or continuous) is observed with an additive Gaussian noise process. The signal is issued from a linear combination of a finite but increasing number of translated features. The features are continuously parameterized by their location and depend on some scale parameter. First, we extend previous prediction results for off-the-grid estimators by taking into account here that the scale parameter may vary. The prediction bounds are analogous, but we improve the minimal distance between two consecutive features locations in order to achieve these bounds. Next, we propose a goodness-of-fit test for the model and give non-asymptotic upper bounds of the testing risk and of the minimax separation rate between two distinguishable signals. In particular, our test encompasses the signal detection framework. We deduce upper bounds on the minimal energy,expressed as the $\ell_2$-norm of the linear coefficients, to successfully detect a signal in presence of noise. The general model considered in this paper is a non-linear extension of the classical high-dimensional regression model. It turns out that,in this framework, our upper bound on the minimax separation rate matches (up to a logarithmic factor) the lower bound on the minimax separation rate for signal detection in the high-dimensional linear model associated to a fixed dictionary of features. We also propose a procedure to test whether the features of the observed signal belong to a given finite collection under the assumption that the linear coefficients may vary, but have prescribed signs under the null hypothesis. A non-asymptotic upper bound on the testing risk is given.We illustrate our results on the spikes deconvolution model with Gaussian features on the real line and with the Dirichlet kernel, frequently used in the compressed sensing literature, on the torus.