arXiv Open Access 2017

Computing the Unique Information

Pradeep Kr. Banerjee Johannes Rauh Guido Montúfar

Lihat Sumber

Abstrak

Given a pair of predictor variables and a response variable, how much information do the predictors have about the response, and how is this information distributed between unique, redundant, and synergistic components? Recent work has proposed to quantify the unique component of the decomposition as the minimum value of the conditional mutual information over a constrained set of information channels. We present an efficient iterative divergence minimization algorithm to solve this optimization problem with convergence guarantees and evaluate its performance against other techniques.

Topik & Kata Kunci

cs.IT

Penulis (3)

Pradeep Kr. Banerjee

Johannes Rauh

Guido Montúfar

Format Sitasi

APA MLA BibTeX

Banerjee, P.K., Rauh, J., Montúfar, G. (2017). Computing the Unique Information. https://arxiv.org/abs/1709.07487

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓