On Randomized Approximation of Scattered Data

Abstract

Let A be a set and V a real Hilbert space. Let H be a real Hilbert space of functions f:A V and assume H is continuously embedded in the Banach space of bounded functions. For i=1,·s,n, let (xi,yi)∈ A× V comprise our dataset. Let 0<q<1 and f*∈ H be the unique global minimizer of the functional equation* u(f) = q2 fH2 + 1-q2nΣi=1n f(xi)-yiV2. equation* For x∈ A and v∈ V let (x,v)∈ H be the unique element such that ((x,v),f)H=(f(x),v)V for all f∈ H. In this paper we show that for each k∈N, k≥ 2 one has a random function Fk∈ H with the structure equation* Fk = Σh=1Nk k, h (xIh, Eh) equation* (where 0≤ Nk≤ k-1 are Binomially distributed with success probability 1-q, k, h∈R are random coefficients, 1≤ Ih≤ n are independent and uniformly distributed and Eh∈ V are random vectors) such that asymptotically for large k we have equation* E[ Fk-f*H2 ] = O(1k). equation* Thus we achieve the Monte Carlo type error estimate with no metric or measurability structure on A, possibly infinite dimensional V and the ingredients of approximating functions are just the Riesz representatives (x,v)∈ H. We obtain this result by considering the stochastic gradient descent sequence in the Hilbert space H to minimize the functional u.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…