arXiv Machine Learning
Entropy Equivalence Testing
Read the original on arXiv Machine Learning →arXiv:2605. 23225v2 Announce Type: replace-cross Abstract: We introduce the problem of \emph{entropy equivalence testing} for probability distributions, a relaxation of the well-studied closeness testing problem, where the distribution testing algorithm is now only required to distinguish, given samples from two unknown distributions $p,q$ and a parameter $\varepsilon \in(0,1/2]$, between $p=q$ and $|H(p)-H(q)| \geq \varepsilon$ (where $H$ denotes the Shannon entropy).
Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.