COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Information Theory Seminar > Error exponents for source coding under logarithmic loss
Error exponents for source coding under logarithmic lossAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Dr Varun Jog. In this talk, I will discuss the problem of lossy source coding under the logarithmic loss distortion measure. This distortion measure is a natural choice in settings where the decoder (or decompressor) produces a soft reconstruction of the source, i.e., a probability distribution, instead of a point estimate. I will focus on block-coding in discrete memoryless settings, and present new results on the error exponent under an excess distortion constraint. I will then extend the results to settings with side information. The proofs are based on the method of types; and make use of the close relationship between lossy source coding under logarithmic loss, and almost lossless source coding with list decoding. This talk is part of the Information Theory Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsDAMTP BioLunch Statistics Meets Public Health Computer Laboratory Research Students' Lectures 2014Other talksStatistics Clinic Easter 2023 III Shedding light on tumour physiology The leanest automata Posters PCE - Adaptation Statistical Scalability for Data Streams: Recent Advances, Applications and Impact |