Entropy, universal coding, approximation, and bases properties
Let \({\mathcal E}=\{e_n\}_{n=0}^\infty\) be a Schauder basis of a Banach space \(X\). For \(f=\sum\theta_ie_i \in X\) the linear approximation error is defined by \[ \rho_n(f,{\mathcal E},X)=\left \| \sum_{i=n}^\infty \theta_ie_i \right \| _X , \] and the nonlinear, \(n\)-term, approximation error by \[ \sigma_n(f,{\mathcal E},X)=\inf_h \{\| f-h\| : h=\sum_{i \in \Lambda} \theta_ie_i, \; | \Lambda | \leq n \}. \] For \(0<r,s <\infty\), the space \(B_r^s=B_r^s({\mathcal E},X)\) is defined as the set of all \(f \in X\) for which \[ \left \{ \sum_{n=1}^\infty [n^s\rho_{n-1}(f,{\mathcal E},X)]^r1/n \right \}^{1/r}:=\| f\| _{B_r^s({\mathcal E},X)}<\infty , \] with the usual modification for \(r=\infty\). The space \(A_r^s=A_r^s({\mathcal E},X)\) is defined similarly but with \(\sigma_n(f,{\mathcal E},X)\) instead of \(\rho_n(f,{\mathcal E},X)\). The authors establish some metric entropy results assuming that the normalized basis \({\mathcal E}\) is quasi-greedy and verifies Temlyakov's \(p\)-property for some \(p>0\). They prove that the \(\varepsilon\)-entropy in \(X\) of the unit ball \(U_r^s\) of the space \(B_r^s\) is \(\asymp \varepsilon ^{-1/s}\) while for \(0<\delta<s\) the \(\varepsilon\)-entropy of the intersection of \(U_r^\delta\) with the unit ball \(V_r^s\) of the spase \(A_r^s\) is \(\asymp \varepsilon ^{-1/s}\log(1/\varepsilon).\) Thus the metric entropy distinguishes between linear and nonlinear approximation. The lower bounds for \(\varepsilon\)-entropy are obtained using estimates for large deviations in binomial and hypergeometric ditributions. The upper bounds are based on some special universal coding. Extending and refining Donoho's results for Hilbert spaces, the authors prove that under certain conditions spaces \(A_\infty^r\) are characterized by the metric entropy behavior. The last section of the paper concerns applications to wavelets in \(L_p\).
- On the representation of smooth functions on the sphere using finitely many bits
- Properties of discrete uncertainty spaces. Refinement of the basic coding theorem
- Restricted non-linear approximation in sequence spaces and applications to wavelet bases and interpolation
- Spaces of Besov-Sobolev type and a problem on nonlinear approximation
- Best \(m\)-term approximation and Lizorkin-Triebel spaces
- Greedy approximation with regard to non-greedy bases
- Wavelets, Orlicz spaces, and greedy bases
- Simultaneous approximation by greedy algorithms
- Results on non-linear approximation for wavelet bases in weighted function spaces
- Entropy and Source Coding for Integer-Dimensional Singular Random Variables
- Encoding Tasks and Rényi Entropy
- Democracy of shearlet frames with applications
- Entropy encoding, Hilbert space, and Karhunen-Loève transforms
- Replicant compression coding in Besov spaces
- Restricted thresholding: recovering smoothness and preserving edges
- scientific article; zbMATH DE number 6280500 (Why is no real title available?)
- scientific article; zbMATH DE number 5208524 (Why is no real title available?)
- Entropy preservation under Markov coding.
- Democracy functions and optimal embeddings for approximation spaces
- Convergence rates of posterior distributions for Brownian semimartingale models
- Orthonormal bases for \(\alpha\)-modulation spaces
This page was built for publication: Entropy, universal coding, approximation, and bases properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879237)
