مقایسهٔ روش‌ها

	تقویت خود نظارتی	بوستینگ
حوزه	یادگیری ماشین	یادگیری ماشین
خانواده	Machine learning	Machine learning
سال پیدایش	2010s–2020s	1990–1997
پدیدآور	Various researchers (2010s–2020s)	Schapire, R. E.; Freund, Y.
نوع	Ensemble (self-supervised + boosting)	Sequential ensemble (iterative reweighting)
منبع بنیادین	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.	Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139.
نام‌های دیگر	SSL boosting, self-supervised ensemble boosting, pretext-task boosting, SSL-Boost	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
مرتبط	6	6
خلاصه	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.	Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.