pith. sign in

arxiv: 1701.07805 · v3 · pith:IAJ6KYLLnew · submitted 2017-01-26 · 💻 cs.IT · math.IT

On extractable shared information

classification 💻 cs.IT math.IT
keywords informationshareddecompositionleftmonotonicuniqueextractablemeasure
0
0 comments X
read the original abstract

We consider the problem of quantifying the information shared by a pair of random variables $X_{1},X_{2}$ about another variable $S$. We propose a new measure of shared information, called extractable shared information, that is left monotonic; that is, the information shared about $S$ is bounded from below by the information shared about $f(S)$ for any function $f$. We show that our measure leads to a new nonnegative decomposition of the mutual information $I(S;X_1X_2)$ into shared, complementary and unique components. We study properties of this decomposition and show that a left monotonic shared information is not compatible with a Blackwell interpretation of unique information. We also discuss whether it is possible to have a decomposition in which both shared and unique information are left monotonic.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.