paper-with-me

홈 › Papers

$λ$-PSD: Scalable Approximate SNR-Optimised Polynomial Stein Discrepancies

2026-06-25 · Minh-Long Nguyen, Thanh-Long Vu, Christopher Drovandi, Leah F. South, Trung-Tin Nguyen arxiv

Polynomial Stein discrepancies (PSD) provide a scalable alternative to kernel Stein methods for measuring sample quality and goodness-of-fit testing, but their statistical properties remain poorly understood. We show that increasing polynomial degree primarily amplifies signal without adequately controlling variance, rather than directly optimising the signal-to-noise ratio (SNR). Under suitable assumptions, this might lead to a failure mode in which the $\text{SNR}^2$ can provably decay exponentially with polynomial degree. Motivated by this observation, we reformulate Stein discrepancy construction as an explicit $\text{SNR}^2$ maximisation problem, yielding a Rayleigh quotient over Stein features. This perspective motivates $λ$-PSD, an approximate scalable covariance-aware reweighting scheme defined in a low-dimensional subspace. Under Gaussian settings, we show that $λ$-PSD avoids the exponential $\text{SNR}^2$ collapse and achieves a stable $\text{SNR}^2$. Empirically, $λ$-PSD substantially improves test power while retaining linear-time complexity in the number of samples, highlighting the importance of SNR-aware design for scalable Stein discrepancies.

📄 PDF Abstract BibTeX arXiv:2606.26621

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Random Feature Stein Discrepancies

2018-06-20 · NeurIPS 2018 12 · Jonathan H. Huggins, Lester Mackey

Computable Stein discrepancies have been deployed for a variety of applications, ranging from sampler selection in posterior inference to approximate Bayesian inference to goodness-of-fit testing. Existing convergence-de…

Bayesian Inference

Stochastic Stein Discrepancies

2020-07-06 · NeurIPS 2020 12 · Jackson Gorham, Anant Raj, Lester Mackey

Stein discrepancies (SDs) monitor convergence and non-convergence in approximate inference when exact integration and sampling are intractable. However, the computation of a Stein discrepancy can be prohibitive if the St…

Open-Ended Question Answering

Controlling Moments with Kernel Stein Discrepancies

2022-11-10 · Heishiro Kanagawa, Alessandro Barp, Arthur Gretton, Lester Mackey

Kernel Stein discrepancies (KSDs) measure the quality of a distributional approximation and can be computed even when the target density has an intractable normalizing constant. Notable applications include the diagnosis…

Measuring Sample Quality with Diffusions

2016-11-21 · Jackson Gorham, Andrew B. Duncan, Sebastian J. Vollmer, Lester Mackey

Stein's method for measuring convergence to a continuous target distribution relies on an operator characterizing the target and Stein factor bounds on the solutions of an associated differential equation. While such ope…

Diversity

A Universal Approximation Theorem of Deep Neural Networks for Expressing Probability Distributions

2020-04-19 · NeurIPS 2020 12 · Yulong Lu, Jianfeng Lu

This paper studies the universal approximation property of deep neural networks for representing probability distributions. Given a target distribution $\pi$ and a source distribution $p_z$ both defined on $\mathbb{R}^d$…