Asymptotic analysis in multivariate average case approximation with Gaussian kernels
A. A. Khartov, I. A. Limar

TL;DR
This paper analyzes the asymptotic behavior of the average case approximation complexity for high-dimensional tensor product Gaussian kernel-based random fields, providing criteria for growth and boundedness as dimension increases.
Contribution
It establishes necessary and sufficient conditions for the asymptotic growth of approximation complexity in high dimensions, linking it to quantiles of self-decomposable distributions.
Findings
Criteria for boundedness of complexity with increasing dimension
Asymptotic formulas involving quantiles of self-decomposable distributions
Application to approximation problems with Gaussian kernels
Abstract
We consider tensor product random fields , , whose covariance funtions are Gaussian kernels. The average case approximation complexity is defined as the minimal number of evaluations of arbitrary linear functionals needed to approximate , with relative -average error not exceeding a given threshold . We investigate the growth of for arbitrary fixed and . Namely, we find criteria of boundedness for on and of tending , , for any fixed . In the latter case we obtain necessary and sufficient conditions for the following logarithmic asymptotics \begin{eqnarray*} \ln n^{Y_d}(\varepsilon)= a_d+q(\varepsilon)b_d+o(b_d),\quad d\to\infty, \end{eqnarray*} with any…
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 · Scientific Research and Discoveries · Markov Chains and Monte Carlo Methods
