Optimal sampling for least squares approximation with general dictionaries
<|reference_start|>Optimal sampling for least squares approximation with general dictionaries: We consider the problem of approximating an unknown function in a nonlinear model class from point evaluations. When obtaining these point evaluations is costly, minimising the required sample size becomes crucial. Recently, an increasing focus has been on employing adaptive sampling strategies to achieve this. These strategies are based on linear spaces related to the nonlinear model class, for which the optimal sampling measures are known. However, the resulting optimal sampling measures depend on an orthonormal basis of the linear space, which is known rarely. Consequently, sampling from these measures is challenging in practice. This manuscript presents a sampling strategy that iteratively refines an estimate of the optimal sampling measure by updating it based on previously drawn samples. This strategy can be performed offline and does not require evaluations of the sought function. We establish convergence and illustrate the practical performance through numerical experiments. Comparing the presented approach with standard Monte Carlo sampling demonstrates a significant reduction in the number of samples required to achieve a good estimation of an orthonormal basis.<|reference_end|>
@article{trunschke2024optimal,
    title={Optimal sampling for least squares approximation with general
  dictionaries},
    author={Philipp Trunschke, Anthony Nouy},
    journal={arXiv preprint arXiv:2407.07814},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.07814},
    primaryClass={math.NA cs.NA}
}