On Randomized Approximation of Scattered Data
Karen Yeressian

TL;DR
This paper introduces a randomized approximation method for scattered data in Hilbert spaces, achieving Monte Carlo error rates without requiring metric structures on the domain or target space.
Contribution
It presents a novel randomized function construction that approximates the unique minimizer of a regularized least squares functional with an expected error decreasing as 1/k.
Findings
Expected error of approximation is O(1/k) for large k.
Method works without metric or measurability assumptions on the domain.
Approximating functions are constructed from Riesz representatives.
Abstract
Let be a set and a real Hilbert space. Let be a real Hilbert space of functions and assume is continuously embedded in the Banach space of bounded functions. For , let comprise our dataset. Let and be the unique global minimizer of the functional \begin{equation*} u(f) = \frac{q}{2}\Vert f\Vert_{H}^{2} + \frac{1-q}{2n}\sum_{i=1}^{n}\Vert f(x_i)-y_i\Vert_{V}^{2}. \end{equation*} For and let be the unique element such that for all . In this paper we show that for each , one has a random function with the structure \begin{equation*} F_{k} = \sum_{h=1}^{N_k} \Lambda_{k, h} \Phi(x_{I_h}, \mathcal{E}_{h}) \end{equation*} (where are Binomially distributed with success…
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
TopicsNumerical methods in inverse problems · Advanced Mathematical Modeling in Engineering · Mathematical Approximation and Integration
