Which Similarity-Sensitive Entropy (Sentropy)?
Phuc Nguyen, Josiah Couch, Rahul Bansal, Alexandra Morgan, Chris Tam, Miao Li, Rima Arnaout, Ramy Arnaout

TL;DR
This paper compares two similarity-sensitive entropy measures, LCR and VS, analyzing their theoretical properties and practical differences across diverse datasets to guide their appropriate use.
Contribution
It provides a theoretical and empirical comparison of LCR and VS, introducing the concept of half-distance and establishing when each method is preferable.
Findings
LCR and VS can differ significantly in their values.
VS provides an upper bound on LCR under certain conditions.
Both methods depend on how similarities are scaled, affecting their results.
Abstract
Shannon entropy is not the only entropy that is relevant to machine-learning datasets, nor possibly even the most important one. Traditional entropies such as Shannon entropy capture information represented by elements' frequencies but not the richer information encoded by their similarities and differences. Capturing the latter requires similarity-sensitive entropy (``sentropy''). Sentropy can be measured using either the recently developed Leinster-Cobbold-Reeve framework (LCR) or the newer Vendi score (VS). This raises the practical question of which one to use: LCR or VS. Here we address this question theoretically and numerically, using 53 large and well-known imaging and tabular datasets. We find that LCR and VS values can differ by orders of magnitude and are complementary, except in limiting cases. We show that both LCR and VS results depend on how similarities are scaled, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
