Pages that link to "Item:Q1926541"
From MaRDI portal
The following pages link to Learning rates of multi-kernel regression by orthogonal greedy algorithm (Q1926541):
Displaying 11 items.
- Learning rates of multi-kernel regularized regression (Q974504) (← links)
- On the convergence rate of kernel-based sequential greedy regression (Q1938256) (← links)
- A forward-backward greedy approach for sparse multiscale learning (Q2083098) (← links)
- Reprint of: A forward-backward greedy approach for sparse multiscale learning (Q2679340) (← links)
- Prediction-based termination rule for greedy learning with massive data (Q2796884) (← links)
- Penalized empirical relaxed greedy algorithm for fixed design Gaussian regression (Q2818315) (← links)
- (Q4709237) (← links)
- Randomized multi-scale kernels learning with sparsity constraint regularization for regression (Q5204655) (← links)
- Optimality of the rescaled pure greedy learning algorithms (Q5880599) (← links)
- Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping (Q6072435) (← links)
- Reproducing property of bounded linear operators and kernel regularized least square regressions (Q6591721) (← links)
