Progress on the Courtade-Kumar Conjecture: Optimal High-Noise Entropy Bounds and Generalized Coordinate-wise Mutual Information

TL;DR

This paper advances the understanding of the Courtade-Kumar conjecture by proving a universal mutual information bound for all Boolean functions and improving bounds in the high noise regime, supporting the conjecture's validity.

Contribution

It proves a universal mutual information sum bound for any Boolean function and refines the high noise analysis, extending the conjecture's proven range.

Findings

Mutual information sum is bounded by 1-H(α) for all Boolean functions.

Established an optimal $O(bbb5^2)$ error bound in high noise analysis.

Extended the noise parameter range where the conjecture holds.

Abstract

The Courtade-Kumar conjecture posits that dictatorship functions maximize the mutual information between the function's output and a noisy version of its input over the Boolean hypercube. We present two significant advancements related to this conjecture. First, we resolve an open question posed by Courtade and Kumar, proving that for any Boolean function (regardless of bias), the sum of mutual information between the function's output and the individual noisy input coordinates is bounded by $1-H(\alpha)$, where $\alpha$ is the noise parameter of the Binary Symmetric Channel. This generalizes their previous result which was restricted to balanced Boolean functions. Second, we advance the study of the main conjecture in the high noise regime. We establish an optimal error bound of $O(\lambda^2)$ for the asymptotic entropy expansion, where $\lambda = (1-2\alpha)^2$, improving upon the previous best-known bounds. This refined analysis leads to a sharp, linear Fourier concentration bound for highly informative functions and significantly extends the range of the noise parameter $\lambda$ for which the conjecture is proven to hold.