Asymptotic analysis in multivariate average case approximation with Gaussian kernels

Abstract

We consider tensor product random fields Yd, d∈N, whose covariance funtions are Gaussian kernels. The average case approximation complexity nYd() is defined as the minimal number of evaluations of arbitrary linear functionals needed to approximate Yd, with relative 2-average error not exceeding a given threshold ∈(0,1). We investigate the growth of nYd() for arbitrary fixed ∈(0,1) and d∞. Namely, we find criteria of boundedness for nYd() on d and of tending nYd()∞, d∞, for any fixed ∈(0,1). In the latter case we obtain necessary and sufficient conditions for the following logarithmic asymptotics eqnarray* nYd()= ad+q()bd+o(bd), d∞, eqnarray* with any ∈(0,1). Here q (0,1) is a non-decreasing function, (ad)d∈N is a sequence and (bd)d∈N is a positive sequence such that bd∞, d∞. We show that only special quantiles of self-decomposable distribution functions appear as functions q in a given asymptotics. These general results apply to nYd() under particular assumptions on the length scale parameters.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…