Compară metode

	Gradient Boosting cu Învățare Activă	Gradient Boosting
Domeniu	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning
Anul apariției	2000s–2010s	2001
Autorul original	Settles, B. (active learning); Friedman, J. H. (gradient boosting); combined framework developed by the research community	Friedman, J. H.
Tip	Active learning framework with gradient boosting base learner	Ensemble (sequential boosting of decision trees)
Sursa seminală	Settles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin–Madison.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.
Denumiri alternative	AL-GBM, gradient boosting active learner, active gradient boosting, active learning with boosted trees	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Înrudite	4	5
Rezumat	Active Learning Gradient Boosting combines the powerful predictive accuracy of gradient boosted trees with an active learning loop that selects the most informative unlabeled examples for human annotation. By querying only the instances the model is most uncertain about, the method achieves high accuracy with far fewer labeled examples than passive supervised learning.	Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.