Abstract
We study Lq-approximation and integration for functions from
the Sobolev space W^s_p(Ω) and compare optimal randomized (Monte Carlo) algorithms with algorithms that can only use identically distributed (iid) sample points, uniformly distributed on the domain. The main result is that we obtain the same optimal rate of convergence if we restrict to iid sampling, a common assumption in learning and uncertainty quantification. The only exception is when p=q=∞, where a logarithmic loss cannot be avoided.
| Original language | English |
|---|---|
| Pages (from-to) | 2715–2738 |
| Number of pages | 24 |
| Journal | Mathematics of Computation |
| Volume | 91 |
| Issue number | 338 |
| DOIs | |
| Publication status | Published - Nov 2022 |
Fields of science
- 101002 Analysis
- 101032 Functional analysis
JKU Focus areas
- Digital Transformation