Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.12299

Regenerative Rejection Sampling

Tommaso Bozzi
View original source ↗Read source document ↗Export metadata ↓

Abstract

This thesis presents Regenerative Rejection Sampling (RRS), a novel approximate sampling algorithm inspired by classical Rejection Sampling and Markov Chain Monte Carlo methods. The method constructs a continuous-time regenerative process whose stationary distribution coincides with a target density known only up to a normalizing constant. Unlike standard Rejection Sampling, RRS does not require the existence of a finite constant that upper-bounds the likelihood ratio. As a result, its total variation convergence rate remains exponential for a larger class of scenarios compared to, for example, the Independent Metropolis-Hastings sampler, which requires a finite bounding constant. To explain the workings of the method, we first present a detailed review of renewal and regenerative processes, including their limit theorems, stationary versions, and convergence properties under standard conditions. We explain a coupling proof for exponential convergence of regenerative processes, under the assumption of a spread-out cycle length distribution. We then introduce the RRS algorithm, and derive its convergence rate. Its performance is compared theoretically and empirically with classical MCMC methods. Numerical experiments demonstrate that RRS can exhibit lower autocorrelations and faster effective mixing, both in synthetic examples and in a Bayesian probit regression model applied to a real medical dataset. Moreover, if the algorithm is run until time t, we show that the usual order $O(1/t)$ results for the bias of the time-average estimators, is improved to a bias of $O(1/t^2)$ for the estimator constructed from the RRS method, and provide easy-to-estimate non-asymptotic bounds for this bias.

Explore related subjects

stat.COmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tommaso Bozzi. 2026-03-31. Regenerative Rejection Sampling. https://arxiv.org/abs/2603.12299

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

KEEP EXPLORING

Related papers

arXiv2026

Wasserstein mixing of a systematic-scan random rotation sampler

We study the mixing time of a systematic-scan analogue of Kac's walk that was proposed as a fast surrogate for Haar-distributed orthogonal matrices in randomized high-dimensional algorithms and was conjectured to approach Haar measure after only logarithmically many sweeps. We show that this conjectured speed-up does not occur for convergence of the full matrix law to Haar measure in Frobenius Wasserstein distance. At fixed normalized accuracy, the mixing time lies between order $n/\log n$ and order $n$ sweeps; at fixed absolute Frobenius accuracy, the corresponding bounds are between order $n$ and order $n\log n$. More strongly, below the scale $n/\log n$, the normalized Wasserstein distance remains asymptotically at its extremal value. We also show that the output law is singular with respect to Haar measure for fewer than $n/2$ sweeps. Thus the sampler may provide effective application-specific randomization without exhibiting the much faster full-Haar mixing.

stat.CO↗
arXiv2026

Bayesian Calibration with Functional Outputs Using Elastic Partial Matching

Calibrating a simulation model involves estimating its parameters by comparing model outputs with experimental data, so that simulation results faithfully reproduce the experimental observations. When the outputs are functions of time, there are multiple ways to quantify the discrepancy between experimental and simulated curves. A recent approach based on elastic functional data analysis decomposes a functional output into two components: a function temporally aligned to a template, and the corresponding warping function. This decomposition splits the problem into two independent calibration tasks, thereby addressing functional misalignment. However, it assumes that experimental and simulated curves share the same temporal support, an assumption often violated in practice when initial or end times are themselves uncertain or depend on the calibration parameters. In this work, we reinterpret the decomposition step as an approximation to a more general Bayesian calibration problem that incorporates an error term on the time axis. This perspective allows us to naturally extend the framework to a broader family of time warpings with varying initial or end times, using partial elastic alignment. We illustrate the method on a synthetic test case, comparing it with existing Bayesian calibration methods and demonstrating improved surrogate performance and error modeling. We then apply the proposed approach to the calibration of an equation of state (a thermodynamic equation relating the state variables of a material).

stat.CO↗
arXiv2026

Some surprising properties of essential data points visualization

Essential Data Points (EDPs) - the vertices of the convex hull of a bilinear data matrix $\mathbf{D}$ in its row space, column space, or both - are widely used in chemometrics to reduce the size of large data sets while nominally preserving their underlying geometric structure. Using simulated three- and two-component chromatographic/spectral data sets and a real source-apportionment data set ($\mathbf{D = C\, A^\mathsf{T}}$), together with Borgen-Rajkó plots, Procrustes analysis, and variance-covariance comparisons, we show that this preservation is only \emph{partial}: row-wise EDP reduction preserves the row-space geometry (inner and outer polygons) exactly while distorting the column-space geometry, and column-wise reduction shows the opposite behavior; joint row-and-column reduction distorts both. We then give a rigorous, general proof - based on the four fundamental subspaces of a matrix and its singular value decomposition $\mathbf{D = U\,S\,V^\mathsf{T}}$ - that the subspace which is \emph{not} being reduced is always preserved exactly, up to an orthogonal rotation, whereas the subspace whose ambient dimension shrinks is related to the original only through a general, non-orthogonal isomorphism. This distinction is confirmed numerically to machine precision ($\sim 10^{-14}$-$10^{-16}$) on the real data set, and a deliberate negative control confirms that the "ambient-shrinking" map is genuinely non-orthogonal (residual $\approx 1$). These results demonstrate that the apparent rotation of an EDP-reduced polygon relative to the original is not, in general, a rigid rotation, and that visual or numerical comparisons between an EDP-reduced data set and the original data require an explicit, mode-dependent change-of-basis correction before any geometric or statistical conclusion can be drawn. A MATLAB implementation of this correction is provided.

stat.CO↗