Soft Guessing Under Logarithmic Loss Allowing Errors and Variable-Length Source Coding
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911201808613376 |
|---|---|
| author | Saito, Shota Joudeh, Hamdi |
| author_facet | Saito, Shota Joudeh, Hamdi |
| contents | 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ényi entropy, the smooth Rényi entropy, and their conditional versions play an important role. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_09015 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Soft Guessing Under Logarithmic Loss Allowing Errors and Variable-Length Source Coding Saito, Shota Joudeh, Hamdi Information Theory 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ényi entropy, the smooth Rényi entropy, and their conditional versions play an important role. |
| title | Soft Guessing Under Logarithmic Loss Allowing Errors and Variable-Length Source Coding |
| topic | Information Theory |
| url | https://arxiv.org/abs/2510.09015 |