University of Cambridge > Talks.cam > Information Theory Seminar > Error exponents for source coding under logarithmic loss

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Error exponents for source coding under logarithmic loss

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 lists

The Wellcome Trust Sanger Ins MR2 (note venue and time change!) Average on weekdays: 9027.78571429 kWh

Other talks

Title to be confirmed The role of radiation in cancer care: a spotlight on cancers of the oesophagus, head and neck Machine Learning for Spectral Geometry and Vice Versa  Life, death, and the discovery of PDAR: the Pol II Degradation-dependent Apoptotic Response  Afternoon Break Online Causal Inference Semina
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity