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

From MaRDI portal




Abstract: We study approximation properties of sequences of centered random elements Xd, dinmathbbN, 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(varepsilon) 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 varepsilonin(0,1). In the paper we investigate nXd(varepsilon) for arbitrary fixed varepsilonin(0,1) and doinfty. Namely, we find criteria of (un)boundedness for nXd(varepsilon) on d and of tending nXd(varepsilon)oinfty, doinfty, for any fixed varepsilonin(0,1). In the latter case we obtain necessary and sufficient conditions for the following logarithmic asymptotics �egin{eqnarray*} ln n^{X_d}(varepsilon)= a_d+q(varepsilon)b_d+o(b_d),quad d oinfty, end{eqnarray*} at continuity points of a non-decreasing function qcolon(0,1)omathbbR. Here (ad)dinmathbbN is a sequence and (bd)dinmathbbN is a positive sequence such that bdoinfty, doinfty. 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.



Cites work







This page was built for publication: Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements

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