Redundancy and synergy in multivariate Gaussians via the Blackwell order
cs.IT, math.IT, stat.ML
Submitted: 2026-10-05
Updated: 2026-10-05
License: http://creativecommons.org/publicdomain/zero/1.0/
The gist: The goal of the partial information decomposition (PID) is to quantify the redundant and synergistic information that multiple sources provide about a target.
Terminology
Abstract
The goal of the partial information decomposition (PID) is to quantify the redundant and synergistic information that multiple sources provide about a target. PID has many applications in machine learning, neuroscience, and other fields, but defining and computing it for high-dimensional continuous systems remains challenging. Here, we define a PID for multivariate Gaussian systems based on the Blackwell order, which formalizes when one channel is more informative than another. We prove that Gaussian channels are optimal for extracting both redundant and union information, yielding an intuitive geometric interpretation and an efficient numerical algorithm for the PID. Our union information and synergy coincide with the well-known BROJA measures, and we derive closed-form expressions for both in the case of two sources. We also argue that Blackwell redundancy (which differs from BROJA) is the only existing redundancy measure that satisfies a set of natural desiderata. We demonstrate the scalability of our method on systems with up to a thousand dimensions or sources. Our approach is illustrated on an optimal control problem, where it identifies redundant and synergistic interactions between sensor and memory.
Sources
- A scalable estimator of higher-order information in complex dynamical systems
- Closed-Form Gaussian Estimators for Multi-Source Partial Information Decomposition
- Explainable Multimodal Regression via Information Decomposition
- Nonnegative Decomposition of Multivariate Information
Related papers
- Language Modeling is Monotone Compression
- Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
- Discrepancy for Random Linear Codes
- A New Approach to Code Smoothing Bounds
- Contextual Memory-Enhanced Source Coding for Low-SNR Communications
- Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels