Information Bottleneck on General Alphabets

01/03/2018 ∙ by Georg Pichler, et al. ∙ 0

We prove a source coding theorem that can probably be considered folklore, a generalization to arbitrary alphabets of a problem motivated by the Information Bottleneck method. For general random variables (Y, X), we show essentially that for some n ∈N, a function f with rate limit |f| < nR and I(Y^n; f(X^n)) > nS exists if and only if there is a discrete random variable U such that the Markov chain Y - X - U holds, I(U; X) < R and I(U; Y) < S.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.