Boosting simple learners
From MaRDI portal
Publication:6566593
DOI10.46298/THEORETICS.23.8MaRDI QIDQ6566593FDOQ6566593
Authors: Noga Alon, Alon Gonen, Elad Hazan, Shay Moran 
Publication date: 3 July 2024
Published in: TheoretiCS (Search for Journal in Brave)
Cites Work
- Greedy function approximation: A gradient boosting machine.
- On the density of families of sets
- Boosting With theL2Loss
- Understanding machine learning. From theory to algorithms
- Stochastic gradient boosting.
- Learnability and the Vapnik-Chervonenkis dimension
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Boosting. Foundations and algorithms.
- A theory of the learnable
- Discrepancy and approximations for bounded VC-dimension
- Density and dimension
- On the Bayes-risk consistency of regularized boosting methods.
- The VC dimension of \(k\)-fold union
- Title not available (Why is that?)
- AdaBoost is consistent
- Process consistency for AdaBoost.
- 10.1162/1532443041424319
- Geometric methods in the study of irregularities of distribution
- Tight upper bounds for the discrepancy of half-spaces
- Title not available (Why is that?)
- Tight lower bounds on the VC-dimension of geometric set systems
- Vapnik–Chervonenkis dimension of axis-parallel cuts
- A theory of multiclass boosting
- Zur Theorie der Gesellschaftsspiele.
This page was built for publication: Boosting simple learners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566593)
