방법 비교

	Self-supervised Boosting	자기 지도 학습 기반 그래디언트 부스팅
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2010s–2020s	2020s
창시자	Various researchers (2010s–2020s)	Various researchers (Zhang et al. and others)
유형	Ensemble (self-supervised + boosting)	Ensemble (self-supervised + gradient boosting)
원전	Yarowsky, D. (1995). Unsupervised word sense disambiguation rivaling supervised methods. In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics (pp. 189–196). ACL.	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.
별칭	SSL boosting, self-supervised ensemble boosting, pretext-task boosting, SSL-Boost	SSL gradient boosting, self-supervised boosting, semi-supervised gradient boosting, SSL-GBM
관련	6	5
요약	Self-supervised boosting integrates self-supervised pretext tasks into the boosting framework — covering AdaBoost, gradient boosting, and their modern variants — to leverage large pools of unlabeled data. By first learning feature representations from unlabeled samples and then running sequential weak-learner ensembles on pseudo-labeled data, it achieves competitive accuracy even when ground-truth labels are scarce.	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.