{"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/papers/ran/4","list_of":"/task/meta-learning","task":"Meta-Learning","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":4,"pages_in_order":5,"rows_per_page":100,"rows":[301,400],"of":420,"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":353,"every_run_a_failure_of_syntologys_instrument":67,"listed_with_a_run_with_no_instrument_failure":353,"listed_every_run_a_failure_of_syntologys_instrument":67,"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"},"first_page":"/task/meta-learning/papers/ran/1","prev":"/task/meta-learning/papers/ran/3","next":"/task/meta-learning/papers/ran/5","papers":[{"url":"/paper/few-shot-relation-extraction-via-bayesian","slug":"few-shot-relation-extraction-via-bayesian","title":"Few-shot Relation Extraction via Bayesian Meta-learning on Relation Graphs","date":"2020-07-05","arxiv_id":"2007.02387","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-relation-extraction-via-bayesian#ran","syntology_url":"https://syntology.ai/paper/2007.02387","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02387"}},"official":null}},{"url":"/paper/meta-learning-stationary-stochastic-process","slug":"meta-learning-stationary-stochastic-process","title":"Meta-Learning Stationary Stochastic Process Prediction with Convolutional Neural Processes","date":"2020-07-02","arxiv_id":"2007.01332","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-learning-stationary-stochastic-process#ran","syntology_url":"https://syntology.ai/paper/2007.01332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01332"}},"official":{"repos":["YannDubs/Neural-Process-Family","wesselb/NeuralProcesses.jl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-iteration-complexity-of-hypergradient","slug":"on-the-iteration-complexity-of-hypergradient","title":"On the Iteration Complexity of Hypergradient Computation","date":"2020-06-29","arxiv_id":"2006.16218","repositories_listed":1,"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/on-the-iteration-complexity-of-hypergradient#ran","syntology_url":"https://syntology.ai/paper/2006.16218","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16218"}},"official":{"repos":["prolearner/hypertorch"],"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/universal-linguistic-inductive-biases-via","slug":"universal-linguistic-inductive-biases-via","title":"Universal linguistic inductive biases via meta-learning","date":"2020-06-29","arxiv_id":"2006.16324","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 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; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/universal-linguistic-inductive-biases-via#ran","syntology_url":"https://syntology.ai/paper/2006.16324","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16324"}},"official":{"repos":["tommccoy1/meta-learning-linguistic-biases"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/laplacian-regularized-few-shot-learning-1","slug":"laplacian-regularized-few-shot-learning-1","title":"Laplacian Regularized Few-Shot Learning","date":"2020-06-28","arxiv_id":"2006.15486","repositories_listed":2,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"5 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; 4 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/laplacian-regularized-few-shot-learning-1#ran","syntology_url":"https://syntology.ai/paper/2006.15486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15486"}},"official":{"repos":["imtiazziko/LaplacianShot"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/global-convergence-and-induced-kernels-of","slug":"global-convergence-and-induced-kernels-of","title":"Global Convergence and Generalization Bound of Gradient-Based Meta-Learning with Deep Neural Nets","date":"2020-06-25","arxiv_id":"2006.14606","repositories_listed":2,"syntology":{"n":22,"n_ran":18,"n_constructed":0,"n_ran_checked":15,"n_instrument":3,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":14,"n_pointer_only":2,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 0 violated, 14 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/global-convergence-and-induced-kernels-of#ran","syntology_url":"https://syntology.ai/paper/2006.14606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14606"}},"official":{"repos":["AI-secure/Meta-Neural-Kernel","facebookresearch/higher"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"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/learning-to-generate-noise-for-robustness","slug":"learning-to-generate-noise-for-robustness","title":"Learning to Generate Noise for Multi-Attack Robustness","date":"2020-06-22","arxiv_id":"2006.12135","repositories_listed":1,"syntology":{"n":16,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"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) · 7 unverified","sample_list":"/paper/learning-to-generate-noise-for-robustness#ran","syntology_url":"https://syntology.ai/paper/2006.12135","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12135"}},"official":{"repos":["divyam3897/MNG_AC"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-prototypical-transfer","slug":"self-supervised-prototypical-transfer","title":"Self-Supervised Prototypical Transfer Learning for Few-Shot Classification","date":"2020-06-19","arxiv_id":"2006.11325","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":1,"n_ran_checked":1,"n_instrument":7,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"8 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 7 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/self-supervised-prototypical-transfer#ran","syntology_url":"https://syntology.ai/paper/2006.11325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11325"}},"official":{"repos":["indy-lab/ProtoTransfer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/metasdf-meta-learning-signed-distance","slug":"metasdf-meta-learning-signed-distance","title":"MetaSDF: Meta-learning Signed Distance Functions","date":"2020-06-17","arxiv_id":"2006.09662","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/metasdf-meta-learning-signed-distance#ran","syntology_url":"https://syntology.ai/paper/2006.09662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09662"}},"official":{"repos":["shaohua0116/MultiDigitMNIST"],"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-few-shot-visual-classification-with","slug":"improving-few-shot-visual-classification-with","title":"Enhancing Few-Shot Image Classification with Unlabelled Examples","date":"2020-06-17","arxiv_id":"2006.12245","repositories_listed":2,"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":2,"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/improving-few-shot-visual-classification-with#ran","syntology_url":"https://syntology.ai/paper/2006.12245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12245"}},"official":{"repos":["plai-group/simple-cnaps"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/flexible-dataset-distillation-learn-labels","slug":"flexible-dataset-distillation-learn-labels","title":"Flexible Dataset Distillation: Learn Labels Instead of Images","date":"2020-06-15","arxiv_id":"2006.08572","repositories_listed":2,"syntology":{"n":14,"n_ran":12,"n_constructed":8,"n_ran_checked":9,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"12 ran (of which 8 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/flexible-dataset-distillation-learn-labels#ran","syntology_url":"https://syntology.ai/paper/2006.08572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08572"}},"official":{"repos":["ondrejbohdal/label-distillation"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":8,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/metaperturb-transferable-regularizer-for","slug":"metaperturb-transferable-regularizer-for","title":"MetaPerturb: Transferable Regularizer for Heterogeneous Tasks and Architectures","date":"2020-06-13","arxiv_id":"2006.07540","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"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: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/metaperturb-transferable-regularizer-for#ran","syntology_url":"https://syntology.ai/paper/2006.07540","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07540"}},"official":{"repos":["JWoong148/MetaPerturb"],"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/mc-bert-efficient-language-pre-training-via-a","slug":"mc-bert-efficient-language-pre-training-via-a","title":"MC-BERT: Efficient Language Pre-Training via a Meta Controller","date":"2020-06-10","arxiv_id":"2006.05744","repositories_listed":1,"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":4,"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/mc-bert-efficient-language-pre-training-via-a#ran","syntology_url":"https://syntology.ai/paper/2006.05744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05744"}},"official":{"repos":["MC-BERT/MC-BERT"],"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/learning-to-stop-while-learning-to-predict","slug":"learning-to-stop-while-learning-to-predict","title":"Learning to Stop While Learning to Predict","date":"2020-06-09","arxiv_id":"2006.05082","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"6 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-stop-while-learning-to-predict#ran","syntology_url":"https://syntology.ai/paper/2006.05082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05082"}},"official":null}},{"url":"/paper/empirical-bayes-transductive-meta-learning-1","slug":"empirical-bayes-transductive-meta-learning-1","title":"Empirical Bayes Transductive Meta-Learning with Synthetic Gradients","date":"2020-04-27","arxiv_id":"2004.12696","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"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) · 1 unverified","sample_list":"/paper/empirical-bayes-transductive-meta-learning-1#ran","syntology_url":"https://syntology.ai/paper/2004.12696","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12696"}},"official":{"repos":["amzn/xfer","hushell/sib_meta_learn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/metaiqa-deep-meta-learning-for-no-reference","slug":"metaiqa-deep-meta-learning-for-no-reference","title":"MetaIQA: Deep Meta-learning for No-Reference Image Quality Assessment","date":"2020-04-11","arxiv_id":"2004.05508","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/metaiqa-deep-meta-learning-for-no-reference#ran","syntology_url":"https://syntology.ai/paper/2004.05508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05508"}},"official":null}},{"url":"/paper/there-and-back-again-revisiting","slug":"there-and-back-again-revisiting","title":"There and Back Again: Revisiting Backpropagation Saliency Methods","date":"2020-04-06","arxiv_id":"2004.02866","repositories_listed":1,"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/there-and-back-again-revisiting#ran","syntology_url":"https://syntology.ai/paper/2004.02866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02866"}},"official":{"repos":["srebuffi/revisiting_saliency"],"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":["official"]}}},{"url":"/paper/metapoison-practical-general-purpose-clean","slug":"metapoison-practical-general-purpose-clean","title":"MetaPoison: Practical General-purpose Clean-label Data Poisoning","date":"2020-04-01","arxiv_id":"2004.00225","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 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; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/metapoison-practical-general-purpose-clean#ran","syntology_url":"https://syntology.ai/paper/2004.00225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.00225"}},"official":{"repos":["wronnyhuang/metapoison"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/efficient-domain-generalization-via-common","slug":"efficient-domain-generalization-via-common","title":"Efficient Domain Generalization via Common-Specific Low-Rank Decomposition","date":"2020-03-28","arxiv_id":"2003.12815","repositories_listed":2,"syntology":{"n":11,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/efficient-domain-generalization-via-common#ran","syntology_url":"https://syntology.ai/paper/2003.12815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12815"}},"official":{"repos":["vihari/csd"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":7,"ran_from_kinds":["official"]}}},{"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/rethinking-class-balanced-methods-for-long","slug":"rethinking-class-balanced-methods-for-long","title":"Rethinking Class-Balanced Methods for Long-Tailed Visual Recognition from a Domain Adaptation Perspective","date":"2020-03-24","arxiv_id":"2003.10780","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rethinking-class-balanced-methods-for-long#ran","syntology_url":"https://syntology.ai/paper/2003.10780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.10780"}},"official":{"repos":["abdullahjamal/Longtail_DA"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"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":10,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 2 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/incremental-object-detection-via-meta","slug":"incremental-object-detection-via-meta","title":"Incremental Object Detection via Meta-Learning","date":"2020-03-17","arxiv_id":"2003.08798","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"7 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/incremental-object-detection-via-meta#ran","syntology_url":"https://syntology.ai/paper/2003.08798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.08798"}},"official":{"repos":["JosephKJ/iOD"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"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":5,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":11,"phrase":"5 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; 0 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/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/learning-compositional-rules-via-neural","slug":"learning-compositional-rules-via-neural","title":"Learning Compositional Rules via Neural Program Synthesis","date":"2020-03-12","arxiv_id":"2003.05562","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-compositional-rules-via-neural#ran","syntology_url":"https://syntology.ai/paper/2003.05562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05562"}},"official":{"repos":["mtensor/rulesynthesis"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/online-fast-adaptation-and-knowledge","slug":"online-fast-adaptation-and-knowledge","title":"Online Fast Adaptation and Knowledge Accumulation: a New Approach to Continual Learning","date":"2020-03-12","arxiv_id":"2003.05856","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/online-fast-adaptation-and-knowledge#ran","syntology_url":"https://syntology.ai/paper/2003.05856","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05856"}},"official":{"repos":["ElementAI/osaka"],"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":["official"]}}},{"url":"/paper/meta-learning-initializations-for-low","slug":"meta-learning-initializations-for-low","title":"Meta-Learning Initializations for Low-Resource Drug Discovery","date":"2020-03-12","arxiv_id":"2003.05996","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-learning-initializations-for-low#ran","syntology_url":"https://syntology.ai/paper/2003.05996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05996"}},"official":{"repos":["GSK-AI/meta-learning-qsar"],"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":["official"]}}},{"url":"/paper/meta-learning-curiosity-algorithms-1","slug":"meta-learning-curiosity-algorithms-1","title":"Meta-learning curiosity algorithms","date":"2020-03-11","arxiv_id":"2003.05325","repositories_listed":1,"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/meta-learning-curiosity-algorithms-1#ran","syntology_url":"https://syntology.ai/paper/2003.05325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05325"}},"official":{"repos":["mfranzs/meta-learning-curiosity-algorithms"],"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/online-meta-critic-learning-for-off-policy-1","slug":"online-meta-critic-learning-for-off-policy-1","title":"Online Meta-Critic Learning for Off-Policy Actor-Critic Methods","date":"2020-03-11","arxiv_id":"2003.05334","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":6,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"phrase":"6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 6 samples that ran constructed an object rather than computing a result","sample_list":"/paper/online-meta-critic-learning-for-off-policy-1#ran","syntology_url":"https://syntology.ai/paper/2003.05334","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05334"}},"official":{"repos":["zwfightzw/Meta-Critic"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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":6,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":5,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 4 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":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/tasknorm-rethinking-batch-normalization-for","slug":"tasknorm-rethinking-batch-normalization-for","title":"TaskNorm: Rethinking Batch Normalization for Meta-Learning","date":"2020-03-06","arxiv_id":"2003.03284","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"6 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tasknorm-rethinking-batch-normalization-for#ran","syntology_url":"https://syntology.ai/paper/2003.03284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03284"}},"official":{"repos":["cambridge-mlg/cnaps"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pac-bayesian-meta-learning-with-implicit","slug":"pac-bayesian-meta-learning-with-implicit","title":"PAC-Bayes meta-learning with implicit task-specific posteriors","date":"2020-03-05","arxiv_id":"2003.02455","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pac-bayesian-meta-learning-with-implicit#ran","syntology_url":"https://syntology.ai/paper/2003.02455","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02455"}},"official":{"repos":["cnguyen10/few_shot_meta_learning"],"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":["official"]}}},{"url":"/paper/meta-transfer-learning-for-zero-shot-super","slug":"meta-transfer-learning-for-zero-shot-super","title":"Meta-Transfer Learning for Zero-Shot Super-Resolution","date":"2020-02-27","arxiv_id":"2002.12213","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-transfer-learning-for-zero-shot-super#ran","syntology_url":"https://syntology.ai/paper/2002.12213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12213"}},"official":{"repos":["JWSoh/MZSR"],"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-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/multi-step-model-agnostic-meta-learning","slug":"multi-step-model-agnostic-meta-learning","title":"Theoretical Convergence of Multi-Step Model-Agnostic Meta-Learning","date":"2020-02-18","arxiv_id":"2002.07836","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"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: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-step-model-agnostic-meta-learning#ran","syntology_url":"https://syntology.ai/paper/2002.07836","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07836"}},"official":{"repos":["JunjieYang97/GGS-MAML-DL","JunjieYang97/GGS-MAML-RL"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-adaptation-to-super-resolution-networks","slug":"fast-adaptation-to-super-resolution-networks","title":"Fast Adaptation to Super-Resolution Networks via Meta-Learning","date":"2020-01-09","arxiv_id":"2001.02905","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fast-adaptation-to-super-resolution-networks#ran","syntology_url":"https://syntology.ai/paper/2001.02905","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.02905"}},"official":{"repos":["parkseobin/MLSR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-new-benchmark-for-evaluation-of-cross","slug":"a-new-benchmark-for-evaluation-of-cross","title":"A Broader Study of Cross-Domain Few-Shot Learning","date":"2019-12-16","arxiv_id":"1912.07200","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"6 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-new-benchmark-for-evaluation-of-cross#ran","syntology_url":"https://syntology.ai/paper/1912.07200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.07200"}},"official":null}},{"url":"/paper/meta-learning-of-neural-architectures-for-few","slug":"meta-learning-of-neural-architectures-for-few","title":"Meta-Learning of Neural Architectures for Few-Shot Learning","date":"2019-11-25","arxiv_id":"1911.11090","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"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: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-learning-of-neural-architectures-for-few#ran","syntology_url":"https://syntology.ai/paper/1911.11090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.11090"}},"official":{"repos":["boschresearch/metanas"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-reinforced-synthetic-data-for-one-shot-1","slug":"meta-reinforced-synthetic-data-for-one-shot-1","title":"Meta-Reinforced Synthetic Data for One-Shot Fine-Grained Visual Recognition","date":"2019-11-17","arxiv_id":"1911.07164","repositories_listed":1,"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/meta-reinforced-synthetic-data-for-one-shot-1#ran","syntology_url":"https://syntology.ai/paper/1911.07164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.07164"}},"official":{"repos":["apple2373/MetaIRNet"],"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":["official"]}}},{"url":"/paper/self-supervised-learning-for-few-shot-image","slug":"self-supervised-learning-for-few-shot-image","title":"Self-Supervised Learning For Few-Shot Image Classification","date":"2019-11-14","arxiv_id":"1911.06045","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-supervised-learning-for-few-shot-image#ran","syntology_url":"https://syntology.ai/paper/1911.06045","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06045"}},"official":{"repos":["Alibaba-AAIG/SSL-FEW-SHOT"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["named_in_paper"]}}},{"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-label-correction-for-learning-with-weak-1","slug":"meta-label-correction-for-learning-with-weak-1","title":"Meta Label Correction for Noisy Label Learning","date":"2019-11-10","arxiv_id":"1911.03809","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/meta-label-correction-for-learning-with-weak-1#ran","syntology_url":"https://syntology.ai/paper/1911.03809","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03809"}},"official":{"repos":["microsoft/mlc"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/multimodal-model-agnostic-meta-learning-via","slug":"multimodal-model-agnostic-meta-learning-via","title":"Multimodal Model-Agnostic Meta-Learning via Task-Aware Modulation","date":"2019-10-30","arxiv_id":"1910.13616","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multimodal-model-agnostic-meta-learning-via#ran","syntology_url":"https://syntology.ai/paper/1910.13616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13616"}},"official":{"repos":["vuoristo/MMAML"],"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":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":6,"phrase":"7 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; 0 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/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/meta-transfer-learning-through-hard-tasks","slug":"meta-transfer-learning-through-hard-tasks","title":"Meta-Transfer Learning through Hard Tasks","date":"2019-10-07","arxiv_id":"1910.03648","repositories_listed":1,"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/meta-transfer-learning-through-hard-tasks#ran","syntology_url":"https://syntology.ai/paper/1910.03648","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03648"}},"official":{"repos":["yaoyao-liu/meta-transfer-learning"],"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":["official"]}}},{"url":"/paper/robust-few-shot-learning-with-adversarially-1","slug":"robust-few-shot-learning-with-adversarially-1","title":"Adversarially Robust Few-Shot Learning: A Meta-Learning Approach","date":"2019-10-02","arxiv_id":"1910.00982","repositories_listed":1,"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/robust-few-shot-learning-with-adversarially-1#ran","syntology_url":"https://syntology.ai/paper/1910.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00982"}},"official":{"repos":["goldblum/AdversarialQuerying"],"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":["official"]}}},{"url":"/paper/chameleon-learning-model-initializations","slug":"chameleon-learning-model-initializations","title":"Chameleon: Learning Model Initializations Across Tasks With Different Schemas","date":"2019-09-30","arxiv_id":"1909.13576","repositories_listed":1,"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/chameleon-learning-model-initializations#ran","syntology_url":"https://syntology.ai/paper/1909.13576","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.13576"}},"official":{"repos":["radrumond/Chameleon"],"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":["official"]}}},{"url":"/paper/learning-fast-adaptation-with-meta-strategy","slug":"learning-fast-adaptation-with-meta-strategy","title":"Learning Fast Adaptation with Meta Strategy Optimization","date":"2019-09-28","arxiv_id":"1909.12995","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-fast-adaptation-with-meta-strategy#ran","syntology_url":"https://syntology.ai/paper/1909.12995","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.12995"}},"official":null}},{"url":"/paper/tackling-long-tailed-relations-and-uncommon","slug":"tackling-long-tailed-relations-and-uncommon","title":"Tackling Long-Tailed Relations and Uncommon Entities in Knowledge Graph Completion","date":"2019-09-25","arxiv_id":"1909.11359","repositories_listed":1,"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/tackling-long-tailed-relations-and-uncommon#ran","syntology_url":"https://syntology.ai/paper/1909.11359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11359"}},"official":{"repos":["ZihaoWang/Few-shot-KGC"],"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":["official"]}}},{"url":"/paper/data-valuation-using-reinforcement-learning","slug":"data-valuation-using-reinforcement-learning","title":"Data Valuation using Reinforcement Learning","date":"2019-09-25","arxiv_id":"1909.11671","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-valuation-using-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/1909.11671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11671"}},"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-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/eliminating-bias-in-recommender-systems-via","slug":"eliminating-bias-in-recommender-systems-via","title":"Asymmetric Tri-training for Debiasing Missing-Not-At-Random Explicit Feedback","date":"2019-09-08","arxiv_id":"1910.01444","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/eliminating-bias-in-recommender-systems-via#ran","syntology_url":"https://syntology.ai/paper/1910.01444","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01444"}},"official":{"repos":["usaito/asymmetric-tri-rec-real"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-with-warped-gradient-descent","slug":"meta-learning-with-warped-gradient-descent","title":"Meta-Learning with Warped Gradient Descent","date":"2019-08-30","arxiv_id":"1909.00025","repositories_listed":1,"syntology":{"n":16,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/meta-learning-with-warped-gradient-descent#ran","syntology_url":"https://syntology.ai/paper/1909.00025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.00025"}},"official":{"repos":["flennerhag/warpgrad"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-learning-theory-review-an-optimal","slug":"deep-learning-theory-review-an-optimal","title":"Deep Learning Theory Review: An Optimal Control and Dynamical Systems Perspective","date":"2019-08-28","arxiv_id":"1908.10920","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/deep-learning-theory-review-an-optimal#ran","syntology_url":"https://syntology.ai/paper/1908.10920","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10920"}},"official":{"repos":["ghliu/mean-field-fcdnn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-text-classification-with","slug":"few-shot-text-classification-with","title":"Few-shot Text Classification with Distributional Signatures","date":"2019-08-16","arxiv_id":"1908.06039","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-text-classification-with#ran","syntology_url":"https://syntology.ai/paper/1908.06039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.06039"}},"official":{"repos":["YujiaBao/Distributional-Signatures"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-learning-with-global-class","slug":"few-shot-learning-with-global-class","title":"Few-Shot Learning with Global Class Representations","date":"2019-08-14","arxiv_id":"1908.05257","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-learning-with-global-class#ran","syntology_url":"https://syntology.ai/paper/1908.05257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.05257"}},"official":{"repos":["tiangeluo/fsl-global"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-prior-selection-for-repertoire-based","slug":"adaptive-prior-selection-for-repertoire-based","title":"Adaptive Prior Selection for Repertoire-based Online Adaptation in Robotics","date":"2019-07-16","arxiv_id":"1907.07029","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-prior-selection-for-repertoire-based#ran","syntology_url":"https://syntology.ai/paper/1907.07029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.07029"}},"official":{"repos":["resibots/kaushik_2019_aprol"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-representation-learning-for-out-of","slug":"few-shot-representation-learning-for-out-of","title":"Few-Shot Representation Learning for Out-Of-Vocabulary Words","date":"2019-07-01","arxiv_id":"1907.00505","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/few-shot-representation-learning-for-out-of#ran","syntology_url":"https://syntology.ai/paper/1907.00505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00505"}},"official":{"repos":["acbull/HiCE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-forget-for-meta-learning","slug":"learning-to-forget-for-meta-learning","title":"Learning to Forget for Meta-Learning","date":"2019-06-13","arxiv_id":"1906.05895","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"8 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-forget-for-meta-learning#ran","syntology_url":"https://syntology.ai/paper/1906.05895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05895"}},"official":{"repos":["baiksung/L2F"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/one-shot-neural-architecture-search-via","slug":"one-shot-neural-architecture-search-via","title":"One-Shot Neural Architecture Search via Compressive Sensing","date":"2019-06-07","arxiv_id":"1906.02869","repositories_listed":1,"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/one-shot-neural-architecture-search-via#ran","syntology_url":"https://syntology.ai/paper/1906.02869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02869"}},"official":{"repos":["chomd90/conas_release"],"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":["official"]}}},{"url":"/paper/adaptive-gradient-based-meta-learning-methods","slug":"adaptive-gradient-based-meta-learning-methods","title":"Adaptive Gradient-Based Meta-Learning Methods","date":"2019-06-06","arxiv_id":"1906.02717","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adaptive-gradient-based-meta-learning-methods#ran","syntology_url":"https://syntology.ai/paper/1906.02717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02717"}},"official":{"repos":["mkhodak/ARUBA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/190600562","slug":"190600562","title":"Learning to Self-Train for Semi-Supervised Few-Shot Classification","date":"2019-06-03","arxiv_id":"1906.00562","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190600562#ran","syntology_url":"https://syntology.ai/paper/1906.00562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00562"}},"official":{"repos":["xinzheli1217/learning-to-self-train"],"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":["official"]}}},{"url":"/paper/190600391","slug":"190600391","title":"Sequential Scenario-Specific Meta Learner for Online Recommendation","date":"2019-06-02","arxiv_id":"1906.00391","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190600391#ran","syntology_url":"https://syntology.ai/paper/1906.00391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00391"}},"official":{"repos":["THUDM/ScenarioMeta"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/subspace-networks-for-few-shot-classification","slug":"subspace-networks-for-few-shot-classification","title":"Regression Networks for Meta-Learning Few-Shot Classification","date":"2019-05-31","arxiv_id":"1905.13613","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/subspace-networks-for-few-shot-classification#ran","syntology_url":"https://syntology.ai/paper/1905.13613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13613"}},"official":{"repos":["ArnoutDevos/RegressionNet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/personalizing-dialogue-agents-via-meta","slug":"personalizing-dialogue-agents-via-meta","title":"Personalizing Dialogue Agents via Meta-Learning","date":"2019-05-24","arxiv_id":"1905.10033","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/personalizing-dialogue-agents-via-meta#ran","syntology_url":"https://syntology.ai/paper/1905.10033","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10033"}},"official":{"repos":["HLTCHKUST/PAML"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/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":6,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 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":5,"n_unverified":3,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/lgm-net-learning-to-generate-matching","slug":"lgm-net-learning-to-generate-matching","title":"LGM-Net: Learning to Generate Matching Networks for Few-Shot Learning","date":"2019-05-15","arxiv_id":"1905.06331","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lgm-net-learning-to-generate-matching#ran","syntology_url":"https://syntology.ai/paper/1905.06331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06331"}},"official":{"repos":["likesiwell/LGM-Net"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/faster-and-more-accurate-learning-with-meta","slug":"faster-and-more-accurate-learning-with-meta","title":"META-Learning State-based Eligibility Traces for More Sample-Efficient Policy Evaluation","date":"2019-04-25","arxiv_id":"1904.11439","repositories_listed":2,"syntology":{"n":14,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/faster-and-more-accurate-learning-with-meta#ran","syntology_url":"https://syntology.ai/paper/1904.11439","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.11439"}},"official":{"repos":["PwnerHarry/META","PwnerHarry/MTA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/lcc-learning-to-customize-and-combine-neural","slug":"lcc-learning-to-customize-and-combine-neural","title":"An Ensemble of Epoch-wise Empirical Bayes for Few-shot Learning","date":"2019-04-17","arxiv_id":"1904.08479","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"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; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lcc-learning-to-customize-and-combine-neural#ran","syntology_url":"https://syntology.ai/paper/1904.08479","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08479"}},"official":{"repos":["yaoyao-liu/E3BM"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tafe-net-task-aware-feature-embeddings-for-1","slug":"tafe-net-task-aware-feature-embeddings-for-1","title":"TAFE-Net: Task-Aware Feature Embeddings for Low Shot Learning","date":"2019-04-11","arxiv_id":"1904.05967","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tafe-net-task-aware-feature-embeddings-for-1#ran","syntology_url":"https://syntology.ai/paper/1904.05967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.05967"}},"official":{"repos":["ucbdrive/tafe-net"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/model-primitive-hierarchical-lifelong","slug":"model-primitive-hierarchical-lifelong","title":"Model Primitive Hierarchical Lifelong Reinforcement Learning","date":"2019-03-04","arxiv_id":"1903.01567","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/model-primitive-hierarchical-lifelong#ran","syntology_url":"https://syntology.ai/paper/1903.01567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.01567"}},"official":{"repos":["sisl/MPHRL"],"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":["official"]}}},{"url":"/paper/adversarial-attacks-on-graph-neural-networks","slug":"adversarial-attacks-on-graph-neural-networks","title":"Adversarial Attacks on Graph Neural Networks via Meta Learning","date":"2019-02-22","arxiv_id":"1902.08412","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adversarial-attacks-on-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1902.08412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.08412"}},"official":{"repos":["danielzuegner/gnn-meta-attack"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/centroid-networks-for-few-shot-clustering-and","slug":"centroid-networks-for-few-shot-clustering-and","title":"Are Few-Shot Learning Benchmarks too Simple ? Solving them without Task Supervision at Test-Time","date":"2019-02-22","arxiv_id":"1902.08605","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/centroid-networks-for-few-shot-clustering-and#ran","syntology_url":"https://syntology.ai/paper/1902.08605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.08605"}},"official":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/adaptive-cross-modal-few-shot-learning","slug":"adaptive-cross-modal-few-shot-learning","title":"Adaptive Cross-Modal Few-Shot Learning","date":"2019-02-19","arxiv_id":"1902.07104","repositories_listed":1,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adaptive-cross-modal-few-shot-learning#ran","syntology_url":"https://syntology.ai/paper/1902.07104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07104"}},"official":null}},{"url":"/paper/task2vec-task-embedding-for-meta-learning","slug":"task2vec-task-embedding-for-meta-learning","title":"Task2Vec: Task Embedding for Meta-Learning","date":"2019-02-10","arxiv_id":"1902.03545","repositories_listed":1,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/task2vec-task-embedding-for-meta-learning#ran","syntology_url":"https://syntology.ai/paper/1902.03545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.03545"}},"official":null}},{"url":"/paper/meta-particle-flow-for-sequential-bayesian","slug":"meta-particle-flow-for-sequential-bayesian","title":"Particle Flow Bayes' Rule","date":"2019-02-02","arxiv_id":"1902.00640","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/meta-particle-flow-for-sequential-bayesian#ran","syntology_url":"https://syntology.ai/paper/1902.00640","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00640"}},"official":null}},{"url":"/paper/a-meta-transfer-objective-for-learning-to","slug":"a-meta-transfer-objective-for-learning-to","title":"A Meta-Transfer Objective for Learning to Disentangle Causal Mechanisms","date":"2019-01-30","arxiv_id":"1901.10912","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/a-meta-transfer-objective-for-learning-to#ran","syntology_url":"https://syntology.ai/paper/1901.10912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10912"}},"official":{"repos":["authors-1901-10912/A-Meta-Transfer-Objective-For-Learning-To-Disentangle-Causal-Mechanisms","ec6dde01667145e58de60f864e05a4/CausalOptimizationAnon"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/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/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/learning-to-learn-how-to-learn-self-adaptive","slug":"learning-to-learn-how-to-learn-self-adaptive","title":"Learning to Learn How to Learn: Self-Adaptive Visual Navigation Using Meta-Learning","date":"2018-12-03","arxiv_id":"1812.00971","repositories_listed":2,"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/learning-to-learn-how-to-learn-self-adaptive#ran","syntology_url":"https://syntology.ai/paper/1812.00971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.00971"}},"official":{"repos":["allenai/savn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/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/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/truncated-back-propagation-for-bilevel","slug":"truncated-back-propagation-for-bilevel","title":"Truncated Back-propagation for Bilevel Optimization","date":"2018-10-25","arxiv_id":"1810.10667","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/truncated-back-propagation-for-bilevel#ran","syntology_url":"https://syntology.ai/paper/1810.10667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.10667"}},"official":null}},{"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/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/incremental-few-shot-learning-with-attention","slug":"incremental-few-shot-learning-with-attention","title":"Incremental Few-Shot Learning with Attention Attractor Networks","date":"2018-10-16","arxiv_id":"1810.07218","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/incremental-few-shot-learning-with-attention#ran","syntology_url":"https://syntology.ai/paper/1810.07218","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.07218"}},"official":{"repos":["renmengye/inc-few-shot-attractor-public"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"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/fast-context-adaptation-via-meta-learning","slug":"fast-context-adaptation-via-meta-learning","title":"Fast Context Adaptation via Meta-Learning","date":"2018-10-08","arxiv_id":"1810.03642","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/fast-context-adaptation-via-meta-learning#ran","syntology_url":"https://syntology.ai/paper/1810.03642","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.03642"}},"official":{"repos":["lmzintgraf/cavia"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fine-grained-visual-categorization-using-meta","slug":"fine-grained-visual-categorization-using-meta","title":"Fine-Grained Visual Categorization using Meta-Learning Optimization with Sample Selection of Auxiliary Data","date":"2018-07-28","arxiv_id":"1807.10916","repositories_listed":2,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/fine-grained-visual-categorization-using-meta#ran","syntology_url":"https://syntology.ai/paper/1807.10916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.10916"}},"official":null}},{"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"]}}}],"record_sha256":"10fdfe2e27d0e0920ba99c58f43c013589d2394410a1518fe7a605ce26bbd618","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}