Pages that link to "Item:Q556573"

The following pages link to On the rate of convergence of greedy algorithms. (Q556573):

Displaying 16 items.

• Rescaled pure greedy algorithm for Hilbert and Banach spaces (Q326773) (← links)
• Convergence of orthogonal greedy algorithm with errors in projectors (Q355338) (← links)
• On greedy algorithms for dictionaries with bounded cumulative coherence (Q368218) (← links)
• On the rate of convergence of a pure greedy algorithm. (Q556558) (← links)
• Two lower estimates in greedy approximation (Q1423641) (← links)
• A criterion for convergence of weak greedy algorithms (Q1610211) (← links)
• On the von Neumann alternating algorithm in Hilbert space (Q1822209) (← links)
• Some remarks on greedy algorithms (Q1923887) (← links)
• Uniform approximation rates and metric entropy of shallow neural networks (Q2157931) (← links)
• Alternating projections, remotest projections, and greedy approximation (Q2209301) (← links)
• The rate of convergence of weak greedy approximations over orthogonal dictionaries (Q2399411) (← links)
• On convergence of weak greedy algorithms (Q2783079) (← links)
• Lower bounds for the rate of convergence of greedy algorithms (Q3405544) (← links)
• Characterization of the variation spaces corresponding to shallow neural networks (Q6101230) (← links)
• A convergence rate estimate for remotest projections on three subspaces (Q6148186) (← links)
• Entropy-based convergence rates of greedy algorithms (Q6551364) (← links)