AI & ML
On the Subadditivity of Mutual f-Information
arXiv math.IT0 views
arXiv:2610.21231v1 Announce Type: new Abstract: We address an open problem raised by Polyanskiy and Wu in their textbook concerning the subadditivity of mutual \(f\)-information. We study two notions of generalized mutual information: mutual \(f\)-information, defined by \(\widetilde{I}_f(X;Y)=D_f(p_{XY}\|p_Xp_Y)\), and variational \((G,f)\)-information, obtained by minimizing an average of transformed \(f\)-divergences. For the first notion, we derive a sufficient condition on \(g(x)=x^2f''(x)\) that guarantees subadditivity under conditionally independent observations. This condition yields explicit families beyond the previously known examples generated by \(x\log x\) and \((x-1)\log x\). Our proof relies on the concavity of a generalized variance functional. For the variational notion, we extend existing sufficient conditions beyond the transforms \(G(x)\in\{x,\log(1+x),-\log(1-x)\}\). Using a comparison inequality for \(G^{-1}(G(A)+G(B))\), we obtain differential criteria for concave and convex transforms. Explicit constructions illustrate the resulting classes of subadditive information measures.
Source:https://arxiv.org/abs/2610.21231PreviousFour-Level Quantized Soft Information Aided Hard-Decision Decoder for Product-like CodesNextIterative Bounded Distance Decoding With 2-Bit Reliability Marker For Product-Like Codes
Related posts
Gemini 4 Carbon e DeepSeek V4.1 Flash Cyber: a Guerra Cibernética Autônoma e o Topo do Artificial Analysis
0dev.to Machine Learning
What can an AI agent do for you every day?
0dev.to Machine Learning
Mon modèle de paris semblait excellent sur 3 671 prédictions. Il n'a jamais battu le bookmaker.
0dev.to Machine Learning
HR manager LinkedIn About section examples you can adapt
0dev.to Career
🚀 Ready to explore the world of AWS Cloud and build something amazing together? ☁️
0dev.to Programming
The Second Scrape Should Be Almost Free
0dev.to Programming