Projective Maximum Entropy: Universality and Acceptance-Region Calibration
Hideitsu Hino
math.ST, stat.ML
Submitted: 2026-07-17
License: http://creativecommons.org/licenses/by/4.0/
The gist: Maximum-entropy reference distributions are usually constructed on the normalized probability simplex.
Terminology
Abstract
Maximum-entropy reference distributions are usually constructed on the normalized probability simplex. This formulation is less natural for unnormalized statistical models, in which positive multiples represent the same shape, and it does not directly explain how a prescribed admissible region should determine the deformation parameter of a bounded-support reference distribution. We formulate maximum entropy on the projective space of nonnegative measures and establish three results of statistical relevance. First, a universality theorem shows that every admissible monotone transform of the same normalized power functional has exactly the same optimizer under linear moment constraints. The result unifies the maximum-entropy implications of Tsallis and R'enyi entropies, H"older composite scores, pseudo-spherical scores, Bregman--H"older constructions, and related homogeneous divergences without asserting a new distribution family. Second, the common optimizer is characterized as a q-exponential density; under mean and covariance constraints it is a compactly supported q-Gaussian for positive deformation and a Student-type density for negative deformation. Third, a prescribed Mahalanobis acceptance region with squared radius R 2>d+2 uniquely determines the deformation parameter gamma R=2/(R 2-d-2). The resulting affine-equivariant reference density is the unique projective maximum-entropy solution, and its support coincides with the specified ellipsoid without an additional support constraint. This provides a principled method for constructing bounded-support statistical reference distributions from robust location and scatter estimates or from externally specified admissible regions.
Related papers
- Conformal Prediction for Dyadic Regression Under Complex Missingness
- Sharp Asymptotic Theory of Maximum Likelihood Estimation for Gaussian Processes with an RBF Kernel
- Bentkus-type asymptotic e-values
- High-Dimensional Asymptotics of Differentially Private PCA
- A proximal gradient algorithm for composite log-concave sampling
- KL Convergence Guarantees for Score diffusion models under minimal data assumptions