Skip to content
Preprint

Projective Maximum Entropy: Universality and Acceptance-Region Calibration

Jul 2026 · 1 citation · 29 references
Mathematics

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.

View source

Similar papers

Preprint Aug 2026

A Structural Characterization of Entropy Functionals

Entropy functionals and their associated divergences underlie many statistical methods, including maximum entropy inference, minimum divergence estimation, and goodness-of-fit testing, yet choosing among Shannon, R\'enyi, Tsallis, and more general entropies is often a matter of convention rather than structural princip...

D. Lazarev · 0 citations
Open access Sep 2026

Maximum Entropy on the Complex Probability Framework

Jaynes’ maximum entropy (MaxEnt) principle selects, from all probability distributions consistent with a set of constraints, the one that maximizes the Shannon entropy. The principle is well-defined for classical, real-valued probabilities, but extending it to complex-valued probability theories requires care. Youssef’...

F. Tapiador · 0 citations
Preprint Aug 2026

Approximating the null distribution of generalized distance covariance

The null distribution of distance covariance is usually approximated by permutation, which is prohibitive when very small p-values are needed, or by matching a few moments to a parametric family, which is inaccurate in the tails. A third option is to approximate the limiting distribution, a weighted sum of chi-square v...

D. Edelmann · 0 citations
#machine learning Preprint Sep 2026

Generalized Score Matching for Parameter Estimation on Convex Domains

This work derives the generalized score matching objective on a convex subset of $\mathbb{R}^{d}$ constructively starting from Minimum Probability Flow (MPF) learning, and shows how classical score matching as well as domain-adapted variants for non-negative data arise naturally within the proposed framework.

Nishanth Shetty, Saisuchith Mahajan, C. Seelamantula · 0 citations
Open access Sep 2026

A canonical entropy-based multiscale decomposition of L1 functions

This work introduces a canonical entropy-based multiscale decomposition of nonnegative L1 functions that yields both physically meaningful approximations and an injective representation and establishes the Hahn D– c decomposition as a canonical information-theoretic framework that unifies multiscale approximation and r...

Rajeev Rajaram, N. Ritchey · 0 citations
Preprint Sep 2026

Majorizing Measures for Canonical Processes with Log-Concave Tails

Let $Y_1,\ldots,Y_n$ be independent symmetric random variables with log-concave tails. We give a dimension-free characterization of the expected supremum of the canonical process $X_x=\sum_{i=1}^n x_iY_i$ without any $\Delta_2$ or regular-growth assumption on the coordinate tails. The characterization is governed by sc...

Xuan-Ang Hu, Han-Chao Wang, Xing-Long Wu · 2 citations · ⚡2

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.