{"url":"/sota/few-shot-learning-on-mini-imagenet-5-shot","task":{"name":"Few-Shot Learning","url":"/task/few-shot-learning","note":null},"dataset":{"name":"Mini-ImageNet - 5-Shot Learning","url":"/dataset/mini-imagenet"},"category":"Computer Vision","categories":["Audio","Computer Vision","Methodology","Natural Language Processing"],"category_note":null,"description":"**Few-Shot Learning** is an example of meta-learning, where a learner is trained on several related tasks, during the meta-training phase, so that it can generalize well to unseen (but related) tasks with just few examples, during the meta-testing phase. An effective approach to the Few-Shot Learning problem is to learn a common representation for various tasks and train task specific classifiers on top of this representation.\n\n\n<span class=\"description-source\">Source: [Penalty Method for Inversion-Free Deep Bilevel Optimization ](https://arxiv.org/abs/1911.03432)</span>","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":2,"rows_with_paper_page":2,"rows_dated":2,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"BGNN","metrics":{"Accuracy":"92.7%"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"TIM-GD","metrics":{"Accuracy":"87.4%"},"uses_additional_data":false,"paper_date":"2020-08-25","paper":"/paper/transductive-information-maximization-for-few","paper_url":"https://arxiv.org/abs/2008.11297v3","paper_title":"Transductive Information Maximization For Few-Shot Learning","code":"https://github.com/sicara/easy-few-shot-learning","n_code_links":2,"syntology":{"n_ran":4,"n_unverified":6,"n_samples":10,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"UNEM-Gaussian","metrics":{"Accuracy":"66.4%"},"uses_additional_data":false,"paper_date":"2024-12-21","paper":"/paper/unem-unrolled-generalized-em-for-transductive","paper_url":"https://arxiv.org/abs/2412.16739v1","paper_title":"UNEM: UNrolled Generalized EM for Transductive Few-Shot Learning","code":"https://github.com/zhoulong0/unem-transductive","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":1,"rows_with_any_sample_ran":1,"distinct_papers_with_graph_line":1,"distinct_papers_with_any_sample_ran":1,"samples_over_distinct_papers":{"n_ran":4,"n_unverified":6,"n_samples":10,"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":4,"n_unverified":6,"n_samples":10,"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"}}}