BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Strong and epsilon-dependent converses for source or channel codin
 g and for hypothesis testing - Prof. Michele Wigger\, Telecom Paris
DTSTART:20221012T130000Z
DTEND:20221012T140000Z
UID:TALK177911@talks.cam.ac.uk
CONTACT:Prof. Ramji Venkataramanan
DESCRIPTION:Abstract: This talk presents new simple strong converse proofs
  for basic source and channel coding setups as well as for various hypothe
 sis testing setups. For the basic source and channel coding setups\, the p
 roofs only use a change of measure argument on the strongly typical set. T
 his proof method is also extended to a source coding setup under relaxed e
 xpected rate constraints\, in which case the minimum compression rate depe
 nds on the allowed probability of error $\\epsilon$ and an $\\epsilon$-dep
 endent converse is required. In the second part of the talk we present con
 verse proof methods for hypothesis testing setups\, where the change of me
 asure argument is not sufficient\, but has to be completed with proofs of 
 asymptotic Markov Chains. We again also consider expected resource or secr
 ecy constraints and provide probability-of-error-dependent converse proofs
  under these expected constraints. Interestingly\, our strong and probabil
 ity-of-error-dependent converse proofs do not rely on the blowing-up lemma
 \, on hypercontractivity arguments\, or on prooving variational characteri
 sations as in the closely related converse proofs by Tyagi and Watanabe.
LOCATION:MR5\, CMS Pavilion A
END:VEVENT
END:VCALENDAR