Comparison of Two Search Criteria for Lattice-based Kernel Approximation

arXiv2304.01685MaRDI QIDQ6432012FDOQ6432012

Authors: F. Y. Kuo, Weiwen Mo, Dirk Nuyens, Ian H. Sloan, Abirami Srikumar 

Publication date: 4 April 2023

Abstract: The kernel interpolant in a reproducing kernel Hilbert space is optimal in the worst-case sense among all approximations of a function using the same set of function values. In this paper, we compare two search criteria to construct lattice point sets for use in lattice-based kernel approximation. The first candidate, $cal{P}_n^{\ast }$, is based on the power function that appears in machine learning literature. The second, $cal{S}_n^{*}$, is a search criterion used for generating lattices for approximation using truncated Fourier series. We find that the empirical difference in error between the lattices constructed using $cal{P}_n^{\ast }$ and $cal{S}_n^{*}$ is marginal. The criterion $cal{S}_n^{*}$ is preferred as it is computationally more efficient and has a proven error bound.

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Algorithms for approximation of functions (65D15)

This page was built for publication: Comparison of Two Search Criteria for Lattice-based Kernel Approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6432012)