Pages that link to "Item:Q3405544"

The following pages link to Lower bounds for the rate of convergence of greedy algorithms (Q3405544):

Displaying 14 items.

• Rescaled pure greedy algorithm for Hilbert and Banach spaces (Q326773) (← 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)
• Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms (Q1929788) (← 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)
• Weak convergence of a greedy algorithm and the WN-property (Q2699786) (← links)
• On convergence of weak greedy algorithms (Q2783079) (← links)
• Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping (Q6072435) (← 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)