BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Cheuk Ting LI (Chinese University of Hong Kong)
DTSTART:20230118T160000Z
DTEND:20230118T171500Z
DTSTAMP:20260423T035818Z
UID:AAIT/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/AAIT/3/">Exi
 stential information inequalities\, non-Shannon inequalities\, and automat
 ed theorem proving.</a>\nby Cheuk Ting LI (Chinese University of Hong Kong
 ) as part of Seminar on Algorithmic Aspects of Information Theory\n\n\nAbs
 tract\nExistential information inequality is a generalization of linear in
 formation inequalities\, where random variables can not only be universall
 y quantified\, but also existentially quantified. We study the structure o
 f existential information inequalities\, and describe algorithms for autom
 ated verification of existential information inequalities\, which are also
  useful for proving (non-existential) non-Shannon inequalities. We also de
 scribe how a wide range of results in network information theory (e.g. 32 
 out of 56 theorems in Chapters 1-14 of Network Information Theory by El Ga
 mal and Kim) can be proved automatically using the proposed algorithms. Th
 e algorithms are implemented in the PSITIP framework ( github.com/cheuktin
 gli/psitip ).\n
LOCATION:https://researchseminars.org/talk/AAIT/3/
END:VEVENT
END:VCALENDAR