mlsanityData to 14 Oct 2026

The Principle of Uncertain Maximum Entropy

arXiv 2305.09868 ↗First posted 17 May 2023cs.IT cs.CV cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 41 references that are in the map. First posted on arXiv 17 May 2023.

Builds on

2 of 41 references.

References · 2

  1. 2021Convex optimizationcited by 2,515
  2. 2021A Branch-and-Cut Algorithm for Mixed Integer Bilevel Linear Optimization Problems and Its Implementationcited by 6

Built on by

Not cited yet.