On the rate of convergence of greedy algorithms.
From MaRDI portal
(Redirected from Publication:556573)
Recommendations
Cited in
(17)- A criterion for convergence of weak greedy algorithms
- Rate of convergence of thresholding greedy algorithms
- Greedy expansions in Hilbert spaces
- A convergence rate estimate for remotest projections on three subspaces
- Lower bounds for the rate of convergence of greedy algorithms
- On the rate of convergence of a pure greedy algorithm.
- Two lower estimates in greedy approximation
- Alternating projections, remotest projections, and greedy approximation
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Uniform approximation rates and metric entropy of shallow neural networks
- On the von Neumann alternating algorithm in Hilbert space
- The rate of convergence of weak greedy approximations over orthogonal dictionaries
- Convergence of orthogonal greedy algorithm with errors in projectors
- On convergence of weak greedy algorithms
- On greedy algorithms for dictionaries with bounded cumulative coherence
- Characterization of the variation spaces corresponding to shallow neural networks
- Entropy-based convergence rates of greedy algorithms
This page was built for publication: On the rate of convergence of greedy algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q556573)
