Sparse sampling recovery by greedy algorithms

2023/12/20 by Vladimir Temlyakov, Temlyakov, V. · 1 citation
Engineering · Computer Science · #Sparse and Compressive Sensing Techniques #Image and Signal Denoising Methods #Blind Source Separation Techniques

paper · pdf · doi:10.48550/arxiv.2312.13163

Abstract

In this paper we analyze approximation and recovery properties with respect to systems satisfying universal sampling discretization property and a special incoherence property. We apply a powerful nonlinear approximation method -- the Weak Chebyshev Greedy Algorithm (WCGA). We establish that the WCGA based on good points for the L_p-universal discretization provides good recovery in the L_p norm. For our recovery algorithms we obtain both the Lebesgue-type inequalities for individual functions and the error bounds for special classes of multivariate functions. The main point of the paper is that we combine here two deep and powerful techniques -- Lebesgue-type inequalities for the WCGA and theory of the universal sampling dicretization -- in order to obtain new results in sampling recovery.

Cited by

• Sampling and entropy numbers in the uniform norm

Related

• Lebesgue-type inequalities in sparse sampling recovery
• Sparse sampling recovery in integral norms on some function classes
• Universal discretization and sparse sampling recovery
• Sparse approximation and recovery by greedy algorithms
• Sparse approximation and recovery by greedy algorithms in Banach spaces