Pages that link to "Item:Q1938256"
From MaRDI portal
The following pages link to On the convergence rate of kernel-based sequential greedy regression (Q1938256):
Displaying 7 items.
- An empirical feature-based learning algorithm producing sparse approximations (Q413648) (← links)
- Learning rates of multi-kernel regression by orthogonal greedy algorithm (Q1926541) (← links)
- Analysis of target data-dependent greedy kernel algorithms: convergence rates for \(f\)-, \(f \cdot P\)- and \(f/P\)-greedy (Q2699021) (← 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)
- Optimality of the rescaled pure greedy learning algorithms (Q5880599) (← links)
- Convergence analysis for kernel-regularized online regression associated with an RRKHS (Q6110943) (← links)
