Search arXivSearch

arXiv · 2606.18700

Bayesian Prediction in Gamma Models: Admissibility and Infinitesimal Prediction

Abstract

We study estimation and prediction in the Gamma model $\mathrm{Ga}(α,β)$, where the shape parameter $α$ is known and the scale parameter $β$ is unknown, under the Kullback--Leibler loss. For $α\le1$, all scale-invariant estimators of $β$ have infinite risk, indicating a qualitative change in the estimation problem at the boundary $α=1$. Our main result is that the Bayesian predictive density based on the Jeffreys prior is admissible for all $α>0$. This resolves the admissibility problem for Bayesian predictive densities in Gamma models. As a related result, we also establish the admissibility of the corresponding Bayesian estimator for $α>1$. To prove the predictive admissibility result, we develop an infinitesimal prediction framework based on Gamma processes. This framework naturally leads to a Kullback--Leibler loss for Lévy densities and establishes a connection between predictive distributions and Lévy measures. Under the resulting loss, the Bayesian predictive Lévy density is shown to be the posterior mean Lévy density. Unlike the normal and Poisson models, infinitesimal prediction in the Gamma model does not reduce to parameter estimation. Instead, it reduces to the estimation of a Lévy density. We relate this phenomenon to mean mixture curvature and discuss it from an information-geometric viewpoint.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fumiyasu Komaki. 2026-06-17. Bayesian Prediction in Gamma Models: Admissibility and Infinitesimal Prediction. https://arxiv.org/abs/2606.18700

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

KEEP EXPLORING

Related papers

A note on the distribution of the partial correlation coefficient with nonparametrically estimated marginal regressions

There has been much interest in the nonparametric testing of conditional independence in the econometric and statistical literature, but the simplest and potentially most useful method, based on the sample partial correlation, seems to have been overlooked, its distribution only having been investigated in some simple parametric instances. The present note shows that an easy to apply permutation test based on the sample partial correlation with nonparametrically estimated marginal regressions has good large and small sample properties.

math.ST

Instance-Log-Optimality of Portfolio-Based E-Processes and their Sequential Hypothesis Tests

We consider the problem of sequential hypothesis testing using $e$-processes. For a rich class of composite testing problems---which include bounded mean testing, equal mean testing for bounded random tuples, and some key ingredients of two-sample and independence testing as special cases---we show that any $e$-process satisfying a certain sublinear regret bound is asymptotically and almost surely instance-log-optimal for a composite alternative. This is a strong notion of optimality that has not previously been established for the aforementioned problems, and we provide explicit test supermartingales and $e$-processes satisfying this notion in a more general case. Furthermore, we derive matching lower and upper bounds on the expected rejection time in the high-confidence regime for the resulting sequential tests in all of these cases. The proofs of these results make weak, algorithm-agnostic moment assumptions and rely on a proof technique involving the aforementioned regret and a family of numeraire portfolios. Finally, we discuss how all of these theorems hold in a distribution-uniform sense, a notion of log-optimality that is stronger still and seems to be new to the literature.

math.ST

Common Drivers in Sparsely Interacting Hawkes Processes

We study a multivariate Hawkes process as a model for time-continuous relational event networks. The model does not assume the network to be known, it includes covariates, and it allows for both common drivers, parameters common to all the actors in the network, and also local parameters specific for each actor. We derive rates of convergence for all of the model parameters when both the number of actors and the time horizon tends to infinity. To prevent an exploding network, sparseness is assumed. We also discuss numerical aspects.

math.ST