방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| Self-supervised Boosting× | 부스팅× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | 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. link ↗ | 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. DOI ↗ |
| 별칭 | 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. |
| ScholarGate데이터셋 ↗ |
|
|