Optimal sampling for least squares approximation with general dictionaries
Philipp Trunschke, Anthony Nouy

TL;DR
This paper introduces a practical offline method for estimating orthonormal bases to improve importance sampling in least squares approximation, reducing sample complexity especially in nonlinear approximation contexts.
Contribution
It presents a novel offline strategy for estimating orthonormal bases that does not require function evaluations, enhancing importance sampling efficiency in nonlinear approximation.
Findings
Significant reduction in sample size compared to Monte Carlo methods
Convergence established for the proposed basis estimation strategy
Numerical experiments demonstrate practical effectiveness
Abstract
We consider the problem of approximating an unknown function from point evaluations. This problem is a crucial subproblem in many modern (nonlinear) approximation schemes. When obtaining these point evaluations is costly, minimising the required sample size becomes crucial. Recently, an increasing focus has been on employing importance sampling strategies to achieve this. For the approximation in a -dimensional linear space, an optimal i.i.d. sampling measure achieves a sampling complexity of . However, the corresponding sampling measure depends on an orthonormal basis of the linear space, which is rarely known (in particular in the context of nonlinear approximation where the linear space arises as a local linearisation of a nonlinear model class like neural networks or tensor networks). Consequently, sampling from these measures is challenging in practice.…
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
TopicsScientific Measurement and Uncertainty Evaluation · Flow Measurement and Analysis · Control Systems and Identification
