Boosted optimal weighted least-squares
C\'ecile Haberstich, Anthony Nouy, Guillaume Perrin

TL;DR
This paper introduces a boosted weighted least-squares method that adaptively samples and resamples points to ensure stable, near-optimal function approximation with fewer evaluations, especially when function evaluations are costly.
Contribution
The paper proposes a novel boosted sampling approach for weighted least-squares that guarantees stability with minimal samples, improving efficiency over traditional methods.
Findings
Ensures almost sure stability with sample size close to the dimension m
Achieves quasi-optimal approximation properties
Validated through numerical experiments comparing favorably to existing methods
Abstract
This paper is concerned with the approximation of a function in a given approximation space of dimension from evaluations of the function at suitably chosen points. The aim is to construct an approximation of in which yields an error close to the best approximation error in and using as few evaluations as possible. Classical least-squares regression, which defines a projection in from random points, usually requires a large to guarantee a stable approximation and an error close to the best approximation error. This is a major drawback for applications where is expensive to evaluate. One remedy is to use a weighted least squares projection using samples drawn from a properly selected distribution. In this paper, we introduce a boosted weighted least-squares method which allows to ensure almost surely the stability of the weighted…
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.
