Search Talks

Communication complexity of functions

We will introduce the area of communication complexity and present some applications of information theory to this area.

Key concepts: Transcript, the communication matrix.

Relative entropy in statistics

We will more carefully examine relative entropy and its properties, and understand its connections to other distance measures between distributions and its role in statistics.

Key concepts: Stein’s lemma, Sanov’s theorem, Pinsker’s inequality, Fidelity.

Entropy and its applications in combinatorics

We will see how standard inequalities about information lead to intuitive proofs of several combinatorial inequalities.

Key concepts: Loomis-Whitney inequality, Bregman’s theorem, Moore bound