Table of Contents
Fetching ...

Partial Information Decomposition via Normalizing Flows in Latent Gaussian Distributions

Wenyuan Zhao, Adithya Balachandran, Chao Tian, Paul Pu Liang

TL;DR

The paper tackles efficient, accurate PID estimation for continuous multimodal data by proving that GPID optimally uses joint Gaussian marginals and by introducing Thin-PID, a gradient-based solver leveraging a Gaussian broadcast-channel view. To extend beyond Gaussianity, it proposes Flow-PID, which learns information-preserving latent Gaussian encoders via Cartesian normalizing flows and a Gaussian marginal loss, preserving total MI under bijections. Empirical results on canonical Gaussian and non-Gaussian synthetic data, along with real-world benchmarks (e.g., MultiBench, TCGA-BRCA, VQA), show Flow-PID provides accurate, scalable PID estimates and improves modality-interaction interpretability and model selection. The work offers a practical framework for quantifying redundant, unique, and synergistic information across modalities, enabling robust decision-making in multimodal modeling.

Abstract

The study of multimodality has garnered significant interest in fields where the analysis of interactions among multiple information sources can enhance predictive modeling, data fusion, and interpretability. Partial information decomposition (PID) has emerged as a useful information-theoretic framework to quantify the degree to which individual modalities independently, redundantly, or synergistically convey information about a target variable. However, existing PID methods depend on optimizing over a joint distribution constrained by estimated pairwise probability distributions, which are costly and inaccurate for continuous and high-dimensional modalities. Our first key insight is that the problem can be solved efficiently when the pairwise distributions are multivariate Gaussians, and we refer to this problem as Gaussian PID (GPID). We propose a new gradient-based algorithm that substantially improves the computational efficiency of GPID based on an alternative formulation of the underlying optimization problem. To generalize the applicability to non-Gaussian data, we learn information-preserving encoders to transform random variables of arbitrary input distributions into pairwise Gaussian random variables. Along the way, we resolved an open problem regarding the optimality of joint Gaussian solutions for GPID. Empirical validation in diverse synthetic examples demonstrates that our proposed method provides more accurate and efficient PID estimates than existing baselines. We further evaluate a series of large-scale multimodal benchmarks to show its utility in real-world applications of quantifying PID in multimodal datasets and selecting high-performing models.

Partial Information Decomposition via Normalizing Flows in Latent Gaussian Distributions

TL;DR

The paper tackles efficient, accurate PID estimation for continuous multimodal data by proving that GPID optimally uses joint Gaussian marginals and by introducing Thin-PID, a gradient-based solver leveraging a Gaussian broadcast-channel view. To extend beyond Gaussianity, it proposes Flow-PID, which learns information-preserving latent Gaussian encoders via Cartesian normalizing flows and a Gaussian marginal loss, preserving total MI under bijections. Empirical results on canonical Gaussian and non-Gaussian synthetic data, along with real-world benchmarks (e.g., MultiBench, TCGA-BRCA, VQA), show Flow-PID provides accurate, scalable PID estimates and improves modality-interaction interpretability and model selection. The work offers a practical framework for quantifying redundant, unique, and synergistic information across modalities, enabling robust decision-making in multimodal modeling.

Abstract

The study of multimodality has garnered significant interest in fields where the analysis of interactions among multiple information sources can enhance predictive modeling, data fusion, and interpretability. Partial information decomposition (PID) has emerged as a useful information-theoretic framework to quantify the degree to which individual modalities independently, redundantly, or synergistically convey information about a target variable. However, existing PID methods depend on optimizing over a joint distribution constrained by estimated pairwise probability distributions, which are costly and inaccurate for continuous and high-dimensional modalities. Our first key insight is that the problem can be solved efficiently when the pairwise distributions are multivariate Gaussians, and we refer to this problem as Gaussian PID (GPID). We propose a new gradient-based algorithm that substantially improves the computational efficiency of GPID based on an alternative formulation of the underlying optimization problem. To generalize the applicability to non-Gaussian data, we learn information-preserving encoders to transform random variables of arbitrary input distributions into pairwise Gaussian random variables. Along the way, we resolved an open problem regarding the optimality of joint Gaussian solutions for GPID. Empirical validation in diverse synthetic examples demonstrates that our proposed method provides more accurate and efficient PID estimates than existing baselines. We further evaluate a series of large-scale multimodal benchmarks to show its utility in real-world applications of quantifying PID in multimodal datasets and selecting high-performing models.

Paper Structure

This paper contains 44 sections, 8 theorems, 74 equations, 8 figures, 16 tables, 2 algorithms.

Key Result

Lemma 3.2

For any $q(x_1,x_2,y)$ with finite first and second moments, we have where $\hat{q}({x}_1, {x}_2, {y})$ is a jointly Gaussian distribution with the same first and second moments as $q(x_1,x_2,y)$.

Figures (8)

  • Figure 1: Flow-PID learns latent Gaussian encoders, parameterized by the Cartesian flow $f_1 \times f_2 \times f_Y$, to transform input modalities $(X_1,X_2,Y)$ into Gaussian marginal distributions. Then, PID values can be computed efficiently via Thin-PID under the equivalent interpretation of GPID.
  • Figure 2: PID values for 1D Gaussian example with different types of interactions. Thin-PID and Tilde-PID agree exactly with the ground truth.
  • Figure 3: Left: PID values in Example (i); right: PID values in Example (ii); middle: absolute error between different GPID algorithms and the ground truth. Thin-PID achieves the best accuracy with $<10^{-12}$ error, while the absolute error of Tilde-PID is $>10^{-8}$.
  • Figure 4: Time analysis: Thin-PID achieves $10\times$ speed of Tilde-PID.
  • Figure 5: Total mutual information determined by Flow-PID and BATCH/CVX estimators.
  • ...and 3 more figures

Theorems & Definitions (13)

  • Definition 2.1: PID
  • Definition 3.1: GPID
  • Lemma 3.2
  • Theorem 3.3: Thin-PID
  • Proposition 3.4: Projected gradient descent for Thin-PID
  • Theorem 4.1: Invariance of total MI under bijective mappings
  • Corollary 4.2
  • Corollary 4.3
  • Proposition 4.4: Gaussian marginal loss for Flow-PID
  • Definition A.1: PID liang2024quantifying
  • ...and 3 more