论文标题
异步猜测会受到失真的影响
Asynchronous Guessing Subject to Distortion
论文作者
论文摘要
考虑了猜测造成失真的问题，并研究了随机猜测策略的性能。给出了猜测时刻（即所需查询数量的力矩）的一声可实现性。将此结果应用于I.I.D.〜来源，这表明随机策略可以渐近地实现最佳的猜测力矩。此外，即使提出了块大小非常大，并且可以获得通过提出的方案实现的猜测力矩的单字表征，该方案即使是块大小非常大，也是可行的。
The problem of guessing subject to distortion is considered, and the performance of randomized guessing strategies is investigated. A one-shot achievability bound on the guessing moment (i.e., moment of the number of required queries) is given. Applying this result to i.i.d.~sources, it is shown that randomized strategies can asymptotically attain the optimal guessing moment. Further, a randomized guessing scheme which is feasible even when the block size is extremely large is proposed, and a single-letter characterization of the guessing moment achievable by the proposed scheme is obtained.
