An algebraic generalization of the entropy and its application to statistics
Martin Schlather

TL;DR
This paper introduces an algebraic framework for defining a generalized entropy, deriving related scalar products and distances, and connecting these concepts to established statistical measures and inequalities, offering new insights into statistical theory.
Contribution
It presents a novel algebraic generalization of entropy and related measures, unifying various statistical concepts under a common framework.
Findings
Generalized entropy defined algebraically
Derived scalar product and distance measures
Connected to likelihood, divergence, and mutual information
Abstract
We define a general notion of entropy in elementary, algebraic terms. Based on that, weak forms of a scalar product and a distance measure are derived. We give basic properties of these quantities, generalize the Cauchy-Schwarz inequality, and relate our approach to the theory of scoring rules. Many supporting examples illustrate our approach and give new perspectives on established notions, such as the likelihood, the Kullback-Leibler divergence, the uncorrelatedness of random variables, the scalar product itself, the Tichonov regularization and the mutual information.
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.
Taxonomy
TopicsStatistical Mechanics and Entropy · Complex Systems and Decision Making · Neural Networks and Applications
