Pages that link to "Item:Q556558"

The following pages link to On the rate of convergence of a pure greedy algorithm. (Q556558):

Displaying 10 items.

• On greedy algorithms for dictionaries with bounded cumulative coherence (Q368218) (← links)
• On the rate of convergence of greedy algorithms. (Q556573) (← links)
• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training (Q1192997) (← links)
• Two lower estimates in greedy approximation (Q1423641) (← links)
• A criterion for convergence of weak greedy algorithms (Q1610211) (← links)
• Some remarks on greedy algorithms (Q1923887) (← links)
• Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms (Q1929788) (← links)
• On convergence of weak greedy algorithms (Q2783079) (← links)
• Lower bounds for the rate of convergence of greedy algorithms (Q3405544) (← links)
• Optimality of the rescaled pure greedy learning algorithms (Q5880599) (← links)