AI & ML
On the most informative Boolean function under noise
arXiv math.IT0 views
arXiv:2611.05430v1 Announce Type: new Abstract: Let $X$ be a uniform random bit string and $Y$ be obtained by flipping each bit of $X$ independently with probability $p$. Let $C$ be a random bit obtained as a function of $Y$. We show that $\mathbf{I}(C:X)\le \mathbf{I}(Y_1:X)$ for all $p\in[0,1]$, which resolves a conjecture posed by Courtade and Kumar in 2013.
Source：https://arxiv.org/abs/2611.05430PreviousSmell with Genji: Rediscovering Sensory Experience with an AI Co-Smelling PartnerNextHotplug Coded Caching: Embedding the YMA and Interference Elimination Schemes via Reed--Muller Codes
Related posts
Count outcomes, not agents
0dev.to
Scientist World turns 1,000 papers into executable research environments
0dev.to
I struggle to believe that AI R&D is ingenious
0Hacker News
Palo Alto Networks in talks to buy AI agent security startup Clutch for $500M
0TechCrunch
I built a vocabulary battle game for English learners — and my crowdfunding is still at zero backers
0dev.to
Meta Just Bought Conductor — the Race in AI Coding Is No Longer About the Model
0dev.to