Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements

Abstract

We study approximation properties of sequences of centered random elements Xd, d∈ N, with values in separable Hilbert spaces. We focus on sequences of tensor product-type and, in particular, degree-type random elements, which have covariance operators of corresponding tensor form. The average case approximation complexity nXd() is defined as the minimal number of continuous linear functionals that is needed to approximate Xd with relative 2-average error not exceeding a given threshold ∈(0,1). In the paper we investigate nXd() for arbitrary fixed ∈(0,1) and d∞. Namely, we find criteria of (un)boundedness for nXd() on d and of tending nXd()∞, d∞, for any fixed ∈(0,1). In the latter case we obtain necessary and sufficient conditions for the following logarithmic asymptotics eqnarray* nXd()= ad+q()bd+o(bd), d∞, eqnarray* at continuity points of a non-decreasing function q (0,1) R. Here (ad)d∈ N is a sequence and (bd)d∈ N is a positive sequence such that bd∞, d∞. Under rather weak assumptions, we show that for tensor product-type random elements only special quantiles of self-decomposable or, in particular, stable (for tensor degrees) probability distributions appear as functions q in the asymptotics. We apply our results to the tensor products of the Euler integrated processes with a given variation of smoothness parameters and to the tensor degrees of random elements with regularly varying eigenvalues of covariance operator.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…