Error Guarantees for Least Squares Approximation with Noisy Samples in Domain Adaptation
Felix Bartel

TL;DR
This paper provides theoretical error guarantees for least squares function approximation under domain adaptation and noisy samples, highlighting the bias-variance trade-off and demonstrating a stable method with quadratic decay.
Contribution
It introduces new bounds for least squares approximation errors in domain adaptation with noisy data, including a stable method for Sobolev space functions with quadratic error decay.
Findings
Error bounds depend on measure mismatch and noise level.
A stable approximation method for Sobolev spaces with quadratic decay.
Numerical experiments confirm theoretical predictions.
Abstract
Given samples of a function in random points drawn with respect to a measure we develop theoretical analysis of the -approximation error. For a parituclar choice of depending on , it is known that the weighted least squares method from finite dimensional function spaces , has the same error as the best approximation in up to a multiplicative constant when given exact samples with logarithmic oversampling. If the source measure and the target measure differ we are in the domain adaptation setting, a subfield of transfer learning. We model the resulting deterioration of the error in our bounds. Further, for noisy samples, our bounds describe the bias-variance trade off depending on the dimension of the approximation space . All results hold…
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
TopicsNon-Destructive Testing Techniques · Climate change and permafrost
