Properties of Unique Information

12/28/2019
by   Johannes Rauh, et al.
0

We study the measure of unique information UI(T:X∖ Y) 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 UI. We give necessary conditions for non-uniqueness of solutions with full support in terms of the cardinalities of T, X and Y and in terms of conditional independence constraints. Our results help to speed up the computation of UI(T:X∖ Y), most notably in the case where T is binary. In the case that all variables are binary, we obtain a complete picture where the optimizing probability distributions lie.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/22/2021

Uniqueness and stability for the solution of a nonlinear least squares problem

In this paper, we focus on the nonlinear least squares: _𝐱∈ℍ^d |A𝐱|-𝐛 wh...
research
12/13/2022

On uniqueness and ill-posedness for the deautoconvolution problem in the multi-dimensional case

This paper analyzes the inverse problem of deautoconvolution in the mult...
research
05/17/2021

What makes you unique?

This paper proposes a uniqueness Shapley measure to compare the extent t...
research
02/04/2021

Restoring Uniqueness in MicroVM Snapshots

Code initialization – the step of loading code, executing static code, f...
research
08/29/2023

On factorization of rank-one auto-correlation matrix polynomials

This article characterizes the rank-one factorization of auto-correlatio...
research
10/21/2020

Optimal dual quantizers of 1D log-concave distributions: uniqueness and Lloyd like algorithm

We establish for dual quantization the counterpart of Kieffer's uniquene...
research
02/23/2023

Capturing and Interpreting Unique Information

Partial information decompositions (PIDs), which quantify information in...

Please sign up or login with your details

Forgot password? Click here to reset