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

09/01/2017
by   Motonobu Kanagawa, et al.
0

This paper presents convergence analysis of kernel-based quadrature rules in misspecified settings, focusing on deterministic quadrature in Sobolev spaces. In particular, we deal with misspecified settings where a test integrand is less smooth than a Sobolev RKHS based on which a quadrature rule is constructed. We provide convergence guarantees based on two different assumptions on a quadrature rule: one on quadrature weights, and the other on design points. More precisely, we show that convergence rates can be derived (i) if the sum of absolute weights remains constant (or does not increase quickly), or (ii) if the minimum distance between distance design points does not decrease very quickly. As a consequence of the latter result, we derive a rate of convergence for Bayesian quadrature in misspecified settings. We reveal a condition on design points to make Bayesian quadrature robust to misspecification, and show that, under this condition, it may adaptively achieve the optimal rate of convergence in the Sobolev space of a lesser order (i.e., of the unknown smoothness of a test integrand), under a slightly stronger regularity condition on the integrand.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/24/2016

Convergence guarantees for kernel-based quadrature rules in misspecified settings

Kernel-based quadrature rules are becoming important in machine learning...
research
07/20/2021

Positively Weighted Kernel Quadrature via Subsampling

We study kernel quadrature rules with positive weights for probability m...
research
12/23/2019

Stability of lattice rules and polynomial lattice rules constructed by the component-by-component algorithm

We study quasi-Monte Carlo (QMC) methods for numerical integration of mu...
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
07/19/2019

On Linear Convergence of Weighted Kernel Herding

We provide a novel convergence analysis of two popular sampling algorith...
research
08/06/2023

A randomised lattice rule algorithm with pre-determined generating vector and random number of points for Korobov spaces with 0 < α≤ 1/2

In previous work (Kuo, Nuyens, Wilkes, 2023), we showed that a lattice r...
research
02/16/2010

Convergence of Bayesian Control Rule

Recently, new approaches to adaptive control have sought to reformulate ...

Please sign up or login with your details

Forgot password? Click here to reset