Gaussian credible intervals in Bayesian nonparametric estimation of the unseen
Claudia Contardi, Emanuele Dolera, Stefano Favaro
TL;DR
This work addresses the unseen-species problem under a Bayesian nonparametric framework using the Pitman–Yor prior. It introduces a Gaussian central limit theorem-based method to construct large-$m$ credible intervals for $K_{n,m}$ that are centered on the BNP estimator and do not require Monte Carlo sampling, extending to $oldsymbol{ m\alpha}\in[0,1)$ and $ heta>-oldsymbol{ m\alpha}$. By scaling $(n,j, heta)$ with $m$ and deriving explicit expressions for the limiting mean and variance, the authors obtain analytical Gaussian intervals with strong coverage properties, outperforming Mittag-Leffler-based intervals in finite samples. The approach is validated on synthetic distributions (Zipf, Dirichlet–Multinomial, Uniform) and real EST data, showing improved coverage and competitive interval lengths, with practical implications for planning additional sampling in genomic and ecological studies.
Abstract
The unseen-species problem assumes $n\geq1$ samples from a population of individuals belonging to different species, possibly infinite, and calls for estimating the number $K_{n,m}$ of hitherto unseen species that would be observed if $m\geq1$ new samples were collected from the same population. This is a long-standing problem in statistics, which has gained renewed relevance in biological and physical sciences, particularly in settings with large values of $n$ and $m$. In this paper, we adopt a Bayesian nonparametric approach to the unseen-species problem under the Pitman-Yor prior, and propose a novel methodology to derive large $m$ asymptotic credible intervals for $K_{n,m}$, for any $n\geq1$. By leveraging a Gaussian central limit theorem for the posterior distribution of $K_{n,m}$, our method improves upon competitors in two key aspects: firstly, it enables the full parameterization of the Pitman-Yor prior, including the Dirichlet prior; secondly, it avoids the need of Monte Carlo sampling, enhancing computational efficiency. We validate the proposed method on synthetic and real data, demonstrating that it improves the empirical performance of competitors by significantly narrowing the gap between asymptotic and exact credible intervals for any $m\geq1$.
