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
LVMH’s Media Division announces strategic partnership with OpenAI
0OpenAI Blog
Bharat Semi Raises $24M for AI Sensors That Think Where They See
0dev.to
Android 热更新实战:XopHotFix SDK 集成与补丁生成、发布完整教程
0dev.to

WeeklyReview#202646
0dev.to
evgmrf: An R Package For Gaussian Markov Random Field Extreme Value Models
0arXiv stat.CO
Limitations of nonreversible lifts for subgeometric diffusions
0arXiv stat.CO