Kernel quadrature by applying a point-wise gradient descent method to discrete energies

by   Ken'ichiro Tanaka, et al.

We propose a method for generating nodes for kernel quadrature by a point-wise gradient descent method. For kernel quadrature, most methods for generating nodes are based on the worst case error of a quadrature formula in a reproducing kernel Hilbert space corresponding to the kernel. In typical ones among those methods, a new node is chosen among a candidate set of points in each step by an optimization problem with respect to a new node. Although such sequential methods are appropriate for adaptive quadrature, it is difficult to apply standard routines for mathematical optimization to the problem. In this paper, we propose a method that updates a set of points one by one with a simple gradient descent method. To this end, we provide an upper bound of the worst case error by using the fundamental solution of the Laplacian on 𝐑^d. We observe the good performance of the proposed method by numerical experiments.


page 1

page 2

page 3

page 4


Acceleration of the kernel herding algorithm by improved gradient approximation

Kernel herding is a method used to construct quadrature formulas in a re...

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

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

Worst-Case Risk Quantification under Distributional Ambiguity using Kernel Mean Embedding in Moment Problem

In order to anticipate rare and impactful events, we propose to quantify...

Quantifying the Benefit of Using Differentiable Learning over Tangent Kernels

We study the relative power of learning with gradient descent on differe...

Learning from Non-IID Data in Hilbert Spaces: An Optimal Recovery Perspective

The notion of generalization in classical Statistical Learning is often ...

Informative Planning for Worst-Case Error Minimisation in Sparse Gaussian Process Regression

We present a planning framework for minimising the deterministic worst-c...

On Radial Isotropic Position: Theory and Algorithms

We review the theory of, and develop algorithms for transforming a finit...