Approximating mixed Hölder functions using random samples
From MaRDI portal
Publication:2286458
Abstract: Suppose is a -mixed H"older function that we sample at points chosen uniformly at random from the unit square. Let the location of these points and the function values be given. If , then we can compute an approximation such that |f - ilde{f} |_{L^2} = mathcal{O}(n^{-alpha} log^{3/2} n), with probability at least , where the implicit constant only depends on the constants and .
Recommendations
- Approximation of piecewise Hölder functions from inexact information
- Learning \(C^2\) and Hölder functions
- Function values are enough for \(L_2\)-approximation
- Approximation and reconstruction of the derivatives of functions satisfying mixed Hölder conditions
- Learning functions of few arbitrary linear parameters in high dimensions
Cites work
- scientific article; zbMATH DE number 3321507 (Why is no real title available?)
- A randomized Kaczmarz algorithm with exponential convergence
- Computation with wavelets in higher dimensions
- Fast discrete Fourier transform on generalized sparse grids
- Randomized Kaczmarz solver for noisy linear systems
- Sampling, denoising and compression of matrices by coherent matrix organization
- Sparse grids
This page was built for publication: Approximating mixed Hölder functions using random samples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286458)