Average case tractability of multivariate approximation with Gevrey type kernels
Wanting Lu, Heping Wang

TL;DR
This paper studies the average case complexity of multivariate approximation problems using Gevrey kernels, providing conditions for different tractability notions based on problem parameters.
Contribution
It offers a comprehensive analysis of algebraic and exponential tractability for multivariate approximation with Gevrey kernels, including necessary and sufficient conditions.
Findings
Conditions for algebraic tractability derived
Conditions for exponential tractability established
Analysis based on covariance kernel parameters
Abstract
We consider multivariate approximation problems in the average case setting with a zero mean Gaussian measure whose covariance kernel is a periodic Gevrey kernel. We investigate various notions of algebraic tractability and exponential tractability, and obtain necessary and sufficient conditions in terms of the parameters of the problem.
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 · Statistical and numerical algorithms · Approximation Theory and Sequence Spaces
