Compară metode

	Gradient Boosting Regularizat	Pădure Aleatorie Regularizată
Domeniu	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning
Anul apariției	2001 (gradient boosting); 2016 (explicit L1/L2 regularization in XGBoost)	2012
Autorul original	Chen, T. & Guestrin, C. (building on Friedman, J. H.)	Deng, H. & Runger, G.
Tip	Regularized ensemble (additive tree model)	Regularized ensemble (penalized feature selection in trees)
Sursa seminală	Chen, T. & Guestrin, C. (2016). XGBoost: A scalable tree boosting system. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 785–794.	Deng, H., & Runger, G. (2012). Feature selection via regularized trees. Proceedings of the 2012 International Joint Conference on Neural Networks (IJCNN), IEEE, pp. 1–8.
Denumiri alternative	penalized gradient boosting, shrinkage-regularized boosting, XGBoost-style regularization, L1/L2 gradient boosting	RRF, Guided Regularized Random Forest, GRRF, regularized tree ensemble
Înrudite	6	5
Rezumat	Regularized gradient boosting extends the classic additive tree ensemble (Friedman 2001) by embedding L1 and L2 penalty terms directly into the training objective, along with a complexity penalty on tree size. Popularized by XGBoost (Chen & Guestrin 2016), this framework reduces overfitting and improves generalization compared to unpenalized boosting, while retaining the method's characteristic accuracy on tabular data.	Regularized Random Forest (RRF), introduced by Deng and Runger in 2012, extends the standard Random Forest by adding a penalty that discourages splits on features not already used in the ensemble. This built-in regularization produces sparser, less redundant feature subsets, making the model especially valuable when feature selection is as important as predictive accuracy.