Transformed rank-1 lattices for high-dimensional approximation
Robert Nasdala, Daniel Potts

TL;DR
This paper extends Fourier approximation techniques for multivariate functions on the torus to weighted spaces via a change of variables, using transformed rank-1 lattices and dimension-incremental methods, with numerical validation.
Contribution
It introduces a new approach combining transformations and rank-1 lattices for high-dimensional Fourier approximation in weighted spaces, with theoretical and numerical validation.
Findings
The method achieves accurate approximation for high-dimensional functions.
Numerical tests confirm the theoretical error bounds.
Dimension-incremental methods effectively handle sparse frequency sets.
Abstract
This paper describes an extension of Fourier approximation methods for multivariate functions defined on the torus to functions in a weighted Hilbert space via a multivariate change of variables . We establish sufficient conditions on and such that the composition of a function in such a weighted Hilbert space with yields a function in the Sobolev space of functions on the torus with mixed smoothness of natural order . In this approach we adapt algorithms for the evaluation and reconstruction of multivariate trigonometric polynomials on the torus based on single and multiple reconstructing rank- lattices. Since in applications it may be difficult to choose a related function space, we…
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.
