Searcharxiv⌕ Search

arXiv · 2611.13323

Species sampling priors through exact augmentation

Abstract

Discrete random probability measures are central to Bayesian nonparametric mixture modeling and clustering. We show that every proper species sampling process (SSP) admits an exact two-stage finite representation of its sampling law. An almost surely finite index selects an initial set of atoms, and a draw is then made with explicitly reweighted probabilities. A decreasing visibility schedule determines both the reweighting and the index law. Averaging the finite conditional measures over this law recovers each realized SSP on every measurable set. Reversing this identity yields a novel and general method for constructing SSP priors from an index distribution and finite allocation probabilities, rather than specifying the infinite weights directly. We characterize compatibility between prescribed index probabilities, schedules and induced weights, and develop new SSP priors with full weak support using light-tailed, heavy-tailed and multimodal index distributions with suitable priors on their parameters. Within this framework, we couple marginal index laws with conditional weight distributions to construct SSP priors whose weights are invariant under size-biased permutation in their defining order. An example of such family is identified as the normalization of the sum of a gamma completely random measure and an independent compound-Poisson measure with gamma jumps, naturally leading to explicit partition and predictive laws. The joint distribution of the selected label and the finite index also gives exact simulation and recursive reweighting for SSPs. Total-variation bounds and numerical illustrations distinguish prior specification, exact averaging and fixed-level approximation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ramsés H. Mena, Christos Merkatas, Theodoros Nicoleris, Carlos E. Rodríguez. 2026-11-09. Species sampling priors through exact augmentation. https://searcharxiv.com/abs/2611.13323

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

On Minimal Observation Time for Recovering Latent Hawkes Networks

Dynamics of interacting systems in engineering, society, and nature often evolve over latent networks that govern which entities can interact. We study the problem of inferring these networks from event-based observations, which arise naturally in finance, seismology, and neuroscience. While there is substantial algorithmic work addressing this important problem, theoretical results are scarce. In this paper we ask the following fundamental question: what is the minimum time that one must observe the dynamics in order to exactly recover the underlying network, as a function of the number $d$ of interacting entities? For a class of stationary Hawkes processes with sparse, weak interactions, we prove that an observation time of order $\log d$ is sufficient and necessary. For the upper bound we construct a two-stage estimator that uses clipped and binned event data for screening, followed by a least-squares refinement, and apply concentration bounds derived from the Poisson cluster representation. For the lower bound we combine Fano's inequality with Jacod's Girsanov formula for point processes on a suitable subclass of networks.

math.ST↗

Bidirectional Random Projections

This paper analyzes bidirectional random projections for ordinary least squares (OLS) regression under the fixed design setting. Let $(X, Y) \in \mathbb{R}^{n\times p}\times\mathbb{R}^{n}$ be a sample and $W \in \mathbb{R}^{n_1\times n}$, $R \in \mathbb{R}^{p\times p_1}$ be two random projections. We develop an expected excess loss bound for the OLS estimator built on $(WXR, WY)$, extending an established bound for the OLS estimator built on $(XR, Y)$. Our analysis shows that our bound is larger and the gap between the two bounds decays at a rate of approximately $O(1/n_1)$. These findings are confirmed by numerical results.

math.ST↗

Asymptotics for Model Selection in Probabilistic Principal Component Analysis

The probabilistic formulation of principal component analysis promises statistically grounded solutions to the problem of selecting the number of principal components. However, developing tractable model selection methods is complicated by the fact that the probabilistic principal component analysis (PPCA) model exhibits non-standard large sample asymptotics at model singularities, where the Fisher information matrix does not have full rank. In this work, tools from singular learning theory are used to provide a complete description of the marginal likelihood asymptotics for PPCA. The singular Bayesian information criterion (sBIC) along with our asymptotic results provides an effective procedure for selecting the number of principal components. In particular, the sBIC corrects for the overpenalization of the standard dimension-based BIC, which leads to too few principal components being selected, while also selecting the smallest true model with probability converging to one. Our framework extends beyond PPCA, where we also provide expressions for the sBIC that can be used to select between PPCA and factor analysis models. In both simulations and on real data the effectiveness of the proposed sBIC methodology is demonstrated.

math.ST↗