{"url":"/sota/self-supervised-learning-on-stl-10","task":{"name":"Self-Supervised Learning","url":"/task/self-supervised-learning","note":null},"dataset":{"name":"STL-10","url":"/dataset/stl-10"},"category":"Computer Vision","categories":["Computer Vision"],"category_note":null,"description":"**Self-Supervised Learning** is proposed for utilizing unlabeled data with the success of supervised learning. Producing a dataset with good labels is expensive, while unlabeled data is being generated all the time. The motivation of Self-Supervised Learning is to make use of the large amount of unlabeled data. The main idea of Self-Supervised Learning is to generate the labels from unlabeled data, according to the structure or characteristics of the data itself, and then train on this unsupervised data in a supervised manner. Self-Supervised Learning is wildly used in representation learning to make a model learn the latent features of the data. This technique is often employed in computer vision, video processing and robot control.\r\n\r\n\r\n<span class=\"description-source\">Source: [Self-supervised Point Set Local Descriptors for Point Cloud Registration ](https://arxiv.org/abs/2003.05199)</span>\r\n\r\nImage source: [LeCun](https://www.youtube.com/watch?v=7I0Qt7GALVk)","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Accuracy":"higher"}},"counts":{"rows":3,"rows_with_code":3,"rows_with_paper_page":3,"rows_dated":3,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"ResNet50","metrics":{"Accuracy":"91.70"},"uses_additional_data":false,"paper_date":"2023-12-04","paper":"/paper/guarding-barlow-twins-against-overfitting","paper_url":"https://arxiv.org/abs/2312.02151v1","paper_title":"Guarding Barlow Twins Against Overfitting with Mixed Samples","code":"https://github.com/wgcban/mix-bt","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"ResNet18","metrics":{"Accuracy":"91.02"},"uses_additional_data":false,"paper_date":"2023-12-04","paper":"/paper/guarding-barlow-twins-against-overfitting","paper_url":"https://arxiv.org/abs/2312.02151v1","paper_title":"Guarding Barlow Twins Against Overfitting with Mixed Samples","code":"https://github.com/wgcban/mix-bt","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"MV-MR","metrics":{"Accuracy":"89.67"},"uses_additional_data":false,"paper_date":"2023-03-21","paper":"/paper/mv-mr-multi-views-and-multi-representations","paper_url":"https://arxiv.org/abs/2303.12130v2","paper_title":"MV-MR: multi-views and multi-representations for self-supervised learning and knowledge distillation","code":"https://github.com/vkinakh/mv-mr","n_code_links":1,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,264 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":0,"rows_with_any_sample_ran":0,"distinct_papers_with_graph_line":0,"distinct_papers_with_any_sample_ran":0,"samples_over_distinct_papers":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}