On the Sampling Problem for Kernel Quadrature
원문 초록
The standard Kernel Quadrature method for numerical integration with random point sets (also called Bayesian Monte Carlo) is known to converge in root mean square error at a rate determined by the ratio $s/d$, where $s$ and $d$ encode the smoothness and dimension of the integrand. However, an empirical investigation reveals that the rate constant $C$ is highly sensitive to the distribution of the random points. In contrast to standard Monte Carlo integration, for which optimal importance sampling is well-understood, the sampling distribution that minimises $C$ for Kernel Quadrature does not admit a closed form. This paper argues that the practical choice of sampling distribution is an important open problem. One solution is considered; a novel automatic approach based on adaptive tempering and sequential Monte Carlo. Empirical results demonstrate a dramatic reduction in integration error of up to 4 orders of magnitude can be achieved with the proposed method.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
How Far Are We from Optimal Reasoning Efficiency?
A Dictionary of Closed-Form Kernel Mean Embeddings
Force-Free Molecular Dynamics Through Autoregressive Equivariant Networks
Underdamped Diffusion Bridges with Applications to Sampling
Provable Quantum Algorithm Advantage for Gaussian Process Quadrature
FNIN: A Fourier Neural Operator-based Numerical Integration Network for Surface-form-gradients
토론
이 논문과 연결된 포럼 글이 아직 없습니다.