Compară metode

	Boostare auto-supervizată	Învățare activă prin boosting
Domeniu	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning
Anul apariției	2010s–2020s	1998
Autorul original	Various researchers (2010s–2020s)	Abe, N. & Mamitsuka, H.
Tip	Ensemble (self-supervised + boosting)	Hybrid active-learning ensemble
Sursa seminală	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.	Abe, N. & Mamitsuka, H. (1998). Query Learning Strategies Using Boosting and Bagging. Proceedings of the 15th International Conference on Machine Learning (ICML 1998), pp. 1–9. Morgan Kaufmann.
Denumiri alternative	SSL boosting, self-supervised ensemble boosting, pretext-task boosting, SSL-Boost	boosting-based active learning, query learning with boosting, active boosting, ensemble active learning
Înrudite	6	4
Rezumat	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.	Active Learning Boosting combines the query-driven label acquisition of active learning with the weighted-ensemble logic of boosting algorithms such as AdaBoost. The model iteratively selects the most informative unlabeled examples to annotate — guided by the disagreement or uncertainty within the boosting ensemble — and retrains after each new label, achieving high accuracy with far fewer labeled examples than passive learning.