Information Geometric Approach on Most Informative Boolean Function Conjecture

Let [Formula: see text] be a memoryless uniform Bernoulli source and [Formula: see text] be the output of it through a binary symmetric channel. Courtade and Kumar conjectured that the Boolean function [Formula: see text] that maximizes the mutual information [Formula: see text] is a dictator function, i.e., [Formula: see text] for some i. We propose a clustering problem, which is equivalent to the above problem where we emphasize an information geometry aspect of the equivalent problem. Moreover, we define a normalized geometric mean of measures and interesting properties of it. We also show that the conjecture is true when the arithmetic and geometric mean coincide in a specific set of measures.