Vector greedy algorithms
From MaRDI portal
Publication:652444
DOI10.1016/S0885-064X(03)00026-8zbMath1234.41024MaRDI QIDQ652444
Adam Lutoborski, Vladimir N. Temlyakov
Publication date: 14 December 2011
Published in: Journal of Complexity (Search for Journal in Brave)
General theory of numerical analysis in abstract spaces (65J05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15) Approximation by arbitrary linear expressions (41A45)
Related Items
CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, Simultaneous greedy approximation in Banach spaces, Approximation on anisotropic Besov classes with mixed norms by standard information, Simultaneous approximation by greedy algorithms, On rank awareness, thresholding, and MUSIC for joint sparse recovery, Adaptive martingale approximations, Column subset selection via sparse approximation of SVD, Variable selection in high-dimensional sparse multiresponse linear regression models
Cites Work
- Unnamed Item
- Unnamed Item
- Projection pursuit
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- The best \(m\)-term approximation and greedy algorithms
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Greedy algorithm and \(m\)-term trigonometric approximation
- Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
- Unconditional bases are optimal bases for data compression and for statistical estimation
- Rates of convex approximation in non-Hilbert spaces
- CART and best-ortho-basis: a connection
- Nonlinear approximation by trigonometric sums
- Nonlinear approximation in finite-dimensional spaces
- A criterion for convergence of weak greedy algorithms
- Asymptotics of the module of a degenerating condenser and some of their applications
- On best \(m\)-term approximations and the entropy of sets in the space \(L^ 1\)
- Estimate of approximate characteristics for classes of functions with bounded mixed derivative
- Some remarks on greedy algorithms
- Weak greedy algorithms
- Remarks on projection pursuit regression and density estimation
- Compression of Wavelet Decompositions
- Universal approximation bounds for superpositions of a sigmoidal function
- Adaptive greedy approximations
