Positively Weighted Kernel Quadrature via Subsampling

07/20/2021
by   Satoshi Hayakawa, et al.
12

We study kernel quadrature rules with positive weights for probability measures on general domains. Our theoretical analysis combines the spectral properties of the kernel with random sampling of points. This results in effective algorithms to construct kernel quadrature rules with positive weights and small worst-case error. Besides additional robustness, our numerical experiments indicate that this can achieve fast convergence rates that compete with the optimal bounds in well-known examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2021

Acceleration of the kernel herding algorithm by improved gradient approximation

Kernel herding is a method used to construct quadrature formulas in a re...
research
12/20/2018

On the positivity and magnitudes of Bayesian quadrature weights

This article reviews and studies the properties of Bayesian quadrature w...
research
09/01/2017

Convergence Analysis of Deterministic Kernel-Based Quadrature Rules in Misspecified Settings

This paper presents convergence analysis of kernel-based quadrature rule...
research
06/18/2019

Kernel quadrature with DPPs

We study quadrature rules for functions living in an RKHS, using nodes s...
research
09/03/2023

An analysis of Ermakov-Zolotukhin quadrature using kernels

We study a quadrature, proposed by Ermakov and Zolotukhin in the sixties...
research
07/19/2019

On Linear Convergence of Weighted Kernel Herding

We provide a novel convergence analysis of two popular sampling algorith...
research
07/29/2022

Bayesian quadrature for H^1(μ) with Poincaré inequality on a compact interval

Motivated by uncertainty quantification of complex systems, we aim at fi...

Please sign up or login with your details

Forgot password? Click here to reset