विधियों की तुलना करें

	स्व-पर्यवेक्षित ग्रेडिएंट बूस्टिंग	ग्रेडिएंट बूस्टिंग
क्षेत्र	मशीन अधिगम	मशीन अधिगम
परिवार	Machine learning	Machine learning
उद्भव वर्ष	2020s	2001
प्रवर्तक	Various researchers (Zhang et al. and others)	Friedman, J. H.
प्रकार	Ensemble (self-supervised + gradient boosting)	Ensemble (sequential boosting of decision trees)
मौलिक स्रोत	Zhang, Y., Zhang, J., & Yang, Q. (2022). Self-Supervised Gradient Boosting for Semi-Supervised Learning on Tabular Data. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.
उपनाम	SSL gradient boosting, self-supervised boosting, semi-supervised gradient boosting, SSL-GBM	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
संबंधित	5	5
सारांश	Self-supervised gradient boosting extends the classic gradient boosting framework by incorporating self-supervised pretext tasks to exploit unlabeled data. The model first learns useful feature representations from unannotated samples, then uses those representations to guide the sequential ensemble of weak learners, achieving strong predictive performance even when labeled examples are scarce.	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.