Vector greedy algorithms
DOI10.1016/S0885-064X(03)00026-8zbMATH Open1234.41024MaRDI QIDQ652444FDOQ652444
Authors: Adam Lutoborski, V. N. Temlyakov 
Publication date: 14 December 2011
Published in: Journal of Complexity (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 5024023
- Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
- Realizability of greedy algorithms
- Weak greedy algorithms
- On convergence of weak greedy algorithms
- Convergence of orthogonal greedy algorithm with errors in projectors
- Two lower estimates in greedy approximation
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Projection greedy algorithm
- Approximate weak greedy algorithms
General theory of numerical analysis in abstract spaces (65J05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary linear expressions (41A45)
Cites Work
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Universal approximation bounds for superpositions of a sigmoidal function
- Projection pursuit
- Title not available (Why is that?)
- Adaptive greedy approximations
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- The best \(m\)-term approximation and greedy algorithms
- Some remarks on greedy algorithms
- Weak greedy algorithms
- Compression of Wavelet Decompositions
- Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
- Greedy algorithm and \(m\)-term trigonometric approximation
- Nonlinear approximation by trigonometric sums
- Rates of convex approximation in non-Hilbert spaces
- On best \(m\)-term approximations and the entropy of sets in the space \(L^ 1\)
- Unconditional bases are optimal bases for data compression and for statistical estimation
- Asymptotics of the module of a degenerating condenser and some of their applications
- CART and best-ortho-basis: a connection
- Estimate of approximate characteristics for classes of functions with bounded mixed derivative
- Nonlinear approximation in finite-dimensional spaces
- A criterion for convergence of weak greedy algorithms
- Remarks on projection pursuit regression and density estimation
- Title not available (Why is that?)
Cited In (23)
- On the recursive greedy algorithm
- Projection greedy algorithm
- Adaptive greedy approximations
- Approximation on anisotropic Besov classes with mixed norms by standard information
- On a greedy algorithm in the space \(L_p[0,1]\)
- Adaptive martingale approximations
- On optimal estimate of the block orthogonal greedy algorithm for g-frames
- Weak greedy algorithms
- Title not available (Why is that?)
- Example of divergence of a greedy algorithm with respect to an asymmetric dictionary
- Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
- Super greedy type algorithms
- Simultaneous greedy approximation in Banach spaces
- On rank awareness, thresholding, and MUSIC for joint sparse recovery
- Column subset selection via sparse approximation of SVD
- Greedy approximations
- Conical greedy algorithm
- Simultaneous approximation by greedy algorithms
- Realizability of greedy algorithms
- A counter-example to the general convergence of partially greedy algorithms
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- On greedy algorithms for dictionaries with bounded cumulative coherence
- Variable selection in high-dimensional sparse multiresponse linear regression models
This page was built for publication: Vector greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652444)
