Searcharxiv⌕ Search

arXiv · 2610.33859

A simple improvement on Kerman's approximation to the median of the beta distribution

Abstract

Kerman's approximation to the median of the Beta$(α,β)$ distribution is the ratio $g(α)/(g(α) + g(β))$ with $g(x) = x - 1/3$, using the first two terms of the asymptotic expansion of the median of the standard gamma distribution. We extend this elegant ratio form to the one-parameter family with $g(x) = x - 1/3 + c_1/x$, in which $c_1 = 0$ gives Kerman's. For large shape parameters along any ray $β= rα$ with $r > 1$, the resulting approximation is eventually a lower bound on the median if $c_1 \le 8/405$ and an upper bound if $c_1 \ge 1/45$. We recommend $c_1 = 1/36$ for its simplicity: it makes $g(x) = (x - 1/6)^2/x$ a perfect square over $x$, and it is within 1% of the minimax value of $c_1$ for $α, β\ge 1$ under several error measures, while the theoretically distinguished values $8/405$ and $1/45$ are less accurate. The approximation is then $((α- 1/6)^2/α)/((α- 1/6)^2/α+ (β- 1/6)^2/β)$. Its relative error lies between -0.171% and +0.212% for all $1 \le α\le β$, compared with up to -3.8% for Kerman's. It is more accurate than Kerman's approximation wherever the latter is defined, with relative error never more than 13/32 of Kerman's, the ratio approached asymptotically. The same $g(α)$ is a useful approximation to the gamma distribution median, overestimating it by at most 0.212% for shape parameter $α\ge 1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Richard F. Lyon. 2026-10-24. A simple improvement on Kerman's approximation to the median of the beta distribution. https://arxiv.org/abs/2610.33859

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Compatibility-based Bayesian inference: asymptotic limits, variational principles, and Wasserstein geometry

Approximate Bayesian Computation (ABC) replaces intractable likelihood evaluations with comparisons between observed and simulated data. We formulate discrepancy-based inference through nonnegative compatibility weights. Prior-integrated convergence of rescaled weights gives total variation convergence as the tolerance vanishes. For a fixed positive tolerance and increasing sample size, we give a general representation-based formulation of the conditional-prior limit known from ABC and coarsened Bayesian inference, and establish convergence in expected total variation under stabilization in probability and a prior-null boundary condition. We also derive acceptance-persistence bounds under partial stabilization. The Gibbs variational identity yields convergence of minimum values and stability of approximate minimizers; the fixed-tolerance limit is characterized separately by constrained relative-entropy minimization. For additional penalty-based functionals of the limiting Wasserstein discrepancy, we prove an exact reduction to distributions over model laws and, under a geodesic assumption, a representation by distances from a Wasserstein ball. These penalty-based updates are distinguished from the original fixed-tolerance ABC limit and illustrated through a Gaussian comparison.

math.ST↗

A theory of stratification learning

Given i.i.d. sample from a stratified mixture of immersed manifolds of different dimensions, we study the minimax estimation of the underlying stratified structure. We provide a constructive algorithm allowing to estimate each mixture component at its optimal dimension-specific rate adaptively. The method is based on an ascending hierarchical co-detection of points belonging to different layers, which also identifies the number of layers and their dimensions, assigns each data point to a layer accurately, and estimates tangent spaces optimally. These results hold regardless of any ambient assumption on the manifolds or on their intersection configurations. They open the way to a broad clustering framework, where each mixture component models a cluster emanating from a specific nonlinear correlation phenomenon.

math.ST↗

Wasserstein-Cramér-Rao Theory of Unbiased Estimation

The quantity of interest in the classical Cramér-Rao theory of unbiased estimation (e.g., the Cramér-Rao lower bound, its exact attainment for exponential families, and asymptotic efficiency of maximum likelihood estimation) is the variance, which represents the instability of an estimator when its value is compared to the value for an independently-sampled data set from the same distribution. In this paper we are interested in a quantity which represents the instability of an estimator when its value is compared to the value for an infinitesimal additive perturbation of the original data set; we refer to this as the "sensitivity" of an estimator. The resulting theory of sensitivity is based on the Wasserstein geometry in the same way that the classical theory of variance is based on the Fisher-Rao (equivalently, Hellinger) geometry, and this insight allows us to determine a collection of results which are analogous to the classical case: a Wasserstein-Cramér-Rao lower bound for the sensitivity of any unbiased estimator, a characterization of models in which there exist unbiased estimators achieving the lower bound exactly, and various results on the asymptotic achievement of the lower bound. More precisely, we show that Wasserstein projection estimators (and one-step approximations thereof) are asymptotically sensitivity-efficient under suitable assumptions, and that there exist Hodges-type estimators which exhibit super-sensitivity-efficiency. We use these results to treat many statistical examples, sometimes revealing new optimality properties for existing estimators and other times revealing entirely new estimators.

math.ST↗