{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/meta-learning","name":"Meta-Learning","slug":"meta-learning","description_markdown":"Meta-learning is a methodology considered with \"learning to learn\" machine learning algorithms.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks](https://arxiv.org/pdf/1703.03400v3.pdf) )</span>","categories":[{"name":"Computer Vision","url":"/area/computer-vision"},{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":3569,"papers_with_code":1408,"benchmarks":4,"benchmark_tables_in_archive":4,"benchmark_tables_shown":4,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":17,"subtasks":3,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/meta-learning-on-ml10","slug":"meta-learning-on-ml10","dataset":"ML10","dataset_url":null,"rows_in_archive":6,"metrics":["Meta-test success rate","Meta-train success rate","Meta-test success rate (zero-shot)"],"first_row_in_archive_order":{"model":"MAML","paper_title":"Meta-World: A Benchmark and Evaluation for Multi-Task and Meta Reinforcement Learning","paper_url":"/paper/meta-world-a-benchmark-and-evaluation-for","paper_date":"2019-10-24","arxiv_id":"1910.10897","code_links":[{"title":"rlworkgroup/metaworld","url":"https://github.com/rlworkgroup/metaworld"},{"title":"farama-foundation/metaworld","url":"https://github.com/farama-foundation/metaworld"},{"title":"avivne/bilinear-transduction","url":"https://github.com/avivne/bilinear-transduction"},{"title":"uoe-agents/sami","url":"https://github.com/uoe-agents/sami"},{"title":"RamnathKumar181/Adversarial-Learning-Dynamics-in-RL","url":"https://github.com/RamnathKumar181/Adversarial-Learning-Dynamics-in-RL"},{"title":"yiwc/robotics-world","url":"https://github.com/yiwc/robotics-world"},{"title":"mazpie/mime","url":"https://github.com/mazpie/mime"},{"title":"EdNiehues/simulacao-de-projeto-para-mapeamento","url":"https://github.com/EdNiehues/simulacao-de-projeto-para-mapeamento"},{"title":"CAVED123/METAWORLD","url":"https://github.com/CAVED123/METAWORLD"}],"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/meta-world-a-benchmark-and-evaluation-for#ran","syntology_url":"https://syntology.ai/paper/1910.10897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10897"}},"official":{"repos":["rlworkgroup/metaworld"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"leaderboard":"/sota/meta-learning-on-mt50","slug":"meta-learning-on-mt50","dataset":"MT50","dataset_url":null,"rows_in_archive":4,"metrics":["Average Success Rate"],"first_row_in_archive_order":{"model":"SoftModule","paper_title":"Multi-Task Reinforcement Learning with Soft Modularization","paper_url":"/paper/multi-task-reinforcement-learning-with-soft","paper_date":"2020-03-30","arxiv_id":"2003.13661","code_links":[{"title":"RchalYang/Soft-Module","url":"https://github.com/RchalYang/Soft-Module"}],"syntology":null}},{"leaderboard":"/sota/meta-learning-on-ml45","slug":"meta-learning-on-ml45","dataset":"ML45","dataset_url":null,"rows_in_archive":2,"metrics":["Meta-test success rate (zero-shot)","Meta-train success rate"],"first_row_in_archive_order":{"model":"MZ+Recon","paper_title":"Procedural Generalization by Planning with Self-Supervised World Models","paper_url":"/paper/procedural-generalization-by-planning-with-1","paper_date":"2021-11-02","arxiv_id":"2111.01587","code_links":[],"syntology":null}},{"leaderboard":"/sota/meta-learning-on-omniglot-1-shot-20-way","slug":"meta-learning-on-omniglot-1-shot-20-way","dataset":"OMNIGLOT - 1-Shot, 20-way","dataset_url":null,"rows_in_archive":1,"metrics":["% Test Accuracy"],"first_row_in_archive_order":{"model":"Metadrop","paper_title":"Meta Dropout: Learning to Perturb Latent Features for Generalization","paper_url":"/paper/meta-dropout-learning-to-perturb-latent","paper_date":"2020-05-01","arxiv_id":null,"code_links":[{"title":"haebeom-lee/metadrop","url":"https://github.com/haebeom-lee/metadrop"},{"title":"joeljosephjin/metadrop-pytorch","url":"https://github.com/joeljosephjin/metadrop-pytorch"}],"syntology":null}}],"datasets":[{"url":"/dataset/meta-dataset","name":"Meta-Dataset","full_name":"","num_papers_in_archive":128},{"url":"/dataset/m4","name":"M4","full_name":"","num_papers_in_archive":110},{"url":"/dataset/blendedmvs","name":"BlendedMVS","full_name":"","num_papers_in_archive":105},{"url":"/dataset/meta-world-benchmark","name":"Meta-World Benchmark","full_name":"","num_papers_in_archive":73},{"url":"/dataset/tydiqa-goldp","name":"TyDiQA-GoldP","full_name":"TyDiQA-GoldP","num_papers_in_archive":38},{"url":"/dataset/mq2007","name":"MQ2007","full_name":"","num_papers_in_archive":32},{"url":"/dataset/extremeweather","name":"ExtremeWeather","full_name":"","num_papers_in_archive":21},{"url":"/dataset/kuzushiji-49","name":"Kuzushiji-49","full_name":"","num_papers_in_archive":10},{"url":"/dataset/codebrim","name":"CODEBRIM","full_name":"COncrete DEfect BRidge IMage Dataset","num_papers_in_archive":9},{"url":"/dataset/europeana-newspapers","name":"Europeana Newspapers","full_name":"","num_papers_in_archive":5},{"url":"/dataset/figr-8","name":"FIGR-8","full_name":"","num_papers_in_archive":4},{"url":"/dataset/mex","name":"MEx","full_name":"","num_papers_in_archive":3},{"url":"/dataset/prostate-mri-segmentation-dataset","name":"Prostate MRI Segmentation Dataset","full_name":null,"num_papers_in_archive":3},{"url":"/dataset/l-bird","name":"L-Bird","full_name":"Large-Bird","num_papers_in_archive":2},{"url":"/dataset/tom-in-amc","name":"ToM-in-AMC","full_name":"","num_papers_in_archive":2},{"url":"/dataset/chinese-literature-ner-re","name":"Chinese Literature NER RE","full_name":"","num_papers_in_archive":1},{"url":"/dataset/meta-omnium","name":"Meta Omnium","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/few-shot-learning","name":"Few-Shot Learning"},{"url":"/task/sample-probing","name":"Sample Probing"},{"url":"/task/universal-meta-learning","name":"universal meta-learning"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":36,"rows_per_page":100,"shown":100,"of":3569,"of_with_code":1408,"tagged_in_all":3569,"counts":{"archive_papers_tagged":3569,"with_a_code_link":1408,"where_syntology_ran_a_sample":420,"not_listed_spam_title":0,"listed":3569,"listed_where_code_ran":420,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":349,"every_run_a_failure_of_syntologys_instrument":71,"listed_with_a_run_with_no_instrument_failure":349,"listed_every_run_a_failure_of_syntologys_instrument":71,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/model-agnostic-meta-learning-for-fast","slug":"model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","arxiv_id":"1703.03400","repositories_listed":85,"syntology":{"n":154,"n_ran":103,"n_constructed":35,"n_ran_checked":72,"n_instrument":31,"n_unverified":51,"n_honours":6,"n_violates":1,"n_no_contract":65,"n_pointer_only":57,"phrase":"103 ran (of which 35 constructed an object rather than computing a result; 72 with no instrument failure: 6 honoured, 1 violated, 65 with no contract checked; 31 where Syntology's instrument failed) · 51 unverified","sample_list":"/paper/model-agnostic-meta-learning-for-fast#ran","syntology_url":"https://syntology.ai/paper/1703.03400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.03400"}},"official":{"repos":["cbfinn/maml","cbfinn/maml_rl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/prototypical-networks-for-few-shot-learning","slug":"prototypical-networks-for-few-shot-learning","title":"Prototypical Networks for Few-shot Learning","date":"2017-03-15","arxiv_id":"1703.05175","repositories_listed":43,"syntology":{"n":64,"n_ran":50,"n_constructed":14,"n_ran_checked":29,"n_instrument":21,"n_unverified":14,"n_honours":5,"n_violates":0,"n_no_contract":24,"n_pointer_only":19,"phrase":"50 ran (of which 14 constructed an object rather than computing a result; 29 with no instrument failure: 5 honoured, 0 violated, 24 with no contract checked; 21 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/prototypical-networks-for-few-shot-learning#ran","syntology_url":"https://syntology.ai/paper/1703.05175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.05175"}},"official":{"repos":["jakesnell/prototypical-networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/meta-dataset-a-dataset-of-datasets-for","slug":"meta-dataset-a-dataset-of-datasets-for","title":"Meta-Dataset: A Dataset of Datasets for Learning to Learn from Few Examples","date":"2019-03-07","arxiv_id":"1903.03096","repositories_listed":15,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meta-dataset-a-dataset-of-datasets-for#ran","syntology_url":"https://syntology.ai/paper/1903.03096","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03096"}},"official":{"repos":["google-research/meta-dataset"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/on-first-order-meta-learning-algorithms","slug":"on-first-order-meta-learning-algorithms","title":"On First-Order Meta-Learning Algorithms","date":"2018-03-08","arxiv_id":"1803.02999","repositories_listed":13,"syntology":{"n":42,"n_ran":27,"n_constructed":2,"n_ran_checked":9,"n_instrument":18,"n_unverified":15,"n_honours":1,"n_violates":2,"n_no_contract":6,"n_pointer_only":13,"phrase":"27 ran (of which 2 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 2 violated, 6 with no contract checked; 18 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/on-first-order-meta-learning-algorithms#ran","syntology_url":"https://syntology.ai/paper/1803.02999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.02999"}},"official":{"repos":["openai/supervised-reptile"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-to-compare-relation-network-for-few","slug":"learning-to-compare-relation-network-for-few","title":"Learning to Compare: Relation Network for Few-Shot Learning","date":"2017-11-16","arxiv_id":"1711.06025","repositories_listed":13,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-to-compare-relation-network-for-few#ran","syntology_url":"https://syntology.ai/paper/1711.06025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.06025"}},"official":null}},{"url":"/paper/a-new-meta-baseline-for-few-shot-learning","slug":"a-new-meta-baseline-for-few-shot-learning","title":"Meta-Baseline: Exploring Simple Meta-Learning for Few-Shot Learning","date":"2020-03-09","arxiv_id":"2003.04390","repositories_listed":10,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":4,"n_instrument":6,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":5,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 6 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-new-meta-baseline-for-few-shot-learning#ran","syntology_url":"https://syntology.ai/paper/2003.04390","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.04390"}},"official":{"repos":["cyvius96/few-shot-meta-baseline","yinboc/few-shot-meta-baseline"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/how-to-train-your-maml","slug":"how-to-train-your-maml","title":"How to train your MAML","date":"2018-10-22","arxiv_id":"1810.09502","repositories_listed":10,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-to-train-your-maml#ran","syntology_url":"https://syntology.ai/paper/1810.09502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.09502"}},"official":null}},{"url":"/paper/meta-learning-for-semi-supervised-few-shot","slug":"meta-learning-for-semi-supervised-few-shot","title":"Meta-Learning for Semi-Supervised Few-Shot Classification","date":"2018-03-02","arxiv_id":"1803.00676","repositories_listed":10,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-learning-for-semi-supervised-few-shot#ran","syntology_url":"https://syntology.ai/paper/1803.00676","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.00676"}},"official":{"repos":["renmengye/few-shot-ssl-public"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-pseudo-labels","slug":"meta-pseudo-labels","title":"Meta Pseudo Labels","date":"2020-03-23","arxiv_id":"2003.10580","repositories_listed":9,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":7,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/meta-pseudo-labels#ran","syntology_url":"https://syntology.ai/paper/2003.10580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.10580"}},"official":{"repos":["google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/meta-world-a-benchmark-and-evaluation-for","slug":"meta-world-a-benchmark-and-evaluation-for","title":"Meta-World: A Benchmark and Evaluation for Multi-Task and Meta Reinforcement Learning","date":"2019-10-24","arxiv_id":"1910.10897","repositories_listed":9,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/meta-world-a-benchmark-and-evaluation-for#ran","syntology_url":"https://syntology.ai/paper/1910.10897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10897"}},"official":{"repos":["rlworkgroup/metaworld"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-to-reweight-examples-for-robust-deep","slug":"learning-to-reweight-examples-for-robust-deep","title":"Learning to Reweight Examples for Robust Deep Learning","date":"2018-03-24","arxiv_id":"1803.09050","repositories_listed":9,"syntology":null},{"url":"/paper/meta-sgd-learning-to-learn-quickly-for-few","slug":"meta-sgd-learning-to-learn-quickly-for-few","title":"Meta-SGD: Learning to Learn Quickly for Few-Shot Learning","date":"2017-07-31","arxiv_id":"1707.09835","repositories_listed":9,"syntology":null},{"url":"/paper/learning-to-reinforcement-learn","slug":"learning-to-reinforcement-learn","title":"Learning to reinforcement learn","date":"2016-11-17","arxiv_id":"1611.05763","repositories_listed":9,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":13,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/learning-to-reinforcement-learn#ran","syntology_url":"https://syntology.ai/paper/1611.05763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.05763"}},"official":null}},{"url":"/paper/learning-meta-face-recognition-in-unseen","slug":"learning-meta-face-recognition-in-unseen","title":"Learning Meta Face Recognition in Unseen Domains","date":"2020-03-17","arxiv_id":"2003.07733","repositories_listed":8,"syntology":null},{"url":"/paper/learning-to-learn-by-gradient-descent-by","slug":"learning-to-learn-by-gradient-descent-by","title":"Learning to learn by gradient descent by gradient descent","date":"2016-06-14","arxiv_id":"1606.04474","repositories_listed":8,"syntology":{"n":13,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/learning-to-learn-by-gradient-descent-by#ran","syntology_url":"https://syntology.ai/paper/1606.04474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.04474"}},"official":{"repos":["deepmind/learning-to-learn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/meta-learning-a-real-time-tabular-automl","slug":"meta-learning-a-real-time-tabular-automl","title":"TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Second","date":"2022-07-05","arxiv_id":"2207.01848","repositories_listed":7,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-learning-a-real-time-tabular-automl#ran","syntology_url":"https://syntology.ai/paper/2207.01848","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01848"}},"official":null}},{"url":"/paper/meta-learning-with-differentiable-convex","slug":"meta-learning-with-differentiable-convex","title":"Meta-Learning with Differentiable Convex Optimization","date":"2019-04-07","arxiv_id":"1904.03758","repositories_listed":7,"syntology":null},{"url":"/paper/leaf-a-benchmark-for-federated-settings","slug":"leaf-a-benchmark-for-federated-settings","title":"LEAF: A Benchmark for Federated Settings","date":"2018-12-03","arxiv_id":"1812.01097","repositories_listed":7,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/leaf-a-benchmark-for-federated-settings#ran","syntology_url":"https://syntology.ai/paper/1812.01097","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01097"}},"official":{"repos":["TalwalkarLab/leaf"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/simpleshot-revisiting-nearest-neighbor","slug":"simpleshot-revisiting-nearest-neighbor","title":"SimpleShot: Revisiting Nearest-Neighbor Classification for Few-Shot Learning","date":"2019-11-12","arxiv_id":"1911.04623","repositories_listed":6,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simpleshot-revisiting-nearest-neighbor#ran","syntology_url":"https://syntology.ai/paper/1911.04623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04623"}},"official":{"repos":["mileyan/simple_shot"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-with-implicit-gradients","slug":"meta-learning-with-implicit-gradients","title":"Meta-Learning with Implicit Gradients","date":"2019-09-10","arxiv_id":"1909.04630","repositories_listed":6,"syntology":{"n":36,"n_ran":27,"n_constructed":4,"n_ran_checked":8,"n_instrument":19,"n_unverified":9,"n_honours":3,"n_violates":1,"n_no_contract":4,"n_pointer_only":10,"phrase":"27 ran (of which 4 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 1 violated, 4 with no contract checked; 19 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/meta-learning-with-implicit-gradients#ran","syntology_url":"https://syntology.ai/paper/1909.04630","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.04630"}},"official":{"repos":["aravindr93/imaml_dev"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/meta-learning-representations-for-continual","slug":"meta-learning-representations-for-continual","title":"Meta-Learning Representations for Continual Learning","date":"2019-05-29","arxiv_id":"1905.12588","repositories_listed":6,"syntology":null},{"url":"/paper/few-shot-adversarial-learning-of-realistic","slug":"few-shot-adversarial-learning-of-realistic","title":"Few-Shot Adversarial Learning of Realistic Neural Talking Head Models","date":"2019-05-20","arxiv_id":"1905.08233","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-adversarial-learning-of-realistic#ran","syntology_url":"https://syntology.ai/paper/1905.08233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.08233"}},"official":null}},{"url":"/paper/promp-proximal-meta-policy-search","slug":"promp-proximal-meta-policy-search","title":"ProMP: Proximal Meta-Policy Search","date":"2018-10-16","arxiv_id":"1810.06784","repositories_listed":6,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/promp-proximal-meta-policy-search#ran","syntology_url":"https://syntology.ai/paper/1810.06784","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.06784"}},"official":{"repos":["jonasrothfuss/promp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/collaborative-distillation-meta-learning-for","slug":"collaborative-distillation-meta-learning-for","title":"DevFormer: A Symmetric Transformer for Context-Aware Device Placement","date":"2022-05-26","arxiv_id":"2205.13225","repositories_listed":5,"syntology":{"n":23,"n_ran":16,"n_constructed":4,"n_ran_checked":9,"n_instrument":7,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"16 ran (of which 4 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 7 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/collaborative-distillation-meta-learning-for#ran","syntology_url":"https://syntology.ai/paper/2205.13225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13225"}},"official":{"repos":["kaist-silab/devformer","kaist-silab/dppbench"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":4,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/towards-mental-time-travel-a-hierarchical","slug":"towards-mental-time-travel-a-hierarchical","title":"Towards mental time travel: a hierarchical memory for reinforcement learning agents","date":"2021-05-28","arxiv_id":"2105.14039","repositories_listed":5,"syntology":{"n":6,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/towards-mental-time-travel-a-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2105.14039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14039"}},"official":{"repos":["deepmind/deepmind-research","deepmind/dm_fast_mapping"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/evolving-reinforcement-learning-algorithms-1","slug":"evolving-reinforcement-learning-algorithms-1","title":"Evolving Reinforcement Learning Algorithms","date":"2021-01-08","arxiv_id":"2101.03958","repositories_listed":5,"syntology":null},{"url":"/paper/united-we-stand-transfer-graph-neural","slug":"united-we-stand-transfer-graph-neural","title":"Transfer Graph Neural Networks for Pandemic Forecasting","date":"2020-09-10","arxiv_id":"2009.08388","repositories_listed":5,"syntology":null},{"url":"/paper/learning-with-amigo-adversarially-motivated","slug":"learning-with-amigo-adversarially-motivated","title":"Learning with AMIGo: Adversarially Motivated Intrinsic Goals","date":"2020-06-22","arxiv_id":"2006.12122","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-with-amigo-adversarially-motivated#ran","syntology_url":"https://syntology.ai/paper/2006.12122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12122"}},"official":{"repos":["facebookresearch/adversarially-motivated-intrinsic-goals"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/frustratingly-simple-few-shot-object","slug":"frustratingly-simple-few-shot-object","title":"Frustratingly Simple Few-Shot Object Detection","date":"2020-03-16","arxiv_id":"2003.06957","repositories_listed":5,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":11,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/frustratingly-simple-few-shot-object#ran","syntology_url":"https://syntology.ai/paper/2003.06957","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.06957"}},"official":{"repos":["ucbdrive/few-shot-object-detection"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-to-continually-learn","slug":"learning-to-continually-learn","title":"Learning to Continually Learn","date":"2020-02-21","arxiv_id":"2002.09571","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-continually-learn#ran","syntology_url":"https://syntology.ai/paper/2002.09571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09571"}},"official":{"repos":["uvm-neurobotics-lab/ANML"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/torchmeta-a-meta-learning-library-for-pytorch","slug":"torchmeta-a-meta-learning-library-for-pytorch","title":"Torchmeta: A Meta-Learning library for PyTorch","date":"2019-09-14","arxiv_id":"1909.06576","repositories_listed":5,"syntology":null},{"url":"/paper/few-shot-text-classification-with-induction","slug":"few-shot-text-classification-with-induction","title":"Induction Networks for Few-Shot Text Classification","date":"2019-02-27","arxiv_id":"1902.10482","repositories_listed":5,"syntology":null},{"url":"/paper/learning-to-design-rna","slug":"learning-to-design-rna","title":"Learning to Design RNA","date":"2018-12-31","arxiv_id":"1812.11951","repositories_listed":5,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-to-design-rna#ran","syntology_url":"https://syntology.ai/paper/1812.11951","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.11951"}},"official":{"repos":["automl/learna"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-with-latent-embedding","slug":"meta-learning-with-latent-embedding","title":"Meta-Learning with Latent Embedding Optimization","date":"2018-07-16","arxiv_id":"1807.05960","repositories_listed":5,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-learning-with-latent-embedding#ran","syntology_url":"https://syntology.ai/paper/1807.05960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.05960"}},"official":{"repos":["deepmind/leo"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-with-differentiable-closed-form","slug":"meta-learning-with-differentiable-closed-form","title":"Meta-learning with differentiable closed-form solvers","date":"2018-05-21","arxiv_id":"1805.08136","repositories_listed":5,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-learning-with-differentiable-closed-form#ran","syntology_url":"https://syntology.ai/paper/1805.08136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.08136"}},"official":null}},{"url":"/paper/differentiable-plasticity-training-plastic","slug":"differentiable-plasticity-training-plastic","title":"Differentiable plasticity: training plastic neural networks with backpropagation","date":"2018-04-06","arxiv_id":"1804.02464","repositories_listed":5,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/differentiable-plasticity-training-plastic#ran","syntology_url":"https://syntology.ai/paper/1804.02464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.02464"}},"official":{"repos":["uber-common/differentiable-plasticity"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/dice-the-infinitely-differentiable-monte","slug":"dice-the-infinitely-differentiable-monte","title":"DiCE: The Infinitely Differentiable Monte-Carlo Estimator","date":"2018-02-14","arxiv_id":"1802.05098","repositories_listed":5,"syntology":null},{"url":"/paper/learning-to-generalize-meta-learning-for","slug":"learning-to-generalize-meta-learning-for","title":"Learning to Generalize: Meta-Learning for Domain Generalization","date":"2017-10-10","arxiv_id":"1710.03463","repositories_listed":5,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-to-generalize-meta-learning-for#ran","syntology_url":"https://syntology.ai/paper/1710.03463","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.03463"}},"official":null}},{"url":"/paper/comparing-the-efficacy-of-fine-tuning-and","slug":"comparing-the-efficacy-of-fine-tuning-and","title":"Comparing the Efficacy of Fine-Tuning and Meta-Learning for Few-Shot Policy Imitation","date":"2023-06-23","arxiv_id":"2306.13554","repositories_listed":4,"syntology":null},{"url":"/paper/nystrom-method-for-accurate-and-scalable","slug":"nystrom-method-for-accurate-and-scalable","title":"Nystrom Method for Accurate and Scalable Implicit Differentiation","date":"2023-02-20","arxiv_id":"2302.09726","repositories_listed":4,"syntology":null},{"url":"/paper/auto-sklearn-2-0-the-next-generation","slug":"auto-sklearn-2-0-the-next-generation","title":"Auto-Sklearn 2.0: Hands-free AutoML via Meta-Learning","date":"2020-07-08","arxiv_id":"2007.04074","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/auto-sklearn-2-0-the-next-generation#ran","syntology_url":"https://syntology.ai/paper/2007.04074","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04074"}},"official":{"repos":["automl/ASKL2.0_experiments"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/personalized-federated-learning-with-moreau","slug":"personalized-federated-learning-with-moreau","title":"Personalized Federated Learning with Moreau Envelopes","date":"2020-06-16","arxiv_id":"2006.08848","repositories_listed":4,"syntology":null},{"url":"/paper/discor-corrective-feedback-in-reinforcement","slug":"discor-corrective-feedback-in-reinforcement","title":"DisCor: Corrective Feedback in Reinforcement Learning via Distribution Correction","date":"2020-03-16","arxiv_id":"2003.07305","repositories_listed":4,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/discor-corrective-feedback-in-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2003.07305","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.07305"}},"official":null}},{"url":"/paper/tensorflow-quantum-a-software-framework-for","slug":"tensorflow-quantum-a-software-framework-for","title":"TensorFlow Quantum: A Software Framework for Quantum Machine Learning","date":"2020-03-06","arxiv_id":"2003.02989","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tensorflow-quantum-a-software-framework-for#ran","syntology_url":"https://syntology.ai/paper/2003.02989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02989"}},"official":{"repos":["tensorflow/quantum"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-federated-learning-personalization-1","slug":"improving-federated-learning-personalization-1","title":"Improving Federated Learning Personalization via Model Agnostic Meta Learning","date":"2019-09-27","arxiv_id":"1909.12488","repositories_listed":4,"syntology":null},{"url":"/paper/learning-what-and-where-to-transfer","slug":"learning-what-and-where-to-transfer","title":"Learning What and Where to Transfer","date":"2019-05-15","arxiv_id":"1905.05901","repositories_listed":4,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-what-and-where-to-transfer#ran","syntology_url":"https://syntology.ai/paper/1905.05901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05901"}},"official":{"repos":["alinlab/L2T-ww"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/self-supervised-generalisation-with-meta","slug":"self-supervised-generalisation-with-meta","title":"Self-Supervised Generalisation with Meta Auxiliary Learning","date":"2019-01-25","arxiv_id":"1901.08933","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/self-supervised-generalisation-with-meta#ran","syntology_url":"https://syntology.ai/paper/1901.08933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08933"}},"official":{"repos":["lorenmt/maxl"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/few-shot-object-detection-via-feature","slug":"few-shot-object-detection-via-feature","title":"Few-shot Object Detection via Feature Reweighting","date":"2018-12-05","arxiv_id":"1812.01866","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-object-detection-via-feature#ran","syntology_url":"https://syntology.ai/paper/1812.01866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01866"}},"official":{"repos":["bingykang/Fewshot_Detection"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/transferring-knowledge-across-learning","slug":"transferring-knowledge-across-learning","title":"Transferring Knowledge across Learning Processes","date":"2018-12-03","arxiv_id":"1812.01054","repositories_listed":4,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/transferring-knowledge-across-learning#ran","syntology_url":"https://syntology.ai/paper/1812.01054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01054"}},"official":{"repos":["amzn/xfer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/a-simple-neural-attentive-meta-learner","slug":"a-simple-neural-attentive-meta-learner","title":"A Simple Neural Attentive Meta-Learner","date":"2017-07-11","arxiv_id":"1707.03141","repositories_listed":4,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/a-simple-neural-attentive-meta-learner#ran","syntology_url":"https://syntology.ai/paper/1707.03141","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.03141"}},"official":null}},{"url":"/paper/recod-titans-at-isic-challenge-2017","slug":"recod-titans-at-isic-challenge-2017","title":"RECOD Titans at ISIC Challenge 2017","date":"2017-03-14","arxiv_id":"1703.04819","repositories_listed":4,"syntology":null},{"url":"/paper/jaxmarl-multi-agent-rl-environments-in-jax","slug":"jaxmarl-multi-agent-rl-environments-in-jax","title":"JaxMARL: Multi-Agent RL Environments and Algorithms in JAX","date":"2023-11-16","arxiv_id":"2311.10090","repositories_listed":3,"syntology":{"n":23,"n_ran":22,"n_constructed":0,"n_ran_checked":22,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":22,"n_pointer_only":0,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 0 honoured, 0 violated, 22 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/jaxmarl-multi-agent-rl-environments-in-jax#ran","syntology_url":"https://syntology.ai/paper/2311.10090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.10090"}},"official":{"repos":["flairox/jaxmarl"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/meta-album-multi-domain-meta-dataset-for-few-1","slug":"meta-album-multi-domain-meta-dataset-for-few-1","title":"Meta-Album: Multi-domain Meta-Dataset for Few-Shot Image Classification","date":"2023-02-16","arxiv_id":"2302.08909","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-album-multi-domain-meta-dataset-for-few-1#ran","syntology_url":"https://syntology.ai/paper/2302.08909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08909"}},"official":{"repos":["dustincarrion/cd-metadl","ihsaan-ullah/meta-album","ihsanullah2131/meta-album"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fewsol-a-dataset-for-few-shot-object-learning","slug":"fewsol-a-dataset-for-few-shot-object-learning","title":"FewSOL: A Dataset for Few-Shot Object Learning in Robotic Environments","date":"2022-07-06","arxiv_id":"2207.03333","repositories_listed":3,"syntology":null},{"url":"/paper/dual-attention-networks-for-few-shot-fine","slug":"dual-attention-networks-for-few-shot-fine","title":"Dual Attention Networks for Few-Shot Fine-Grained Recognition","date":"2022-06-28","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/more-is-better-a-novel-multi-view-framework","slug":"more-is-better-a-novel-multi-view-framework","title":"MVDG: A Unified Multi-view Framework for Domain Generalization","date":"2021-12-23","arxiv_id":"2112.12329","repositories_listed":3,"syntology":null},{"url":"/paper/dataset-distillation-with-infinitely-wide","slug":"dataset-distillation-with-infinitely-wide","title":"Dataset Distillation with Infinitely Wide Convolutional Networks","date":"2021-07-27","arxiv_id":"2107.13034","repositories_listed":3,"syntology":null},{"url":"/paper/learning-an-explicit-hyperparameter","slug":"learning-an-explicit-hyperparameter","title":"Learning an Explicit Hyperparameter Prediction Function Conditioned on Tasks","date":"2021-07-06","arxiv_id":"2107.02378","repositories_listed":3,"syntology":null},{"url":"/paper/mutual-information-based-few-shot","slug":"mutual-information-based-few-shot","title":"Mutual-Information Based Few-Shot Classification","date":"2021-06-23","arxiv_id":"2106.12252","repositories_listed":3,"syntology":null},{"url":"/paper/learning-to-expand-audience-via-meta-hybrid","slug":"learning-to-expand-audience-via-meta-hybrid","title":"Learning to Expand Audience via Meta Hybrid Experts and Critics for Recommendation and Advertising","date":"2021-05-31","arxiv_id":"2105.14688","repositories_listed":3,"syntology":null},{"url":"/paper/editing-factual-knowledge-in-language-models","slug":"editing-factual-knowledge-in-language-models","title":"Editing Factual Knowledge in Language Models","date":"2021-04-16","arxiv_id":"2104.08164","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/editing-factual-knowledge-in-language-models#ran","syntology_url":"https://syntology.ai/paper/2104.08164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08164"}},"official":{"repos":["nicola-decao/KnowledgeEditor"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exploiting-shared-representations-for","slug":"exploiting-shared-representations-for","title":"Exploiting Shared Representations for Personalized Federated Learning","date":"2021-02-14","arxiv_id":"2102.07078","repositories_listed":3,"syntology":null},{"url":"/paper/federated-reconstruction-partially-local","slug":"federated-reconstruction-partially-local","title":"Federated Reconstruction: Partially Local Federated Learning","date":"2021-02-05","arxiv_id":"2102.03448","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/federated-reconstruction-partially-local#ran","syntology_url":"https://syntology.ai/paper/2102.03448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03448"}},"official":{"repos":["google-research/federated"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/nonparametric-estimation-of-heterogeneous","slug":"nonparametric-estimation-of-heterogeneous","title":"Nonparametric Estimation of Heterogeneous Treatment Effects: From Theory to Learning Algorithms","date":"2021-01-26","arxiv_id":"2101.10943","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/nonparametric-estimation-of-heterogeneous#ran","syntology_url":"https://syntology.ai/paper/2101.10943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.10943"}},"official":{"repos":["AliciaCurth/CATENets","vanderschaarlab/mlforhealthlabpub"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/meta-variationally-intrinsic-motivated","slug":"meta-variationally-intrinsic-motivated","title":"MetaVIM: Meta Variationally Intrinsic Motivated Reinforcement Learning for Decentralized Traffic Signal Control","date":"2021-01-04","arxiv_id":"2101.00746","repositories_listed":3,"syntology":null},{"url":"/paper/learned-initializations-for-optimizing","slug":"learned-initializations-for-optimizing","title":"Learned Initializations for Optimizing Coordinate-Based Neural Representations","date":"2020-12-03","arxiv_id":"2012.02189","repositories_listed":3,"syntology":null},{"url":"/paper/discriminative-adversarial-domain","slug":"discriminative-adversarial-domain","title":"Discriminative Adversarial Domain Generalization with Meta-learning based Cross-domain Validation","date":"2020-11-01","arxiv_id":"2011.00444","repositories_listed":3,"syntology":null},{"url":"/paper/la-maml-look-ahead-meta-learning-for","slug":"la-maml-look-ahead-meta-learning-for","title":"La-MAML: Look-ahead Meta Learning for Continual Learning","date":"2020-07-27","arxiv_id":"2007.13904","repositories_listed":3,"syntology":{"n":6,"n_ran":5,"n_constructed":1,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/la-maml-look-ahead-meta-learning-for#ran","syntology_url":"https://syntology.ai/paper/2007.13904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.13904"}},"official":{"repos":["montrealrobotics/La-MAML"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/adaptive-risk-minimization-a-meta-learning","slug":"adaptive-risk-minimization-a-meta-learning","title":"Adaptive Risk Minimization: Learning to Adapt to Domain Shift","date":"2020-07-06","arxiv_id":"2007.02931","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/adaptive-risk-minimization-a-meta-learning#ran","syntology_url":"https://syntology.ai/paper/2007.02931","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02931"}},"official":{"repos":["henrikmarklund/arm"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/interpretable-meta-measure-for-model","slug":"interpretable-meta-measure-for-model","title":"Interpretable Meta-Measure for Model Performance","date":"2020-06-02","arxiv_id":"2006.02293","repositories_listed":3,"syntology":null},{"url":"/paper/physarum-powered-differentiable-linear","slug":"physarum-powered-differentiable-linear","title":"Physarum Powered Differentiable Linear Programming Layers and Applications","date":"2020-04-30","arxiv_id":"2004.14539","repositories_listed":3,"syntology":null},{"url":"/paper/learning-a-formula-of-interpretability-to","slug":"learning-a-formula-of-interpretability-to","title":"Learning a Formula of Interpretability to Learn Interpretable Formulas","date":"2020-04-23","arxiv_id":"2004.11170","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-a-formula-of-interpretability-to#ran","syntology_url":"https://syntology.ai/paper/2004.11170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11170"}},"official":{"repos":["MaLeLabTs/GPFormulasInterpretability","marcovirgolin/pyNSGP"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/rethinking-few-shot-image-classification-a","slug":"rethinking-few-shot-image-classification-a","title":"Rethinking Few-Shot Image Classification: a Good Embedding Is All You Need?","date":"2020-03-25","arxiv_id":"2003.11539","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rethinking-few-shot-image-classification-a#ran","syntology_url":"https://syntology.ai/paper/2003.11539","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11539"}},"official":{"repos":["WangYueFt/rfs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/pacoh-bayes-optimal-meta-learning-with-pac","slug":"pacoh-bayes-optimal-meta-learning-with-pac","title":"PACOH: Bayes-Optimal Meta-Learning with PAC-Guarantees","date":"2020-02-13","arxiv_id":"2002.05551","repositories_listed":3,"syntology":null},{"url":"/paper/meta-learning-framework-with-applications-to","slug":"meta-learning-framework-with-applications-to","title":"Meta-learning framework with applications to zero-shot time-series forecasting","date":"2020-02-07","arxiv_id":"2002.02887","repositories_listed":3,"syntology":null},{"url":"/paper/learning-to-reinforcement-learn-for-neural","slug":"learning-to-reinforcement-learn-for-neural","title":"Learning to reinforcement learn for Neural Architecture Search","date":"2019-11-09","arxiv_id":"1911.03769","repositories_listed":3,"syntology":null},{"url":"/paper/varibad-a-very-good-method-for-bayes-adaptive-1","slug":"varibad-a-very-good-method-for-bayes-adaptive-1","title":"VariBAD: A Very Good Method for Bayes-Adaptive Deep RL via Meta-Learning","date":"2019-10-18","arxiv_id":"1910.08348","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/varibad-a-very-good-method-for-bayes-adaptive-1#ran","syntology_url":"https://syntology.ai/paper/1910.08348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.08348"}},"official":{"repos":["lmzintgraf/varibad"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/deep-kernel-transfer-in-gaussian-processes","slug":"deep-kernel-transfer-in-gaussian-processes","title":"Bayesian Meta-Learning for the Few-Shot Setting via Deep Kernels","date":"2019-10-11","arxiv_id":"1910.05199","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/deep-kernel-transfer-in-gaussian-processes#ran","syntology_url":"https://syntology.ai/paper/1910.05199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.05199"}},"official":{"repos":["BayesWatch/deep-kernel-transfer"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/generalized-inner-loop-meta-learning","slug":"generalized-inner-loop-meta-learning","title":"Generalized Inner Loop Meta-Learning","date":"2019-10-03","arxiv_id":"1910.01727","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/generalized-inner-loop-meta-learning#ran","syntology_url":"https://syntology.ai/paper/1910.01727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01727"}},"official":{"repos":["learnables/learn2learn","facebookresearch/higher"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/learning-to-learn-with-quantum-neural","slug":"learning-to-learn-with-quantum-neural","title":"Learning to learn with quantum neural networks via classical neural networks","date":"2019-07-11","arxiv_id":"1907.05415","repositories_listed":3,"syntology":null},{"url":"/paper/push-the-student-to-learn-right-progressive","slug":"push-the-student-to-learn-right-progressive","title":"Meta-Weight-Net: Learning an Explicit Mapping For Sample Weighting","date":"2019-02-20","arxiv_id":"1902.07379","repositories_listed":3,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/push-the-student-to-learn-right-progressive#ran","syntology_url":"https://syntology.ai/paper/1902.07379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07379"}},"official":{"repos":["xjtushujun/meta-weight-net"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/figr-few-shot-image-generation-with-reptile","slug":"figr-few-shot-image-generation-with-reptile","title":"FIGR: Few-shot Image Generation with Reptile","date":"2019-01-08","arxiv_id":"1901.02199","repositories_listed":3,"syntology":null},{"url":"/paper/unsupervised-meta-learning-of-figure-ground","slug":"unsupervised-meta-learning-of-figure-ground","title":"Unsupervised Meta-learning of Figure-Ground Segmentation via Imitating Visual Effects","date":"2018-12-20","arxiv_id":"1812.08442","repositories_listed":3,"syntology":null},{"url":"/paper/learning-to-learn-without-forgetting-by","slug":"learning-to-learn-without-forgetting-by","title":"Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interference","date":"2018-10-29","arxiv_id":"1810.11910","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-learn-without-forgetting-by#ran","syntology_url":"https://syntology.ai/paper/1810.11910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.11910"}},"official":{"repos":["mattriemer/mer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/task-embedded-control-networks-for-few-shot","slug":"task-embedded-control-networks-for-few-shot","title":"Task-Embedded Control Networks for Few-Shot Imitation Learning","date":"2018-10-08","arxiv_id":"1810.03237","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/task-embedded-control-networks-for-few-shot#ran","syntology_url":"https://syntology.ai/paper/1810.03237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.03237"}},"official":{"repos":["stepjam/TecNets"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/meta-learning-priors-for-efficient-online","slug":"meta-learning-priors-for-efficient-online","title":"Meta-Learning Priors for Efficient Online Bayesian Regression","date":"2018-07-24","arxiv_id":"1807.08912","repositories_listed":3,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/meta-learning-priors-for-efficient-online#ran","syntology_url":"https://syntology.ai/paper/1807.08912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.08912"}},"official":{"repos":["StanfordASL/ALPaCA"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-shared-hierarchies","slug":"meta-learning-shared-hierarchies","title":"Meta Learning Shared Hierarchies","date":"2017-10-26","arxiv_id":"1710.09767","repositories_listed":3,"syntology":null},{"url":"/paper/one-shot-visual-imitation-learning-via-meta","slug":"one-shot-visual-imitation-learning-via-meta","title":"One-Shot Visual Imitation Learning via Meta-Learning","date":"2017-09-14","arxiv_id":"1709.04905","repositories_listed":3,"syntology":null},{"url":"/paper/metabox-v2-a-unified-benchmark-platform-for","slug":"metabox-v2-a-unified-benchmark-platform-for","title":"MetaBox-v2: A Unified Benchmark Platform for Meta-Black-Box Optimization","date":"2025-05-23","arxiv_id":"2505.17745","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/metabox-v2-a-unified-benchmark-platform-for#ran","syntology_url":"https://syntology.ai/paper/2505.17745","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.17745"}},"official":{"repos":["metaevo/metabox"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/toward-automated-algorithm-design-a-survey","slug":"toward-automated-algorithm-design-a-survey","title":"Toward Automated Algorithm Design: A Survey and Practical Guide to Meta-Black-Box-Optimization","date":"2024-11-01","arxiv_id":"2411.00625","repositories_listed":2,"syntology":null},{"url":"/paper/godel-agent-a-self-referential-agent","slug":"godel-agent-a-self-referential-agent","title":"Gödel Agent: A Self-Referential Agent Framework for Recursive Self-Improvement","date":"2024-10-06","arxiv_id":"2410.04444","repositories_listed":2,"syntology":null},{"url":"/paper/opponent-shaping-for-antibody-development","slug":"opponent-shaping-for-antibody-development","title":"ADIOS: Antibody Development via Opponent Shaping","date":"2024-09-16","arxiv_id":"2409.10588","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/opponent-shaping-for-antibody-development#ran","syntology_url":"https://syntology.ai/paper/2409.10588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.10588"}},"official":{"repos":["olakalisz/adios","olakalisz/antibody-shapers"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-meta-domain-transfer-learning-amdtl-1","slug":"adaptive-meta-domain-transfer-learning-amdtl-1","title":"Adaptive Meta-Domain Transfer Learning (AMDTL): A Novel Approach for Knowledge Transfer in AI","date":"2024-09-10","arxiv_id":"2409.06800","repositories_listed":2,"syntology":null},{"url":"/paper/metaaug-meta-data-augmentation-for-post","slug":"metaaug-meta-data-augmentation-for-post","title":"MetaAug: Meta-Data Augmentation for Post-Training Quantization","date":"2024-07-20","arxiv_id":"2407.14726","repositories_listed":2,"syntology":null},{"url":"/paper/meta-learning-loss-functions-for-deep-neural","slug":"meta-learning-loss-functions-for-deep-neural","title":"Meta-Learning Loss Functions for Deep Neural Networks","date":"2024-06-14","arxiv_id":"2406.09713","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-fss-a-novel-few-shot-segmentation","slug":"adaptive-fss-a-novel-few-shot-segmentation","title":"Adaptive FSS: A Novel Few-Shot Segmentation Framework via Prototype Enhancement","date":"2023-12-25","arxiv_id":"2312.15731","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-fss-a-novel-few-shot-segmentation#ran","syntology_url":"https://syntology.ai/paper/2312.15731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.15731"}},"official":{"repos":["jingw193/adaptive_fss","jingw193/adaptivefss"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/xland-minigrid-scalable-meta-reinforcement","slug":"xland-minigrid-scalable-meta-reinforcement","title":"XLand-MiniGrid: Scalable Meta-Reinforcement Learning Environments in JAX","date":"2023-12-19","arxiv_id":"2312.12044","repositories_listed":2,"syntology":null},{"url":"/paper/causal-similarity-based-hierarchical-bayesian","slug":"causal-similarity-based-hierarchical-bayesian","title":"Bayesian Meta-Learning for Improving Generalizability of Health Prediction Models With Similar Causal Mechanisms","date":"2023-10-19","arxiv_id":"2310.12595","repositories_listed":2,"syntology":null},{"url":"/paper/self-supervised-set-representation-learning","slug":"self-supervised-set-representation-learning","title":"Self-Supervised Dataset Distillation for Transfer Learning","date":"2023-10-10","arxiv_id":"2310.06511","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/self-supervised-set-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2310.06511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.06511"}},"official":{"repos":["db-lee/selfsup_dd"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/generative-meta-learning-robust-quality","slug":"generative-meta-learning-robust-quality","title":"Generative Meta-Learning Robust Quality-Diversity Portfolio","date":"2023-07-15","arxiv_id":"2307.07811","repositories_listed":2,"syntology":null}],"syntology_records":56,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":420,"papers_where_code_ran_first_page":"/task/meta-learning/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":36,"url":"/task/meta-learning/papers/2","json":"/task/meta-learning/papers/2.json","rows":100},{"order":"archive","page":3,"of":36,"url":"/task/meta-learning/papers/3","json":"/task/meta-learning/papers/3.json","rows":100},{"order":"archive","page":4,"of":36,"url":"/task/meta-learning/papers/4","json":"/task/meta-learning/papers/4.json","rows":100},{"order":"archive","page":5,"of":36,"url":"/task/meta-learning/papers/5","json":"/task/meta-learning/papers/5.json","rows":100},{"order":"archive","page":6,"of":36,"url":"/task/meta-learning/papers/6","json":"/task/meta-learning/papers/6.json","rows":100},{"order":"archive","page":7,"of":36,"url":"/task/meta-learning/papers/7","json":"/task/meta-learning/papers/7.json","rows":100},{"order":"archive","page":8,"of":36,"url":"/task/meta-learning/papers/8","json":"/task/meta-learning/papers/8.json","rows":100},{"order":"archive","page":9,"of":36,"url":"/task/meta-learning/papers/9","json":"/task/meta-learning/papers/9.json","rows":100},{"order":"archive","page":10,"of":36,"url":"/task/meta-learning/papers/10","json":"/task/meta-learning/papers/10.json","rows":100},{"order":"archive","page":11,"of":36,"url":"/task/meta-learning/papers/11","json":"/task/meta-learning/papers/11.json","rows":100},{"order":"archive","page":12,"of":36,"url":"/task/meta-learning/papers/12","json":"/task/meta-learning/papers/12.json","rows":100},{"order":"archive","page":13,"of":36,"url":"/task/meta-learning/papers/13","json":"/task/meta-learning/papers/13.json","rows":100},{"order":"archive","page":14,"of":36,"url":"/task/meta-learning/papers/14","json":"/task/meta-learning/papers/14.json","rows":100},{"order":"archive","page":15,"of":36,"url":"/task/meta-learning/papers/15","json":"/task/meta-learning/papers/15.json","rows":100},{"order":"archive","page":16,"of":36,"url":"/task/meta-learning/papers/16","json":"/task/meta-learning/papers/16.json","rows":100},{"order":"archive","page":17,"of":36,"url":"/task/meta-learning/papers/17","json":"/task/meta-learning/papers/17.json","rows":100},{"order":"archive","page":18,"of":36,"url":"/task/meta-learning/papers/18","json":"/task/meta-learning/papers/18.json","rows":100},{"order":"archive","page":19,"of":36,"url":"/task/meta-learning/papers/19","json":"/task/meta-learning/papers/19.json","rows":100},{"order":"archive","page":20,"of":36,"url":"/task/meta-learning/papers/20","json":"/task/meta-learning/papers/20.json","rows":100},{"order":"archive","page":21,"of":36,"url":"/task/meta-learning/papers/21","json":"/task/meta-learning/papers/21.json","rows":100},{"order":"archive","page":22,"of":36,"url":"/task/meta-learning/papers/22","json":"/task/meta-learning/papers/22.json","rows":100},{"order":"archive","page":23,"of":36,"url":"/task/meta-learning/papers/23","json":"/task/meta-learning/papers/23.json","rows":100},{"order":"archive","page":24,"of":36,"url":"/task/meta-learning/papers/24","json":"/task/meta-learning/papers/24.json","rows":100},{"order":"archive","page":25,"of":36,"url":"/task/meta-learning/papers/25","json":"/task/meta-learning/papers/25.json","rows":100},{"order":"archive","page":26,"of":36,"url":"/task/meta-learning/papers/26","json":"/task/meta-learning/papers/26.json","rows":100},{"order":"archive","page":27,"of":36,"url":"/task/meta-learning/papers/27","json":"/task/meta-learning/papers/27.json","rows":100},{"order":"archive","page":28,"of":36,"url":"/task/meta-learning/papers/28","json":"/task/meta-learning/papers/28.json","rows":100},{"order":"archive","page":29,"of":36,"url":"/task/meta-learning/papers/29","json":"/task/meta-learning/papers/29.json","rows":100},{"order":"archive","page":30,"of":36,"url":"/task/meta-learning/papers/30","json":"/task/meta-learning/papers/30.json","rows":100},{"order":"archive","page":31,"of":36,"url":"/task/meta-learning/papers/31","json":"/task/meta-learning/papers/31.json","rows":100},{"order":"archive","page":32,"of":36,"url":"/task/meta-learning/papers/32","json":"/task/meta-learning/papers/32.json","rows":100},{"order":"archive","page":33,"of":36,"url":"/task/meta-learning/papers/33","json":"/task/meta-learning/papers/33.json","rows":100},{"order":"archive","page":34,"of":36,"url":"/task/meta-learning/papers/34","json":"/task/meta-learning/papers/34.json","rows":100},{"order":"archive","page":35,"of":36,"url":"/task/meta-learning/papers/35","json":"/task/meta-learning/papers/35.json","rows":100},{"order":"archive","page":36,"of":36,"url":"/task/meta-learning/papers/36","json":"/task/meta-learning/papers/36.json","rows":69},{"order":"ran","page":1,"of":5,"url":"/task/meta-learning/papers/ran/1","json":"/task/meta-learning/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":5,"url":"/task/meta-learning/papers/ran/2","json":"/task/meta-learning/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":5,"url":"/task/meta-learning/papers/ran/3","json":"/task/meta-learning/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":5,"url":"/task/meta-learning/papers/ran/4","json":"/task/meta-learning/papers/ran/4.json","rows":100},{"order":"ran","page":5,"of":5,"url":"/task/meta-learning/papers/ran/5","json":"/task/meta-learning/papers/ran/5.json","rows":20}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"b515da98e864230c474964897611b31f0b11bf3dc9004265e46352051d00cfcd","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}