Quantile Slice Sampling

📅 2024-07-17
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
Slice sampling suffers from low efficiency and heavy reliance on manual tuning when applied to complex target distributions—such as highly skewed or constrained spaces. To address this, we propose Quantile Slice Sampling (QSS), a novel framework that (1) integrates probability integral transformation with quantile mapping to enable automatic initialization and unit-interval standardization; (2) introduces an evaluable pseudo-target importance reweighting mechanism, coupled with dual-metric quality assessment and adaptive parameter optimization; and (3) extends slice sampling to multivariate and constrained state spaces by incorporating elliptical slicing, Neal’s shrinkage, and Gibbs-like coordinate updates. Experiments on benchmark distributions and Bayesian modeling tasks demonstrate that QSS significantly outperforms conventional slice sampling and Metropolis–Hastings: in highly skewed and constrained settings, it reduces rejection rates by over 30%, while delivering enhanced robustness, full automation, and practical usability.

Technology Category

Search and Optimization: Sampling/Simulation-based SearchMachine Learning: Calibration & Uncertainty QuantificationReasoning under Uncertainty: Stochastic Optimization

Application Category

Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphsUser Modeling, Personalization and Recommendation: Metrics for user behavior and evaluating successSearch and Retrieval-Augmented AI: Efficiency and scalability of Web search engines
📝 Abstract
We propose and demonstrate an alternate, effective approach to simple slice sampling. Using the probability integral transform, we first generalize Neal's shrinkage algorithm, standardizing the procedure to an automatic and universal starting point: the unit interval. This enables the introduction of approximate (pseudo-) targets through importance reweighting, a technique that has popularized elliptical slice sampling. Reasonably accurate pseudo-targets can boost sampler efficiency by requiring fewer rejections and by reducing target skewness. This strategy is effective when a natural, possibly crude, approximation to the target exists. Alternatively, obtaining a marginal pseudo-target from initial samples provides an intuitive and automatic tuning procedure. We consider two metrics for evaluating the quality of approximation; each can be used as a criterion to find an optimal pseudo-target or as an interpretable diagnostic. We examine performance of the proposed sampler relative to other popular, easily implemented MCMC samplers on standard targets in isolation, and as steps within a Gibbs sampler in a Bayesian modeling context. We extend the transformation method to multivariate slice samplers and demonstrate with a constrained state-space model for which a readily available forward-backward algorithm provides the target approximation.
Problem

Research questions and friction points this paper is trying to address.

Proposes a novel slice sampling method using probability integral transform
Introduces approximate pseudo-targets to boost sampler efficiency
Extends method to multivariate samplers with constrained state-space models
Innovation

Methods, ideas, or system contributions that make the work stand out.

Generalize Neal's shrinkage algorithm using probability integral transform
Introduce approximate targets via importance sampling factorization
Extend transformation method to multivariate slice samplers
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
Brigham Young University
M
Matthew J. Heiner
Department of Statistics, Brigham Young University, Provo, Utah
S
Samuel B. Johnson
Department of Statistics, Brigham Young University, Provo, Utah
J
Joshua R. Christensen
Department of Statistics, Brigham Young University, Provo, Utah
D
David B. Dahl
Department of Statistics, Brigham Young University, Provo, Utah