Lower bounds for multivariate approximation by affine-invariant dictionaries

DOI10.1109/18.923738MaRDI QIDQ4544591zbMATH OpenOpenAlexFDO

Authors Ron Meir, Vitaly Maiorov

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/14767d7a7ac09c91940bc941cb615ef15879c589

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Recommendations

• scientific article; zbMATH DE number 2190144
• Lower bounds for n-term approximations.
• On best m-term approximations and the entropy of sets in the space L^ 1
• Non-linear approximation of functions with mixed smoothness by sets of finite pseudo-dimension
• Greedy algorithms with regard to multivariate systems with special structure

Cited in

(9)

• Lower bounds for Haar projections: deterministic examples
• The best accuracy of reconstruction of finitely smooth functions from their values at a given number of points
• Almost optimal estimates for approximation and learning by radial basis function networks
• Linear and nonlinear approximation of spherical radial basis function networks
• Some problems in the theory of ridge functions
• Multivariate approximation by translates of the Korobov function on Smolyak grids
• Approximation by neural networks and learning theory
• Pseudo-dimension and entropy of manifolds formed by affine-invariant dictionary
• On lower bounds in radial basis approximation

This page was built for publication: Lower bounds for multivariate approximation by affine-invariant dictionaries

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