The strong data processing inequality under the heat flow
Bo'az Klartag, Or Ordentlich

TL;DR
This paper investigates how divergences between probability distributions decay under heat flow, establishing bounds on SDPI coefficients, and generalizing key identities related to entropy and mutual information.
Contribution
It provides new bounds on the strong data-processing inequality coefficients and generalizes classical identities like de Brujin's and Costa's results in the context of heat flow.
Findings
Bounds on SDPI coefficients for various divergences.
Generalizations of de Brujin's identity and Costa's concavity result.
New lower bounds on mutual information and MMSE involving the Poincaré constant.
Abstract
Let and be probability distributions on , and be their evolution under the heat flow, that is, the probability distributions resulting from convolving their density with the density of an isotropic Gaussian random vector with variance in each entry. This paper studies the rate of decay of for various divergences, including the and Kullback-Leibler (KL) divergences. We prove upper and lower bounds on the strong data-processing inequality (SDPI) coefficients corresponding to the source and the Gaussian channel. We also prove generalizations of de Brujin's identity, and Costa's result on the concavity in of the differential entropy of . As a byproduct of our analysis, we obtain new lower bounds on the mutual information between and , where is a standard Gaussian vector…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Physics and Python Applications
