论文标题
denoising以及任何两个Denoisers中最好的
Denoising as well as the best of any two denoisers
论文作者
论文摘要
给定两个任意序列的Deoisers序列，用于趋于无穷大的块长度，我们询问是否可以构建第三个序列的DeNoiser序列，其渐近消失（块长度）过量的预期损失相对于所有干净通道输入序列的两个给定DeNoiser的最佳预期损失。就像在给定DeNOISERS滑动块Dinoiser时解决此问题的Dude [1]的设置一样，允许构造依靠两个给定的DeNoiser和通道过渡概率。我们表明，在对两个给定的Denoiser的某些限制下，可以通过直接应用已知的损失估计范式来解决问题。然后，我们通过反示例表明，损失估计方法在一般情况下失败。最后，我们表明，对于二进制对称通道，将损耗估计与随机步骤相结合，导致解决指定问题的解决方案，在没有对给定代诺伊的人的限制下。
Given two arbitrary sequences of denoisers for block lengths tending to infinity we ask if it is possible to construct a third sequence of denoisers with an asymptotically vanishing (in block length) excess expected loss relative to the best expected loss of the two given denoisers for all clean channel input sequences. As in the setting of DUDE [1], which solves this problem when the given denoisers are sliding block denoisers, the construction is allowed to depend on the two given denoisers and the channel transition probabilities. We show that under certain restrictions on the two given denoisers the problem can be solved using a straightforward application of a known loss estimation paradigm. We then show by way of a counter-example that the loss estimation approach fails in the general case. Finally, we show that for the binary symmetric channel, combining the loss estimation with a randomization step leads to a solution to the stated problem under no restrictions on the given denoisers.
