Learning rates of multi-kernel regression by orthogonal greedy algorithm
From MaRDI portal
Recommendations
Cited in
(12)- Reproducing property of bounded linear operators and kernel regularized least square regressions
- Optimality of the rescaled pure greedy learning algorithms
- Penalized empirical relaxed greedy algorithm for fixed design Gaussian regression
- A forward-backward greedy approach for sparse multiscale learning
- Reprint of: A forward-backward greedy approach for sparse multiscale learning
- On the convergence rate of kernel-based sequential greedy regression
- Learning rates of multitask kernel methods
- Learning rates of multi-kernel regularized regression
- Randomized multi-scale kernels learning with sparsity constraint regularization for regression
- scientific article; zbMATH DE number 1931862 (Why is no real title available?)
- Prediction-based termination rule for greedy learning with massive data
- Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping
This page was built for publication: Learning rates of multi-kernel regression by orthogonal greedy algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1926541)