Self-supervised Random Forest
Self-supervised Random Forest (SSL-RF) extends the classic random forest to settings where labeled examples are scarce. The forest is first trained using automatically generated pseudo-labels derived from a self-supervised pretext task — such as predicting data transformations or masked features — and then refined on whatever true labels are available, marrying the label-efficiency of self-supervised learning with the robustness of ensemble trees.
Source record
Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.
- Lefortier, D., Chitta, K., & Agrawal, P. (2022). Self-supervised random forests. arXiv:2204.01430. · URL
- Criminisi, A., Shotton, J., & Konukoglu, E. (2012). Decision forests: A unified framework for classification, regression, density estimation, manifold learning and semi-supervised learning. Foundations and Trends in Computer Graphics and Vision, 7(2–3), 81–227. · DOI 10.1561/0600000035
Curated claims
Claims persisted in the evidence ledger, each with its own assessment.
This view does not invent a claim assessment when the ledger has none.
Related methods
Generated from the method graph and shown as machine-suggested relations — no evidence claim is inferred.