Soft Guessing Under Logarithmic Loss Allowing Errors and Variable-Length Source Coding
Information Theory
2025-10-13 v1 math.IT
Abstract
This paper considers the problem of soft guessing under a logarithmic loss distortion measure while allowing errors. We find an optimal guessing strategy, and derive single-shot upper and lower bounds for the minimal guessing moments as well as an asymptotic expansion for i.i.d. sources. These results are extended to the case where side information is available to the guesser. Furthermore, a connection between soft guessing allowing errors and variable-length lossy source coding under logarithmic loss is demonstrated. The R\'enyi entropy, the smooth R\'enyi entropy, and their conditional versions play an important role.
Cite
@article{arxiv.2510.09015,
title = {Soft Guessing Under Logarithmic Loss Allowing Errors and Variable-Length Source Coding},
author = {Shota Saito and Hamdi Joudeh},
journal= {arXiv preprint arXiv:2510.09015},
year = {2025}
}