AI & ML
Similarity-Sensitive Entropy under Representation Change and Inference
arXiv math.IT0 views
arXiv:2601.03064v3 Announce Type: replace-cross Abstract: Similarity-sensitive entropy measures the uncertainty of a probability law relative to a similarity kernel that encodes the distinguishability of states. We develop the measure-theoretic treatment covering both finite similarity matrices and general probability spaces, and study how the law and similarity kernel transform under measurable maps, channels, and conditioning operations. This yields data-processing inequalities, so a reduction in entropy quantifies how much distinguishability is lost under representation change. We also define a conditional similarity-sensitive entropy theory, give a counterexample to a recent conjecture on concavity, and identify a practical one-dimensional Laplace kernel class where concavity holds.
Source:https://arxiv.org/abs/2601.03064PreviousEngineering Yeast Cells to Facilitate Information ExchangeNextDirectional Confusions Reveal Divergent Inductive Biases Through Rate-Distortion Geometry in Human and Machine Vision
Related posts

Senator slams Commerce Secretary for flow of Nvidia AI chips to China
0The Verge
They Found You Through a Photograph…
0dev.to
The Joy of Boring Code: Why Writing "Clever" Code is Overrated
0dev.to
From fMRI to images: what Brain-IT reconstructs—and what it does not
0dev.to
Vad ska vi automatisera först? En poängmodell för småföretag
0dev.to

Octopus Energy is bringing its sold-out plug-in solar panels to UK small businesses, says move was a 'no-brainer' following huge demand
0TechRadar