English

The Principle of Uncertain Maximum Entropy

Information Theory 2026-02-03 v6 Computer Vision and Pattern Recognition Machine Learning math.IT

Abstract

The Principle of Maximum Entropy is a rigorous technique for estimating an unknown distribution given partial information while simultaneously minimizing bias. However, an important requirement for applying the principle is that the available information be provided error-free (Jaynes, 1982). We relax this requirement using a memoryless communication channel as a framework to derive a new, more general principle. We show our new principle provides an upper bound on the entropy of the unknown distribution and the amount of information lost due to the use of a given communications channel is unknown unless the unknown distribution's entropy is also known. Using our new principle we provide a new interpretation of the classic principle and experimentally show its performance relative to the classic principle and some other generally applicable solutions.

Keywords

Cite

@article{arxiv.2305.09868,
  title  = {The Principle of Uncertain Maximum Entropy},
  author = {Kenneth Bogert and Matthew Kothe},
  journal= {arXiv preprint arXiv:2305.09868},
  year   = {2026}
}
R2 v1 2026-06-28T10:36:33.882Z