Metric entropy and sparse linear approximation of _q-hulls for 0

DOI10.1016/J.JAT.2012.10.002MaRDI QIDQ1935753zbMATH OpenOpenAlexFDO

Authors Ching-Kang Ing, Yuhong Yang, Fuchang Gao

Publication date 19 February 2013

Published in Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jat.2012.10.002

zbMATH Keywords

accurate approximationlinear approximationmetric entropyoptimal approximation

Mathematics Subject Classification ID

Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Multidimensional problems (41A63) Nonparametric regression and quantile regression (62G08) Linear regression; mixed models (62J05) Learning and adaptive systems in artificial intelligence (68T05)

Review text

Given collections of functions defined on a measurable space, called dictionaries, sparse linear approximations from these to suitable target functions are studied in this paper, in particular, the smallest number of terms needed to pursue the approximation within an \(\ell_q\)-hull. This is considered, for instance, under the condition that the aforementioned elements of the dictionary have finite \(L_p\)-norms; for \(p=2\), a greedy algorithm is studied as a particular example.

Recommendations

• Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness
• Sparse approximation by greedy algorithms
• Nonlinear methods of approximation
• Greedy algorithms with regard to multivariate systems with special structure
• Sparse approximation of individual functions

Cited in

(3)

• Model selection for high-dimensional linear regression with dependent observations
• An inequality for the entropy numbers and its application
• Metric entropy of q-hulls in Banach spaces of type-p

This page was built for publication: Metric entropy and sparse linear approximation of \(\ell_q\)-hulls for \(0<q\leq 1\)

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