Minimizing the CDF Path Length: A Novel Perspective on Uniformity and Uncertainty of Bounded Distributions
Michael E. Beyer

TL;DR
This paper introduces a new uniformity index based on the shortest path of the CDF, offering an alternative to entropy for selecting bounded probability distributions with constraints.
Contribution
It proposes a novel CDF path length-based uniformity index and analyzes its properties and implications for constrained distribution selection.
Findings
Shortest path distributions are more heavy-tailed than maximum-entropy distributions.
The uniformity index provides a different perspective on uncertainty measures.
Analytical and numerical methods are developed for constrained distributions.
Abstract
An index of uniformity is developed as an alternative to the maximum-entropy principle for selecting continuous, differentiable probability distributions subject to constraints . The uniformity index developed in this paper is motivated by the observation that among all differentiable probability distributions defined on a finite interval , it is the uniform probability distribution that minimizes the path length of the associated cumulative distribution function on . This intuition is extended to situations where there are constraints on the allowable probability distributions. In particular, constraints on the first and second raw moments of a distribution are discussed in detail, including the analytical form of the solutions and numerical studies of particular examples. The resulting "shortest path" distributions are…
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 · Probabilistic and Robust Engineering Design · Statistical and numerical algorithms
