Answers are grounded in this paper and cite their sources.
This analysis constructs algorithms achieving optimal convergence rates in function approximation using Gaussian Sobolev spaces, indicating effective computational methods.
This paper studies function approximation in Gaussian Sobolev spaces over the real line and measures the error in a Gaussian-weighted Lᵖ L p -norm. We construct two linear approximation algorithms using n function evaluations that achieve the optimal or almost optimal rate of worst-case convergence in a Gaussian Sobolev space of order α α . The first algorithm is based on scaled trigonometric interpolation and achieves the optimal rate n-α n - α up to a logarithmic factor. This algorithm can be constructed in almost-linear time with the fast Fourier transform. The second algorithm is more complicated, being based on spline smoothing, but attains the optimal rate n-α n - α .
No takes yet. Share an insight, caveat, or question.
Suzuki et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: