Sparse approximation of individual functions

11/06/2019
by   L. Burusheva, et al.
0

Results on two different settings of asymptotic behavior of approximation characteristics of individual functions are presented. First, we discuss the following classical question for sparse approximation. Is it true that for any individual function from a given function class its sequence of errors of best sparse approximations with respect to a given dictionary decays faster than the corresponding supremum over the function class? Second, we discuss sparse approximation by greedy type algorithms. We show that for any individual function from a given class we can improve the upper bound on the rate of convergence of the error of approximation by a greedy algorithm if we use some information from the previous iterations of the algorithm. We call bounds of this type a posteriori bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/05/2015

Sparse approximation by greedy algorithms

It is a survey on recent results in constructive sparse approximation. T...
research
01/15/2020

Biorthogonal greedy algorithms in convex optimization

The study of greedy approximation in the context of convex optimization ...
research
04/19/2023

Rate of convergence of Thresholding Greedy Algorithms

The rate of convergence of the classical Thresholding Greedy Algorithm w...
research
12/15/2020

Approximation by linear combinations of translates of a single function

We study approximation by arbitrary linear combinations of n translates ...
research
03/01/2015

Constructive sparse trigonometric approximation for functions with small mixed smoothness

The paper gives a constructive method, based on greedy algorithms, that ...
research
02/28/2016

On the entropy numbers of the mixed smoothness function classes

Behavior of the entropy numbers of classes of multivariate functions wit...
research
05/14/2018

Copulas for Streaming Data

Empirical copula functions can be used to model the dependence structure...

Please sign up or login with your details

Forgot password? Click here to reset