Properties of unique information
From MaRDI portal
Abstract: We study the measure of unique information defined by Bertschinger et al. (2014) within the framework of information decompositions. We study uniqueness and support of the solutions to the optimization problem underlying the definition of . We identify sufficient conditions for non-uniqueness of solutions with full support in terms of conditional independence constraints and in terms of the cardinalities of , and . Our results are based on a reformulation of the first order conditions on the objective function as rank constraints on a matrix of conditional probabilities. These results help to speed up the computation of , most notably when is binary. In the case that all variables are binary, we obtain a complete picture of where the optimizing probability distributions lie.
Recommendations
- scientific article; zbMATH DE number 4190327
- A UNIQUENESS PROPERTY
- Uniqueness of information measure in the theory of evidence
- Unique information via dependency constraints
- Common information and unique disjointness
- On Unique Decodability
- scientific article; zbMATH DE number 1110192
- scientific article; zbMATH DE number 13841
Cited in
(6)- scientific article; zbMATH DE number 566022 (Why is no real title available?)
- scientific article; zbMATH DE number 2118238 (Why is no real title available?)
- Unique information via dependency constraints
- Information decomposition based on cooperative game theory
- An operational information decomposition via synergistic disclosure
- Continuity and additivity properties of information decompositions
This page was built for publication: Properties of unique information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5016114)