Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.32120

Phantom-Conditioned Nested Sampling

Joshua G. Albert
View original source ↗Read source document ↗Export metadata ↓

Abstract

Nested sampling estimates the evidence by assigning prior volumes to an ordered sequence of likelihood contours. Markov chain constrained-prior samplers, which are used in high-dimensional problems, generate many intermediate states before producing the next classic sample. These intermediate states are discarded because their correlation prevents them from being inserted into the ordered NS sequence without changing its order-statistic law. This paper introduces a novel method of using them to improve evidence estimation, by formulating NS in a Bayesian way and conditioning on phantom samples as Monte Carlo observations. We then present the open-source software package, JAXNS v3, and its implementation choices. We validate the approach on a set of problems, and identify its limitations via ablation. In our experiments, when problem structure is well resolved, conditioning on all retained phantom samples reduces log-evidence RMSE by at least $30\%$, with larger improvements at higher dimensionality. For the tested problems with unresolved structure, full phantom conditioning produces no detectable improvement or deterioration in evidence accuracy. Phantom conditioning produces overconfident evidence uncertainties. We also introduce two dynamic nested sampling allocation schemes. Evidence-improving allocation approximately halves the number of likelihood evaluations required to achieve comparable evidence accuracy relative to uniform allocation. Posterior-improving allocation doubles the classic posterior's Kish effective sample size for $17.5\%$ additional likelihood evaluations.

Explore related subjects

stat.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joshua G. Albert. 2026-09-26. Phantom-Conditioned Nested Sampling. https://arxiv.org/abs/2609.32120

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

KEEP EXPLORING

Related papers

arXiv2026

Sequential Design for Simulators with Sharp Variations via Deep Gaussian Process Gradients

Deep Gaussian Processes (DGPs) compose Gaussian Process (GP) layers to warp inputs, improving the emulation of computer simulators with nonstationary input-output mappings. While gradient posteriors are analytically available for GPs, quantifying gradient uncertainty for DGPs is more challenging due to their hierarchical composition. In this paper, we propose an efficient approximation to the gradient distribution of a two-layer DGP emulator without requiring simulator gradients. Using the local linearization, we derive closed-form approximations for the gradient mean and covariance, enabling efficient gradient evaluation with uncertainty quantification (UQ). Empirical results show that the proposed approximation provides accurate gradient estimates and informative UQ on nonstationary examples. We then use the derived gradient uncertainty to guide sequential design for computer models with sharp variations. Specifically, we represent sharp-variation regions as super-level sets of the gradient norm and introduce an entropy-based acquisition rule that selects new samples where the estimated sharp-region is most uncertain. Experiments on synthetic benchmarks and a real-world application show that the resulting sequential design improves emulation accuracy for functions with sharp variations relative to existing design methods.

stat.CO↗
arXiv2026

Estimation of Parameters of the Truncated Normal Distribution with Unknown Bounds

Estimators of parameters of truncated distributions, namely the truncated normal distribution, have been widely studied for a known truncation region. There is also literature for estimating the unknown bounds for known parent distributions. In this work, we develop a novel algorithm under the expectation-solution (ES) framework, which is an iterative method of solving nonlinear estimating equations, to estimate both the bounds and the location and scale parameters of the parent normal distribution utilizing the theory of best linear unbiased estimates from location-scale families of distribution and unbiased minimum variance estimation of truncation regions. The conditions for the algorithm to converge to the solution of the estimating equations for a fixed sample size are discussed, and the asymptotic properties of the estimators are characterized using results on M- and Z-estimation from empirical process theory. The proposed method is then compared to methods utilizing the known truncation bounds via Monte Carlo simulation.

stat.CO↗
arXiv2026

Hankel--Christoffel--Nevai Screening for Bayesian Inverse Problems

Likelihood evaluation in Bayesian inverse problems often requires a forward-model solve. We study candidate screening using a likelihood-weighted prior moment matrix and two associated scores: a Christoffel ratio and a Nevai polynomial average. A finite pilot supplies likelihood information that is reused to rank further prior candidates. We connect finite-pilot matrix error, quantitative Legendre localization, and fixed-budget posterior-mass regret. Conditional likelihoods distinguish feature loss from polynomial and sampling errors, and a filtered Gaussian construction permits controlled feature selection and localization. In a nonlinear function-coefficient PDE, equal-budget comparisons separate methods using scalar likelihoods from surrogates using forward outputs. The Christoffel ratio outperforms the tested direct likelihood regressions, but forward-response surrogates capture more posterior mass at small retention budgets. Independent-pilot tests and reference resampling quantify two distinct sources of uncertainty. Controlled Gaussian experiments illustrate finite-filter truncation and the benefit of selecting relevant features. These results identify when moment geometry provides useful screening information, without asserting universal superiority over surrogate models or an exact posterior sampling method.

stat.CO↗