Kernel-based L₂-boosting with structure constraints
From MaRDI portal
Kernel-based \(L 2\)-boosting with structure constraints
Cites work
- A distribution-free theory of nonparametric regression
- An $L_{2}$-Boosting Algorithm for Estimation of a Regression Function
- Analysis of regularized Nyström subsampling for regression functions of low smoothness
- Analyzing the discrepancy principle for kernelized spectral filter learning algorithms
- Approximation and learning by greedy algorithms
- Balancing principle in supervised learning for a general regularization scheme
- Boosted kernel ridge regression: optimal learning rates and early stopping
- Boosting a weak learning algorithm by majority
- Boosting methods for regression
- Boosting with early stopping: convergence and consistency
- Boosting With theL2Loss
- Characterizing \(L_{2}\)Boosting
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Convergence rates of kernel conjugate gradient for random design regression
- Cross-validation based adaptation for regularization operators in learning theory
- Distributed kernel-based gradient descent algorithms
- Distributed learning with regularized least squares
- Distributed semi-supervised learning with kernel ridge regression
- Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
- Early stopping and non-parametric regression: an optimal data-dependent stopping rule
- Early Stopping for Kernel Boosting Algorithms: A General Analysis With Localized Complexities
- Forward stagewise regression and the monotone lasso
- Greedy approximation in convex optimization
- Greedy function approximation: A gradient boosting machine.
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- Kernelized elastic net regularization: generalization bounds, and sparse recovery
- Learning Rates of lq Coefficient Regularization Learning with Gaussian Kernel
- Learning Theory
- Learning theory estimates for coefficient-based regularized regression
- Learning theory of distributed regression with bias corrected regularization kernel network
- Learning theory of distributed spectral algorithms
- Learning with coefficient-based regularization and ^1-penalty
- Least angle regression. (With discussion)
- Lower bounds for the rate of convergence of greedy algorithms
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Mercer's theorem on general domains: on the interaction between measures, kernels, and RKHSs
- On early stopping in gradient descent learning
- On regularization algorithms in learning theory
- Optimal learning rates for kernel partial least squares
- Optimal learning rates for localized SVMs
- Optimal rates for the regularized least-squares algorithm
- Regularization and Variable Selection Via the Elastic Net
- Regularization networks and support vector machines
- Relaxation in greedy approximation
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Revisiting the Nyström method for improved large-scale machine learning
- Some remarks on greedy algorithms
- Some theory for generalized boosting algorithms
- Spectral Algorithms for Supervised Learning
- Support Vector Machines
- The elements of statistical learning. Data mining, inference, and prediction
- The rate of convergence of AdaBoost
- Thresholded spectral algorithms for sparse approximations
- Trading accuracy for sparsity in optimization problems with sparsity constraints
This page was built for publication: Kernel-based \(L_2\)-boosting with structure constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7308406)
