Pages that link to "Item:Q3405544"
From MaRDI portal
The following pages link to Lower bounds for the rate of convergence of greedy algorithms (Q3405544):
Displaying 4 items.
- Rescaled pure greedy algorithm for Hilbert and Banach spaces (Q326773) (← 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)
