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

TL;DR
This paper analyzes the asymptotic behavior of the average case approximation complexity for high-dimensional Hilbert space valued random elements, providing criteria for boundedness and growth, and characterizing the asymptotics via probability distribution quantiles.
Contribution
It establishes new criteria for the boundedness and asymptotic growth of approximation complexity in high dimensions, with explicit asymptotic formulas involving probability distribution quantiles.
Findings
Criteria for boundedness of approximation complexity
Asymptotic formulas involving quantiles of stable distributions
Application to tensor products of Euler processes and eigenvalue decay
Abstract
We study approximation properties of sequences of centered random elements , , 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 is defined as the minimal number of continuous linear functionals that is needed to approximate with relative -average error not exceeding a given threshold . In the paper we investigate for arbitrary fixed and . Namely, we find criteria of (un)boundedness for on and of tending , , for any fixed . In the latter case we obtain necessary and sufficient…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Quasicrystal Structures and Properties · Digital Image Processing Techniques
