BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computational Optimisation Group - ECPv4.6.23//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computational Optimisation Group
X-ORIGINAL-URL:https://optimisation.doc.ic.ac.uk
X-WR-CALDESC:Events for Computational Optimisation Group
BEGIN:VEVENT
DTSTART;TZID=UTC+0:20181128T170000
DTEND;TZID=UTC+0:20181128T180000
DTSTAMP:20180925T010317
CREATED:20180907T201315Z
LAST-MODIFIED:20180907T201315Z
UID:1145-1543424400-1543428000@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: Capacity upper bounds for deletion-type channels
DESCRIPTION:Title: Capacity upper bounds for deletion-type channels\nSpeaker: Dr Mahdi Cheraghchi\nAffiliation: Dept of Computing\, Imperial College London\nLocation: 218 Huxley Building\nTime: 17:00 – 18:00 \nAbstract. We develop a systematic approach\, based on convex programming and real analysis\, for obtaining upper bounds on the capacity of the binary deletion channel and\, more generally\, channels with i.i.d. insertions and deletions. Other than the classical deletion channel\, we give a special attention to the Poisson-repeat channel introduced by Mitzenmacher and Drinea (IEEE Transactions on Information Theory\, 2006). Our framework can be applied to obtain capacity upper bounds for any repetition distribution (the deletion and Poisson-repeat channels corresponding to the special cases of Bernoulli and Poisson distributions). Our techniques essentially reduce the task of proving capacity upper bounds to maximizing a univariate\, real-valued\, and often concave function over a bounded interval. We show the following: \n1. The capacity of the binary deletion channel with deletion probability $d$ is at most $(1-d)log(phi)$ for $d > 1/2$\, and\, assuming the capacity function is convex\, is at most $1-d log(4/phi)$ for $d<1/2$\, where $phi=(1+sqrt{5})/2$ is the golden ratio. This is the first nontrivial capacity upper bound for any value of $d$ outside the limiting case $d to 0$ that is fully explicit and proved without computer assistance. \n2. We derive the first set of capacity upper bounds for the Poisson-repeat channel. \n3. We derive several novel upper bounds on the capacity of the deletion channel. All upper bounds are maximums of efficiently computable\, and concave\, univariate real functions over a bounded domain. In turn\, we upper bound these functions in terms of explicit elementary and standard special functions\, whose maximums can be found even more efficiently (and sometimes\, analytically\, for example for $d=1/2$). \nAlong the way\, we develop several new techniques of potentially independent interest in information theory\, probability\, and mathematical analysis. \n[Based on an article published in proceedings of ACM STOC 2018] \nBiography. Dr Mahdi Cheraghchi is a Lecturer in the Department of Computing at Imperial College London. Previously\, he has been a Qualcomm Research Fellow at the Simons Institute for the Theory of Computing of U.C. Berkeley and have held post-doctoral researcher positions at the MIT Computer Science and Artificial Intelligence Lab\, Computer Science Department of the Carnegie Mellon University and the University of Texas at Austin. He received his PhD in Computer Science from EPFL\, Switzerland\, where he worked as a research assistant in the Laboratory of Algorithms (ALGO) under the supervision of Amin Shokrollahi. Dr Cheraghchi main research interest is in the field of Theoretical Computer Science. \n
URL:https://optimisation.doc.ic.ac.uk/event/seminar-capacity-upper-bounds-for-deletion-type-channels/
END:VEVENT
END:VCALENDAR