AI & ML
Relative Entropy under Ordered Chi-Squared Constraints: Exact Bounds and Extremizers
arXiv math.IT0 views
arXiv:2611.24607v1 Announce Type: new Abstract: We derive a sharp upper bound on the relative entropy $D(P\|Q)$ in terms of the two ordered chi-squared divergences $\chi^2(P\|Q)$ and $\chi^2(Q\|P)$. For any $A,B>0$, the constraints $\chi^2(P\|Q)\leq A$ and $\chi^2(Q\|P)\leq B$ yield upper bounds on $D(P\|Q)$ and $D(Q\|P)$. Two pairs of Bernoulli distributions each attain both bounds simultaneously. As a consequence, for sequences of probability mass functions $\{P_n\}$ and $\{Q_n\}$ on a common finite or countably infinite alphabet, both $D(P_n\|Q_n)$ and $D(Q_n\|P_n)$ tend to zero whenever one of the two ordered chi-squared divergences tends to zero and the other remains uniformly bounded. Without this boundedness assumption, $D(P_n\|Q_n)$ can fail to converge to zero even when $\chi^2(Q_n\|P_n)\to 0$. Finally, in contrast to the attainable upper bounds, on any finite or countably infinite alphabet containing at least three elements, the infimum of $D(P\|Q)$ under the exact constraints $\chi^2(P\|Q)=A$ and $\chi^2(Q\|P)=B$ is zero and is not attained.
Source:https://arxiv.org/abs/2611.24607PreviousHull variation of algebraic geometry codes under divisor twistsNextThe Asymptotic Capacity of the Grabbag Channel With and Without Feedback
Related posts
How to detect user frustration in chatbot conversations
0dev.to
Mình Đã Biến Gemini Thành Trợ Lý Cá Nhân Như Thế Nào (Lịch, Drive, Gmail và Những Lần Suýt Toang)
0dev.to
Im looking fr any free ai models / tools are there?, leaVE UR Lights💡
0dev.to
I checked 10 SEO agency websites for AI-search readiness. The real bugs were the boring ones.
0dev.to

How much GPU memory does an LLM need? The whole sum, worked out on real cards
0dev.to

Routing Upscaling Jobs by Output Size, Not Input Size
0dev.to