Lebesgue-type inequalities in sparse sampling recovery

arXiv2307.04161MaRDI QIDQ6443072FDOQ6443072

Authors: Feng Dai, V. N. Temlyakov 

Publication date: 9 July 2023

Abstract: Recently, it has been discovered that results on universal sampling discretization of the square norm are useful in sparse sampling recovery with error being measured in the square norm. It was established that a simple greedy type algorithm -- Weak Orthogonal Matching Pursuit -- based on good points for universal discretization provides effective recovery in the square norm. In this paper we extend those results by replacing the square norm with other integral norms. In this case we need to conduct our analysis in a Banach space rather than in a Hilbert space, making the techniques more involved. In particular, we establish that a greedy type algorithm -- Weak Chebyshev Greedy Algorithm -- based on good points for the $L_p$-universal discretization provides good recovery in the $L_p$ norm for $2lep<infty$. Furthermore, we discuss the problem of stable recovery and demonstrate its close relationship with sampling discretization.

This page was built for publication: Lebesgue-type inequalities in sparse sampling recovery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6443072)