Origins of the Combinatorial Basis of Entropy
Robert K. Niven

TL;DR
This paper explores the foundational combinatorial principles behind entropy, generalizing its definition beyond classical limits and providing a probabilistic basis for MaxEnt and MinXEnt methods independent of information theory.
Contribution
It introduces generalized combinatorial definitions of entropy and cross-entropy, extending their applicability beyond multinomial assumptions and asymptotic limits.
Findings
Generalized entropy functions can be defined without multinomial assumptions.
Extremizing these functions yields the most probable system realization.
Provides a probabilistic foundation for MaxEnt and MinXEnt methods.
Abstract
The combinatorial basis of entropy, given by Boltzmann, can be written , where is the dimensionless entropy, is the number of entities and is number of ways in which a given realization of a system can occur (its statistical weight). This can be broadened to give generalized combinatorial (or probabilistic) definitions of entropy and cross-entropy: and , where is the probability of a given realization, is a convenient transformation function, is a scaling parameter and an arbitrary constant. If or satisfy the multinomial weight or distribution, then using and , and asymptotically converge to the Shannon and Kullback-Leibler functions. In general, however, …
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.
