Comparer des méthodes

	Apprentissage auto-supervisé par ensemble	Forêt Aléatoire
Domaine	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning
Année d'origine	2020–2021	2001
Auteur d'origine	Multiple contributors (Grill et al., Caron et al., Chen et al.)	Breiman, L.
Type	Ensemble of self-supervised models or objectives	Ensemble (bagging of decision trees)
Source fondatrice	Grill, J.-B., Strub, F., Altché, F., Tallec, C., Richemond, P. H., Buchatskaya, E., Doersch, C., Ávila Pires, B., Guo, Z., Gheshlaghi Azar, M., Piot, B., Kavukcuoglu, K., Munos, R., & Valko, M. (2020). Bootstrap Your Own Latent: A New Approach to Self-Supervised Learning. Advances in Neural Information Processing Systems, 33, 21271–21284.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Alias	ensemble SSL, multi-view self-supervised ensemble, self-supervised ensemble learning, SSL ensemble	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Apparentées	5	4
Résumé	Ensemble Self-supervised Learning combines multiple self-supervised models, objectives, or augmentation views into a unified framework to produce more robust and generalizable representations from unlabeled data. By aggregating diverse self-supervised signals, the ensemble reduces the risk of representation collapse and outperforms single-objective SSL approaches on downstream tasks.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.