Some theory for generalized boosting algorithms
From MaRDI portal
Recommendations
Cited in
(28)- Covariance regularization by thresholding
- A stochastic approximation view of boosting
- Population theory for boosting ensembles.
- A new accelerated proximal boosting machine with convergence rate \(O(1/t^2)\)
- A precise high-dimensional asymptotic theory for boosting and minimum-\(\ell_1\)-norm interpolated classifiers
- Aggregation of estimators and stochastic optimization
- Accelerated gradient boosting
- Regularized estimation of large covariance matrices
- Boosting with early stopping: convergence and consistency
- Boosting. Foundations and algorithms.
- Splines for financial volatility
- scientific article; zbMATH DE number 2089370 (Why is no real title available?)
- A note on implementations of the boosting algorithm and heterogeneous multiscale methods
- Further results on the margin explanation of boosting: new algorithm and experiments
- Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms
- A Bayesian boosting theorem
- Randomized Gradient Boosting Machine
- Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications
- Computational Science - ICCS 2004
- Optimization by Gradient Boosting
- Stochastic boosting algorithms
- Stochastic boosting algorithms
- \(L_{2}\) boosting in kernel regression
- Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping
- Explainable subgradient tree boosting for prescriptive analytics in operations management
- A large-sample theory for infinitesimal gradient boosting
- Kernel-based L₂-boosting with structure constraints
- Regularization in statistics
This page was built for publication: Some theory for generalized boosting algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093367)
