{"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/2","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":2,"pages_in_order":5,"rows_per_page":100,"rows":[101,200],"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/1","next":"/task/meta-learning/papers/ran/3","papers":[{"url":"/paper/you-can-backdoor-personalized-federated","slug":"you-can-backdoor-personalized-federated","title":"You Can Backdoor Personalized Federated Learning","date":"2023-07-29","arxiv_id":"2307.15971","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"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 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) · 0 unverified","sample_list":"/paper/you-can-backdoor-personalized-federated#ran","syntology_url":"https://syntology.ai/paper/2307.15971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.15971"}},"official":{"repos":["bapfl/code"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-unsupervised-deep-outlier-model","slug":"fast-unsupervised-deep-outlier-model","title":"Fast Unsupervised Deep Outlier Model Selection with Hypernetworks","date":"2023-07-20","arxiv_id":"2307.10529","repositories_listed":1,"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":5,"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/fast-unsupervised-deep-outlier-model#ran","syntology_url":"https://syntology.ai/paper/2307.10529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.10529"}},"official":{"repos":["xyvivian/hyper"],"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/towards-federated-foundation-models-scalable-1","slug":"towards-federated-foundation-models-scalable-1","title":"Towards Federated Foundation Models: Scalable Dataset Pipelines for Group-Structured Learning","date":"2023-07-18","arxiv_id":"2307.09619","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/towards-federated-foundation-models-scalable-1#ran","syntology_url":"https://syntology.ai/paper/2307.09619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09619"}},"official":{"repos":["google-research/dataset_grouper"],"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/malibo-meta-learning-for-likelihood-free","slug":"malibo-meta-learning-for-likelihood-free","title":"MALIBO: Meta-learning for Likelihood-free Bayesian Optimization","date":"2023-07-07","arxiv_id":"2307.03565","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/malibo-meta-learning-for-likelihood-free#ran","syntology_url":"https://syntology.ai/paper/2307.03565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.03565"}},"official":{"repos":["boschresearch/meta-learning-likelihood-free-bayesian-optimization"],"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/first-explore-then-exploit-meta-learning","slug":"first-explore-then-exploit-meta-learning","title":"First-Explore, then Exploit: Meta-Learning to Solve Hard Exploration-Exploitation Trade-Offs","date":"2023-07-05","arxiv_id":"2307.02276","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/first-explore-then-exploit-meta-learning#ran","syntology_url":"https://syntology.ai/paper/2307.02276","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.02276"}},"official":{"repos":["btnorman/First-Explore"],"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":["official"]}}},{"url":"/paper/graph-sampling-based-meta-learning-for","slug":"graph-sampling-based-meta-learning-for","title":"Graph Sampling-based Meta-Learning for Molecular Property Prediction","date":"2023-06-29","arxiv_id":"2306.16780","repositories_listed":1,"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":3,"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/graph-sampling-based-meta-learning-for#ran","syntology_url":"https://syntology.ai/paper/2306.16780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.16780"}},"official":{"repos":["hicai-zju/gs-meta"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-episode-generation-for-graph","slug":"unsupervised-episode-generation-for-graph","title":"Unsupervised Episode Generation for Graph Meta-learning","date":"2023-06-27","arxiv_id":"2306.15217","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unsupervised-episode-generation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2306.15217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.15217"}},"official":{"repos":["jhngjng/naq-pytorch"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/protodiff-learning-to-learn-prototypical-1","slug":"protodiff-learning-to-learn-prototypical-1","title":"ProtoDiff: Learning to Learn Prototypical Networks by Task-Guided Diffusion","date":"2023-06-26","arxiv_id":"2306.14770","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"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, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/protodiff-learning-to-learn-prototypical-1#ran","syntology_url":"https://syntology.ai/paper/2306.14770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.14770"}},"official":{"repos":["ydu-uva/protodiff"],"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","unlocated"]}}},{"url":"/paper/evading-forensic-classifiers-with-attribute-1","slug":"evading-forensic-classifiers-with-attribute-1","title":"Evading Forensic Classifiers with Attribute-Conditioned Adversarial Faces","date":"2023-06-22","arxiv_id":"2306.13091","repositories_listed":1,"syntology":{"n":20,"n_ran":12,"n_constructed":7,"n_ran_checked":9,"n_instrument":3,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":20,"phrase":"12 ran (of which 7 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) · 8 unverified","sample_list":"/paper/evading-forensic-classifiers-with-attribute-1#ran","syntology_url":"https://syntology.ai/paper/2306.13091","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.13091"}},"official":{"repos":["koushiksrivats/face_attribute_attack"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":7,"n_ran_no_instrument_failure":9,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-multi-teacher-knowledge-distillation","slug":"adaptive-multi-teacher-knowledge-distillation","title":"Adaptive Multi-Teacher Knowledge Distillation with Meta-Learning","date":"2023-06-11","arxiv_id":"2306.06634","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/adaptive-multi-teacher-knowledge-distillation#ran","syntology_url":"https://syntology.ai/paper/2306.06634","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.06634"}},"official":{"repos":["rorozhl/mmkd"],"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/in-context-learning-through-the-bayesian","slug":"in-context-learning-through-the-bayesian","title":"In-Context Learning through the Bayesian Prism","date":"2023-06-08","arxiv_id":"2306.04891","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/in-context-learning-through-the-bayesian#ran","syntology_url":"https://syntology.ai/paper/2306.04891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04891"}},"official":{"repos":["mdrpanwar/icl-bayesian-prism"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-sage-scale-meta-learning-scheduled","slug":"meta-sage-scale-meta-learning-scheduled","title":"Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimization","date":"2023-06-05","arxiv_id":"2306.02688","repositories_listed":1,"syntology":{"n":7,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":7,"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) · 6 unverified","sample_list":"/paper/meta-sage-scale-meta-learning-scheduled#ran","syntology_url":"https://syntology.ai/paper/2306.02688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02688"}},"official":{"repos":["kaist-silab/meta-sage"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/tart-improved-few-shot-text-classification","slug":"tart-improved-few-shot-text-classification","title":"TART: Improved Few-shot Text Classification Using Task-Adaptive Reference Transformation","date":"2023-06-03","arxiv_id":"2306.02175","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/tart-improved-few-shot-text-classification#ran","syntology_url":"https://syntology.ai/paper/2306.02175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02175"}},"official":{"repos":["slei109/tart"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-omni-generalizable-neural-methods-for","slug":"towards-omni-generalizable-neural-methods-for","title":"Towards Omni-generalizable Neural Methods for Vehicle Routing Problems","date":"2023-05-31","arxiv_id":"2305.19587","repositories_listed":1,"syntology":{"n":22,"n_ran":13,"n_constructed":3,"n_ran_checked":8,"n_instrument":5,"n_unverified":9,"n_honours":3,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"13 ran (of which 3 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/towards-omni-generalizable-neural-methods-for#ran","syntology_url":"https://syntology.ai/paper/2305.19587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19587"}},"official":{"repos":["royalskye/omni-vrp"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":3,"n_ran_no_instrument_failure":8,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/task-equivariant-graph-few-shot-learning","slug":"task-equivariant-graph-few-shot-learning","title":"Task-Equivariant Graph Few-shot Learning","date":"2023-05-30","arxiv_id":"2305.18758","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/task-equivariant-graph-few-shot-learning#ran","syntology_url":"https://syntology.ai/paper/2305.18758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18758"}},"official":{"repos":["sung-won-kim/teg"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/taylorformer-probabilistic-predictions-for","slug":"taylorformer-probabilistic-predictions-for","title":"Taylorformer: Probabilistic Modelling for Random Processes including Time Series","date":"2023-05-30","arxiv_id":"2305.19141","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/taylorformer-probabilistic-predictions-for#ran","syntology_url":"https://syntology.ai/paper/2305.19141","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19141"}},"official":{"repos":["oremnirv/taylorformer"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":5,"ran_from_kinds":["community","official","unlocated"]}}},{"url":"/paper/meta-prediction-model-for-distillation-aware","slug":"meta-prediction-model-for-distillation-aware","title":"Meta-prediction Model for Distillation-Aware NAS on Unseen Datasets","date":"2023-05-26","arxiv_id":"2305.16948","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":9,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/meta-prediction-model-for-distillation-aware#ran","syntology_url":"https://syntology.ai/paper/2305.16948","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16948"}},"official":{"repos":["cownowan/dass"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/im-promptu-in-context-composition-from-image-1","slug":"im-promptu-in-context-composition-from-image-1","title":"Im-Promptu: In-Context Composition from Image Prompts","date":"2023-05-26","arxiv_id":"2305.17262","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/im-promptu-in-context-composition-from-image-1#ran","syntology_url":"https://syntology.ai/paper/2305.17262","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17262"}},"official":null}},{"url":"/paper/meta-learning-online-adaptation-of-language","slug":"meta-learning-online-adaptation-of-language","title":"Meta-Learning Online Adaptation of Language Models","date":"2023-05-24","arxiv_id":"2305.15076","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-learning-online-adaptation-of-language#ran","syntology_url":"https://syntology.ai/paper/2305.15076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15076"}},"official":{"repos":["nathanhu0/CaMeLS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-convergence-and-generalization","slug":"improving-convergence-and-generalization","title":"Improving Convergence and Generalization Using Parameter Symmetries","date":"2023-05-22","arxiv_id":"2305.13404","repositories_listed":1,"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":2,"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/improving-convergence-and-generalization#ran","syntology_url":"https://syntology.ai/paper/2305.13404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13404"}},"official":{"repos":["rose-stl-lab/teleportation-optimization"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/metamodulation-learning-variational-feature","slug":"metamodulation-learning-variational-feature","title":"MetaModulation: Learning Variational Feature Hierarchies for Few-Shot Learning with Fewer Tasks","date":"2023-05-17","arxiv_id":"2305.10309","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":1,"n_ran_checked":1,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"5 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/metamodulation-learning-variational-feature#ran","syntology_url":"https://syntology.ai/paper/2305.10309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10309"}},"official":{"repos":["lmsdss/metamodulation"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/model-agnostic-measure-of-generalization","slug":"model-agnostic-measure-of-generalization","title":"Model-agnostic Measure of Generalization Difficulty","date":"2023-05-01","arxiv_id":"2305.01034","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/model-agnostic-measure-of-generalization#ran","syntology_url":"https://syntology.ai/paper/2305.01034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.01034"}},"official":{"repos":["fietelab/inductive-bias-complexity"],"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/meta-optimized-contrastive-learning-for","slug":"meta-optimized-contrastive-learning-for","title":"Meta-optimized Contrastive Learning for Sequential Recommendation","date":"2023-04-16","arxiv_id":"2304.07763","repositories_listed":1,"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":1,"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/meta-optimized-contrastive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2304.07763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.07763"}},"official":{"repos":["qinhsiu/mclrec"],"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/meta-learning-with-a-geometry-adaptive","slug":"meta-learning-with-a-geometry-adaptive","title":"Meta-Learning with a Geometry-Adaptive Preconditioner","date":"2023-04-04","arxiv_id":"2304.01552","repositories_listed":1,"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/meta-learning-with-a-geometry-adaptive#ran","syntology_url":"https://syntology.ai/paper/2304.01552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.01552"}},"official":{"repos":["suhyun777/cvpr23-gap"],"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/meta-learning-control-variates-variance","slug":"meta-learning-control-variates-variance","title":"Meta-learning Control Variates: Variance Reduction with Limited Data","date":"2023-03-08","arxiv_id":"2303.04756","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/meta-learning-control-variates-variance#ran","syntology_url":"https://syntology.ai/paper/2303.04756","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.04756"}},"official":{"repos":["jz-fun/meta_control_variates"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/structured-state-space-models-for-in-context-1","slug":"structured-state-space-models-for-in-context-1","title":"Structured State Space Models for In-Context Reinforcement Learning","date":"2023-03-07","arxiv_id":"2303.03982","repositories_listed":2,"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/structured-state-space-models-for-in-context-1#ran","syntology_url":"https://syntology.ai/paper/2303.03982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.03982"}},"official":{"repos":["luchris429/popjaxrl","luchris429/s5rl"],"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/stunt-few-shot-tabular-learning-with-self","slug":"stunt-few-shot-tabular-learning-with-self","title":"STUNT: Few-shot Tabular Learning with Self-generated Tasks from Unlabeled Tables","date":"2023-03-02","arxiv_id":"2303.00918","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/stunt-few-shot-tabular-learning-with-self#ran","syntology_url":"https://syntology.ai/paper/2303.00918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.00918"}},"official":{"repos":["jaehyun513/stunt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-to-bridge-vision-and-language","slug":"meta-learning-to-bridge-vision-and-language","title":"Meta Learning to Bridge Vision and Language Models for Multimodal Few-Shot Learning","date":"2023-02-28","arxiv_id":"2302.14794","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-learning-to-bridge-vision-and-language#ran","syntology_url":"https://syntology.ai/paper/2302.14794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.14794"}},"official":{"repos":["ivonajdenkoska/multimodal-meta-learn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cmvae-causal-meta-vae-for-unsupervised-meta","slug":"cmvae-causal-meta-vae-for-unsupervised-meta","title":"CMVAE: Causal Meta VAE for Unsupervised Meta-Learning","date":"2023-02-20","arxiv_id":"2302.09731","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/cmvae-causal-meta-vae-for-unsupervised-meta#ran","syntology_url":"https://syntology.ai/paper/2302.09731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.09731"}},"official":{"repos":["guodongqi/cmvae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-album-multi-domain-meta-dataset-for-few-1","slug":"meta-album-multi-domain-meta-dataset-for-few-1","title":"Meta-Album: Multi-domain Meta-Dataset for Few-Shot Image Classification","date":"2023-02-16","arxiv_id":"2302.08909","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-album-multi-domain-meta-dataset-for-few-1#ran","syntology_url":"https://syntology.ai/paper/2302.08909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08909"}},"official":{"repos":["dustincarrion/cd-metadl","ihsaan-ullah/meta-album","ihsanullah2131/meta-album"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-penalty-based-bilevel-gradient-descent","slug":"on-penalty-based-bilevel-gradient-descent","title":"On Penalty-based Bilevel Gradient Descent Method","date":"2023-02-10","arxiv_id":"2302.05185","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":3,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 3 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-penalty-based-bilevel-gradient-descent#ran","syntology_url":"https://syntology.ai/paper/2302.05185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.05185"}},"official":{"repos":["hanshen95/penalized-bilevel-gradient-descent"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/memory-based-meta-learning-on-non-stationary","slug":"memory-based-meta-learning-on-non-stationary","title":"Memory-Based Meta-Learning on Non-Stationary Distributions","date":"2023-02-06","arxiv_id":"2302.03067","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"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) · 3 unverified","sample_list":"/paper/memory-based-meta-learning-on-non-stationary#ran","syntology_url":"https://syntology.ai/paper/2302.03067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03067"}},"official":{"repos":["deepmind/nonstationary_mbml"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-optimize-for-reinforcement","slug":"learning-to-optimize-for-reinforcement","title":"Learning to Optimize for Reinforcement Learning","date":"2023-02-03","arxiv_id":"2302.01470","repositories_listed":1,"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-to-optimize-for-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2302.01470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01470"}},"official":{"repos":["sail-sg/optim4rl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-meta-learning-for-partially","slug":"contrastive-meta-learning-for-partially","title":"Contrastive Meta-Learning for Partially Observable Few-Shot Learning","date":"2023-01-30","arxiv_id":"2301.13136","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"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 3 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; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/contrastive-meta-learning-for-partially#ran","syntology_url":"https://syntology.ai/paper/2301.13136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.13136"}},"official":{"repos":["adamjelley/poem"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-node-classification-with-extremely","slug":"few-shot-node-classification-with-extremely","title":"Few-shot Node Classification with Extremely Weak Supervision","date":"2023-01-06","arxiv_id":"2301.02708","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"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: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-node-classification-with-extremely#ran","syntology_url":"https://syntology.ai/paper/2301.02708","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.02708"}},"official":{"repos":["songw-sw/x-fnc"],"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","unlocated"]}}},{"url":"/paper/robust-meta-representation-learning-via","slug":"robust-meta-representation-learning-via","title":"Robust Meta-Representation Learning via Global Label Inference and Classification","date":"2022-12-22","arxiv_id":"2212.11702","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/robust-meta-representation-learning-via#ran","syntology_url":"https://syntology.ai/paper/2212.11702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.11702"}},"official":{"repos":["isakfalk/mela"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/are-deep-neural-networks-smarter-than-second","slug":"are-deep-neural-networks-smarter-than-second","title":"Are Deep Neural Networks SMARTer than Second Graders?","date":"2022-12-20","arxiv_id":"2212.09993","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/are-deep-neural-networks-smarter-than-second#ran","syntology_url":"https://syntology.ai/paper/2212.09993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09993"}},"official":{"repos":["merlresearch/SMART"],"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/asynchronous-distributed-bilevel-optimization","slug":"asynchronous-distributed-bilevel-optimization","title":"Asynchronous Distributed Bilevel Optimization","date":"2022-12-20","arxiv_id":"2212.10048","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/asynchronous-distributed-bilevel-optimization#ran","syntology_url":"https://syntology.ai/paper/2212.10048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10048"}},"official":{"repos":["iclr23submission6251/adbo"],"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":["official"]}}},{"url":"/paper/transformers-learn-in-context-by-gradient","slug":"transformers-learn-in-context-by-gradient","title":"Transformers learn in-context by gradient descent","date":"2022-12-15","arxiv_id":"2212.07677","repositories_listed":2,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/transformers-learn-in-context-by-gradient#ran","syntology_url":"https://syntology.ai/paper/2212.07677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.07677"}},"official":{"repos":["google-research/self-organising-systems"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/metaportrait-identity-preserving-talking-head","slug":"metaportrait-identity-preserving-talking-head","title":"MetaPortrait: Identity-Preserving Talking Head Generation with Fast Personalized Adaptation","date":"2022-12-15","arxiv_id":"2212.08062","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/metaportrait-identity-preserving-talking-head#ran","syntology_url":"https://syntology.ai/paper/2212.08062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.08062"}},"official":{"repos":["Meta-Portrait/MetaPortrait"],"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-destructing-models-increasing-the-costs","slug":"self-destructing-models-increasing-the-costs","title":"Self-Destructing Models: Increasing the Costs of Harmful Dual Uses of Foundation Models","date":"2022-11-27","arxiv_id":"2211.14946","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/self-destructing-models-increasing-the-costs#ran","syntology_url":"https://syntology.ai/paper/2211.14946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14946"}},"official":{"repos":["breakend/selfdestructingmodels"],"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/synergies-between-disentanglement-and","slug":"synergies-between-disentanglement-and","title":"Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learning","date":"2022-11-26","arxiv_id":"2211.14666","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":2,"phrase":"12 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/synergies-between-disentanglement-and#ran","syntology_url":"https://syntology.ai/paper/2211.14666","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14666"}},"official":{"repos":["tristandeleu/synergies-disentanglement-sparsity"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/generalizable-implicit-neural-representations","slug":"generalizable-implicit-neural-representations","title":"Generalizable Implicit Neural Representations via Instance Pattern Composers","date":"2022-11-23","arxiv_id":"2211.13223","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/generalizable-implicit-neural-representations#ran","syntology_url":"https://syntology.ai/paper/2211.13223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.13223"}},"official":{"repos":["kakaobrain/ginr-ipc"],"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/tuning-language-models-as-training-data","slug":"tuning-language-models-as-training-data","title":"Tuning Language Models as Training Data Generators for Augmentation-Enhanced Few-Shot Learning","date":"2022-11-06","arxiv_id":"2211.03044","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tuning-language-models-as-training-data#ran","syntology_url":"https://syntology.ai/paper/2211.03044","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03044"}},"official":{"repos":["yumeng5/fewgen"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/toward-unsupervised-outlier-model-selection","slug":"toward-unsupervised-outlier-model-selection","title":"Toward Unsupervised Outlier Model Selection","date":"2022-11-03","arxiv_id":"2211.01834","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/toward-unsupervised-outlier-model-selection#ran","syntology_url":"https://syntology.ai/paper/2211.01834","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.01834"}},"official":{"repos":["yzhao062/elect"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mars-meta-learning-as-score-matching-in-the","slug":"mars-meta-learning-as-score-matching-in-the","title":"MARS: Meta-Learning as Score Matching in the Function Space","date":"2022-10-24","arxiv_id":"2210.13319","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"4 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mars-meta-learning-as-score-matching-in-the#ran","syntology_url":"https://syntology.ai/paper/2210.13319","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13319"}},"official":{"repos":["krunolp/mars"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["community","official","unlocated"]}}},{"url":"/paper/few-shot-relational-reasoning-via-connection","slug":"few-shot-relational-reasoning-via-connection","title":"Few-shot Relational Reasoning via Connection Subgraph Pretraining","date":"2022-10-13","arxiv_id":"2210.06722","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/few-shot-relational-reasoning-via-connection#ran","syntology_url":"https://syntology.ai/paper/2210.06722","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06722"}},"official":{"repos":["snap-stanford/csr"],"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/multi-task-meta-learning-learn-how-to-adapt","slug":"multi-task-meta-learning-learn-how-to-adapt","title":"Multi-Task Meta Learning: learn how to adapt to unseen tasks","date":"2022-10-13","arxiv_id":"2210.06989","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/multi-task-meta-learning-learn-how-to-adapt#ran","syntology_url":"https://syntology.ai/paper/2210.06989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06989"}},"official":{"repos":["ricupa/mtml-learn-how-to-adapt-to-unseen-tasks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-dmoe-adapting-to-domain-shift-by-meta","slug":"meta-dmoe-adapting-to-domain-shift-by-meta","title":"Meta-DMoE: Adapting to Domain Shift by Meta-Distillation from Mixture-of-Experts","date":"2022-10-08","arxiv_id":"2210.03885","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/meta-dmoe-adapting-to-domain-shift-by-meta#ran","syntology_url":"https://syntology.ai/paper/2210.03885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03885"}},"official":{"repos":["n3il666/meta-dmoe"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/dimes-a-differentiable-meta-solver-for","slug":"dimes-a-differentiable-meta-solver-for","title":"DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems","date":"2022-10-08","arxiv_id":"2210.04123","repositories_listed":1,"syntology":{"n":25,"n_ran":10,"n_constructed":1,"n_ran_checked":1,"n_instrument":9,"n_unverified":15,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"10 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; 9 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/dimes-a-differentiable-meta-solver-for#ran","syntology_url":"https://syntology.ai/paper/2210.04123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.04123"}},"official":{"repos":["dimesteam/dimes"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":15,"ran_from_kinds":["official"]}}},{"url":"/paper/expanding-the-deployment-envelope-of-behavior","slug":"expanding-the-deployment-envelope-of-behavior","title":"Expanding the Deployment Envelope of Behavior Prediction via Adaptive Meta-Learning","date":"2022-09-23","arxiv_id":"2209.11820","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/expanding-the-deployment-envelope-of-behavior#ran","syntology_url":"https://syntology.ai/paper/2209.11820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.11820"}},"official":{"repos":["nvlabs/adaptive-prediction","nvr-avg/adaptive-prediction"],"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/learning-to-weight-samples-for-dynamic-early","slug":"learning-to-weight-samples-for-dynamic-early","title":"Learning to Weight Samples for Dynamic Early-exiting Networks","date":"2022-09-17","arxiv_id":"2209.08310","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-to-weight-samples-for-dynamic-early#ran","syntology_url":"https://syntology.ai/paper/2209.08310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08310"}},"official":{"repos":["leaplabthu/l2w-den"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-with-less-forgetting-on-large","slug":"meta-learning-with-less-forgetting-on-large","title":"Meta-Learning with Less Forgetting on Large-Scale Non-Stationary Task Distributions","date":"2022-09-03","arxiv_id":"2209.01501","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meta-learning-with-less-forgetting-on-large#ran","syntology_url":"https://syntology.ai/paper/2209.01501","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.01501"}},"official":null}},{"url":"/paper/anti-retroactive-interference-for-lifelong","slug":"anti-retroactive-interference-for-lifelong","title":"Anti-Retroactive Interference for Lifelong Learning","date":"2022-08-27","arxiv_id":"2208.12967","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"1 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; 0 where Syntology's instrument failed) · 4 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/anti-retroactive-interference-for-lifelong#ran","syntology_url":"https://syntology.ai/paper/2208.12967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.12967"}},"official":{"repos":["bhrqw/ari"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/wasserstein-task-embedding-for-measuring-task","slug":"wasserstein-task-embedding-for-measuring-task","title":"Wasserstein Task Embedding for Measuring Task Similarities","date":"2022-08-24","arxiv_id":"2208.11726","repositories_listed":2,"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/wasserstein-task-embedding-for-measuring-task#ran","syntology_url":"https://syntology.ai/paper/2208.11726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.11726"}},"official":{"repos":["xinranliueva/Wasserstein-Task-Embedding"],"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-generalize-with-object-centric","slug":"learning-to-generalize-with-object-centric","title":"Learning to Generalize with Object-centric Agents in the Open World Survival Game Crafter","date":"2022-08-05","arxiv_id":"2208.03374","repositories_listed":1,"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":0,"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-generalize-with-object-centric#ran","syntology_url":"https://syntology.ai/paper/2208.03374","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.03374"}},"official":{"repos":["astanic/crafter-ood"],"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/transformers-as-meta-learners-for-implicit","slug":"transformers-as-meta-learners-for-implicit","title":"Transformers as Meta-Learners for Implicit Neural Representations","date":"2022-08-04","arxiv_id":"2208.02801","repositories_listed":1,"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/transformers-as-meta-learners-for-implicit#ran","syntology_url":"https://syntology.ai/paper/2208.02801","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.02801"}},"official":{"repos":["yinboc/trans-inr"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/artfid-quantitative-evaluation-of-neural","slug":"artfid-quantitative-evaluation-of-neural","title":"ArtFID: Quantitative Evaluation of Neural Style Transfer","date":"2022-07-25","arxiv_id":"2207.12280","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/artfid-quantitative-evaluation-of-neural#ran","syntology_url":"https://syntology.ai/paper/2207.12280","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.12280"}},"official":{"repos":["matthias-wright/art-fid"],"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":["unlocated"]}}},{"url":"/paper/test-time-adaptation-via-conjugate-pseudo","slug":"test-time-adaptation-via-conjugate-pseudo","title":"Test-Time Adaptation via Conjugate Pseudo-labels","date":"2022-07-20","arxiv_id":"2207.09640","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/test-time-adaptation-via-conjugate-pseudo#ran","syntology_url":"https://syntology.ai/paper/2207.09640","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09640"}},"official":{"repos":["locuslab/tta_conjugate"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/bitwidth-adaptive-quantization-aware-neural","slug":"bitwidth-adaptive-quantization-aware-neural","title":"Bitwidth-Adaptive Quantization-Aware Neural Network Training: A Meta-Learning Approach","date":"2022-07-20","arxiv_id":"2207.10188","repositories_listed":1,"syntology":{"n":9,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":9,"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) · 8 unverified","sample_list":"/paper/bitwidth-adaptive-quantization-aware-neural#ran","syntology_url":"https://syntology.ai/paper/2207.10188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10188"}},"official":{"repos":["jsjs0369/MEBQAT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/deeptime-deep-time-index-meta-learning-for","slug":"deeptime-deep-time-index-meta-learning-for","title":"Learning Deep Time-index Models for Time Series Forecasting","date":"2022-07-13","arxiv_id":"2207.06046","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/deeptime-deep-time-index-meta-learning-for#ran","syntology_url":"https://syntology.ai/paper/2207.06046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06046"}},"official":{"repos":["salesforce/deeptime"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/transformer-neural-processes-uncertainty","slug":"transformer-neural-processes-uncertainty","title":"Transformer Neural Processes: Uncertainty-Aware Meta Learning Via Sequence Modeling","date":"2022-07-09","arxiv_id":"2207.04179","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/transformer-neural-processes-uncertainty#ran","syntology_url":"https://syntology.ai/paper/2207.04179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.04179"}},"official":{"repos":["tung-nd/tnp-pytorch"],"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-the-difference-preparing-large","slug":"meta-learning-the-difference-preparing-large","title":"Meta-Learning the Difference: Preparing Large Language Models for Efficient Adaptation","date":"2022-07-07","arxiv_id":"2207.03509","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":0,"n_no_contract":5,"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, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/meta-learning-the-difference-preparing-large#ran","syntology_url":"https://syntology.ai/paper/2207.03509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.03509"}},"official":{"repos":["amazon-research/meta-learning-the-difference"],"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/a-unified-meta-learning-framework-for-dynamic","slug":"a-unified-meta-learning-framework-for-dynamic","title":"A Unified Meta-Learning Framework for Dynamic Transfer Learning","date":"2022-07-05","arxiv_id":"2207.01784","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-unified-meta-learning-framework-for-dynamic#ran","syntology_url":"https://syntology.ai/paper/2207.01784","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01784"}},"official":{"repos":["jwu4sml/l2e"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-a-real-time-tabular-automl","slug":"meta-learning-a-real-time-tabular-automl","title":"TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Second","date":"2022-07-05","arxiv_id":"2207.01848","repositories_listed":7,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-learning-a-real-time-tabular-automl#ran","syntology_url":"https://syntology.ai/paper/2207.01848","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01848"}},"official":null}},{"url":"/paper/the-least-control-principle-for-learning-at","slug":"the-least-control-principle-for-learning-at","title":"The least-control principle for local learning at equilibrium","date":"2022-07-04","arxiv_id":"2207.01332","repositories_listed":1,"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":4,"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/the-least-control-principle-for-learning-at#ran","syntology_url":"https://syntology.ai/paper/2207.01332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01332"}},"official":{"repos":["seijin-kobayashi/least-control"],"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/on-the-generalizability-and-predictability-of","slug":"on-the-generalizability-and-predictability-of","title":"On the Generalizability and Predictability of Recommender Systems","date":"2022-06-23","arxiv_id":"2206.11886","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":4,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-the-generalizability-and-predictability-of#ran","syntology_url":"https://syntology.ai/paper/2206.11886","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11886"}},"official":{"repos":["naszilla/reczilla"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/msanet-multi-similarity-and-attention-1","slug":"msanet-multi-similarity-and-attention-1","title":"MSANet: Multi-Similarity and Attention Guidance for Boosting Few-Shot Segmentation","date":"2022-06-20","arxiv_id":"2206.09667","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/msanet-multi-similarity-and-attention-1#ran","syntology_url":"https://syntology.ai/paper/2206.09667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09667"}},"official":{"repos":["AIVResearch/MSANet"],"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":["unlocated"]}}},{"url":"/paper/autogml-fast-automatic-model-selection-for","slug":"autogml-fast-automatic-model-selection-for","title":"MetaGL: Evaluation-Free Selection of Graph Learning Models via Meta-Learning","date":"2022-06-18","arxiv_id":"2206.09280","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/autogml-fast-automatic-model-selection-for#ran","syntology_url":"https://syntology.ai/paper/2206.09280","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09280"}},"official":{"repos":["namyongpark/metagl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fit-parameter-efficient-few-shot-transfer","slug":"fit-parameter-efficient-few-shot-transfer","title":"FiT: Parameter Efficient Few-shot Transfer Learning for Personalized and Federated Image Classification","date":"2022-06-17","arxiv_id":"2206.08671","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fit-parameter-efficient-few-shot-transfer#ran","syntology_url":"https://syntology.ai/paper/2206.08671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08671"}},"official":{"repos":["cambridge-mlg/fit"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-finite-width-neural-tangent-kernel-1","slug":"fast-finite-width-neural-tangent-kernel-1","title":"Fast Finite Width Neural Tangent Kernel","date":"2022-06-17","arxiv_id":"2206.08720","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/fast-finite-width-neural-tangent-kernel-1#ran","syntology_url":"https://syntology.ai/paper/2206.08720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08720"}},"official":{"repos":["google/neural-tangents","iclr2022anon/fast_finite_width_ntk"],"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":["official"]}}},{"url":"/paper/comprehensive-fair-meta-learned-recommender","slug":"comprehensive-fair-meta-learned-recommender","title":"Comprehensive Fair Meta-learned Recommender System","date":"2022-06-09","arxiv_id":"2206.04789","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/comprehensive-fair-meta-learned-recommender#ran","syntology_url":"https://syntology.ai/paper/2206.04789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04789"}},"official":{"repos":["weitianxin/CLOVER"],"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/meta-learning-transferable-parameterized","slug":"meta-learning-transferable-parameterized","title":"Meta-Learning Parameterized Skills","date":"2022-06-07","arxiv_id":"2206.03597","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-learning-transferable-parameterized#ran","syntology_url":"https://syntology.ai/paper/2206.03597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03597"}},"official":{"repos":["minusadd/meta-learning-parameterized-skills"],"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":["unlocated"]}}},{"url":"/paper/gensdf-two-stage-learning-of-generalizable","slug":"gensdf-two-stage-learning-of-generalizable","title":"GenSDF: Two-Stage Learning of Generalizable Signed Distance Functions","date":"2022-06-06","arxiv_id":"2206.02780","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/gensdf-two-stage-learning-of-generalizable#ran","syntology_url":"https://syntology.ai/paper/2206.02780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02780"}},"official":{"repos":["princeton-computational-imaging/gensdf"],"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/spatio-temporal-graph-few-shot-learning-with","slug":"spatio-temporal-graph-few-shot-learning-with","title":"Spatio-Temporal Graph Few-Shot Learning with Cross-City Knowledge Transfer","date":"2022-05-27","arxiv_id":"2205.13947","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":1,"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/spatio-temporal-graph-few-shot-learning-with#ran","syntology_url":"https://syntology.ai/paper/2205.13947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13947"}},"official":{"repos":["robinlu1209/st-gfsl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/collaborative-distillation-meta-learning-for","slug":"collaborative-distillation-meta-learning-for","title":"DevFormer: A Symmetric Transformer for Context-Aware Device Placement","date":"2022-05-26","arxiv_id":"2205.13225","repositories_listed":5,"syntology":{"n":23,"n_ran":16,"n_constructed":4,"n_ran_checked":13,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":2,"phrase":"16 ran (of which 4 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/collaborative-distillation-meta-learning-for#ran","syntology_url":"https://syntology.ai/paper/2205.13225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13225"}},"official":{"repos":["kaist-silab/devformer","kaist-silab/dppbench"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":4,"n_ran_no_instrument_failure":10,"n_unverified":7,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/semi-parametric-deep-neural-networks-in","slug":"semi-parametric-deep-neural-networks-in","title":"Semi-Parametric Inducing Point Networks and Neural Processes","date":"2022-05-24","arxiv_id":"2205.11718","repositories_listed":2,"syntology":{"n":15,"n_ran":10,"n_constructed":4,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 4 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) · 5 unverified","sample_list":"/paper/semi-parametric-deep-neural-networks-in#ran","syntology_url":"https://syntology.ai/paper/2205.11718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11718"}},"official":{"repos":["richrast/spin","yair-schiff/ipnp"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":4,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-fly-enables-rapid-learning-for-agile","slug":"neural-fly-enables-rapid-learning-for-agile","title":"Neural-Fly Enables Rapid Learning for Agile Flight in Strong Winds","date":"2022-05-13","arxiv_id":"2205.06908","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/neural-fly-enables-rapid-learning-for-agile#ran","syntology_url":"https://syntology.ai/paper/2205.06908","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.06908"}},"official":{"repos":["aerorobotics/neural-fly"],"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/beyond-the-prototype-divide-and-conquer","slug":"beyond-the-prototype-divide-and-conquer","title":"Beyond the Prototype: Divide-and-conquer Proxies for Few-shot Segmentation","date":"2022-04-21","arxiv_id":"2204.09903","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":4,"n_ran_checked":4,"n_instrument":8,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"12 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 8 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/beyond-the-prototype-divide-and-conquer#ran","syntology_url":"https://syntology.ai/paper/2204.09903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.09903"}},"official":{"repos":["chunbolang/DCP"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/pushing-the-limits-of-simple-pipelines-for","slug":"pushing-the-limits-of-simple-pipelines-for","title":"Pushing the Limits of Simple Pipelines for Few-Shot Learning: External Data and Fine-Tuning Make a Difference","date":"2022-04-15","arxiv_id":"2204.07305","repositories_listed":1,"syntology":{"n":19,"n_ran":14,"n_constructed":0,"n_ran_checked":8,"n_instrument":6,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":4,"phrase":"14 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; 6 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/pushing-the-limits-of-simple-pipelines-for#ran","syntology_url":"https://syntology.ai/paper/2204.07305","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.07305"}},"official":{"repos":["hushell/pmf_cvpr22"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/control-oriented-meta-learning","slug":"control-oriented-meta-learning","title":"Control-oriented meta-learning","date":"2022-04-14","arxiv_id":"2204.06716","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/control-oriented-meta-learning#ran","syntology_url":"https://syntology.ai/paper/2204.06716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.06716"}},"official":{"repos":["StanfordASL/Adaptive-Control-Oriented-Meta-Learning"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/decomposed-meta-learning-for-few-shot-named","slug":"decomposed-meta-learning-for-few-shot-named","title":"Decomposed Meta-Learning for Few-Shot Named Entity Recognition","date":"2022-04-12","arxiv_id":"2204.05751","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 1 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) · 2 unverified","sample_list":"/paper/decomposed-meta-learning-for-few-shot-named#ran","syntology_url":"https://syntology.ai/paper/2204.05751","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.05751"}},"official":{"repos":["microsoft/vert-papers"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pin-the-memory-learning-to-generalize","slug":"pin-the-memory-learning-to-generalize","title":"Pin the Memory: Learning to Generalize Semantic Segmentation","date":"2022-04-07","arxiv_id":"2204.03609","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/pin-the-memory-learning-to-generalize#ran","syntology_url":"https://syntology.ai/paper/2204.03609","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.03609"}},"official":{"repos":["genie-kim/pinthememory"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/metaaudio-a-few-shot-audio-classification","slug":"metaaudio-a-few-shot-audio-classification","title":"MetaAudio: A Few-Shot Audio Classification Benchmark","date":"2022-04-05","arxiv_id":"2204.02121","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/metaaudio-a-few-shot-audio-classification#ran","syntology_url":"https://syntology.ai/paper/2204.02121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02121"}},"official":{"repos":["cheggan/metaaudio-a-few-shot-audio-classification-benchmark"],"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/multidimensional-belief-quantification-for","slug":"multidimensional-belief-quantification-for","title":"Multidimensional Belief Quantification for Label-Efficient Meta-Learning","date":"2022-03-23","arxiv_id":"2203.12768","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":5,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"6 ran (of which 5 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) · 3 unverified","sample_list":"/paper/multidimensional-belief-quantification-for#ran","syntology_url":"https://syntology.ai/paper/2203.12768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12768"}},"official":{"repos":["pandeydeep9/units-ml-cvpr-22"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/global-convergence-of-maml-and-theory","slug":"global-convergence-of-maml-and-theory","title":"Global Convergence of MAML and Theory-Inspired Neural Architecture Search for Few-Shot Learning","date":"2022-03-17","arxiv_id":"2203.09137","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/global-convergence-of-maml-and-theory#ran","syntology_url":"https://syntology.ai/paper/2203.09137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.09137"}},"official":{"repos":["yitewang/metantk-nas"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-what-not-to-segment-a-new","slug":"learning-what-not-to-segment-a-new","title":"Learning What Not to Segment: A New Perspective on Few-Shot Segmentation","date":"2022-03-15","arxiv_id":"2203.07615","repositories_listed":1,"syntology":{"n":17,"n_ran":16,"n_constructed":0,"n_ran_checked":9,"n_instrument":7,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":11,"phrase":"16 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; 7 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-what-not-to-segment-a-new#ran","syntology_url":"https://syntology.ai/paper/2203.07615","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.07615"}},"official":{"repos":["chunbolang/BAM"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/metaug-contrastive-learning-via-meta-feature","slug":"metaug-contrastive-learning-via-meta-feature","title":"MetAug: Contrastive Learning via Meta Feature Augmentation","date":"2022-03-10","arxiv_id":"2203.05119","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":2,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/metaug-contrastive-learning-via-meta-feature#ran","syntology_url":"https://syntology.ai/paper/2203.05119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05119"}},"official":{"repos":["jiangmengli/metaug","lionellee9089/metaug"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fs-coco-towards-understanding-of-freehand","slug":"fs-coco-towards-understanding-of-freehand","title":"FS-COCO: Towards Understanding of Freehand Sketches of Common Objects in Context","date":"2022-03-04","arxiv_id":"2203.02113","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/fs-coco-towards-understanding-of-freehand#ran","syntology_url":"https://syntology.ai/paper/2203.02113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.02113"}},"official":{"repos":["pinakinathc/fscoco"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/min-max-bilevel-multi-objective-optimization","slug":"min-max-bilevel-multi-objective-optimization","title":"Min-Max Bilevel Multi-objective Optimization with Applications in Machine Learning","date":"2022-03-03","arxiv_id":"2203.01924","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/min-max-bilevel-multi-objective-optimization#ran","syntology_url":"https://syntology.ai/paper/2203.01924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.01924"}},"official":{"repos":["minimario/morbit"],"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":["found_in_text","official"]}}},{"url":"/paper/non-stationary-bandits-and-meta-learning-with","slug":"non-stationary-bandits-and-meta-learning-with","title":"Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms","date":"2022-02-25","arxiv_id":"2202.13001","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/non-stationary-bandits-and-meta-learning-with#ran","syntology_url":"https://syntology.ai/paper/2202.13001","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.13001"}},"official":{"repos":["duongnhatthang/meta-bandit"],"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/2021-beetl-competition-advancing-transfer","slug":"2021-beetl-competition-advancing-transfer","title":"2021 BEETL Competition: Advancing Transfer Learning for Subject Independence & Heterogenous EEG Data Sets","date":"2022-02-14","arxiv_id":"2202.12950","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/2021-beetl-competition-advancing-transfer#ran","syntology_url":"https://syntology.ai/paper/2202.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.12950"}},"official":{"repos":["mcd4874/neurips_competition"],"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/bilevel-optimization-with-a-lower-level","slug":"bilevel-optimization-with-a-lower-level","title":"Bilevel Optimization with a Lower-level Contraction: Optimal Sample Complexity without Warm-start","date":"2022-02-07","arxiv_id":"2202.03397","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"8 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bilevel-optimization-with-a-lower-level#ran","syntology_url":"https://syntology.ai/paper/2202.03397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03397"}},"official":{"repos":["csml-iit-ucl/bioptexps"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/platinum-semi-supervised-model-agnostic-meta","slug":"platinum-semi-supervised-model-agnostic-meta","title":"PLATINUM: Semi-Supervised Model Agnostic Meta-Learning using Submodular Mutual Information","date":"2022-01-30","arxiv_id":"2201.12928","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/platinum-semi-supervised-model-agnostic-meta#ran","syntology_url":"https://syntology.ai/paper/2201.12928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12928"}},"official":{"repos":["hugo101/platinum"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-effect-of-diversity-in-meta-learning-1","slug":"the-effect-of-diversity-in-meta-learning-1","title":"The Effect of Diversity in Meta-Learning","date":"2022-01-27","arxiv_id":"2201.11775","repositories_listed":1,"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/the-effect-of-diversity-in-meta-learning-1#ran","syntology_url":"https://syntology.ai/paper/2201.11775","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.11775"}},"official":{"repos":["RamnathKumar181/Task-Diversity-meta-learning"],"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/exploration-with-a-finite-brain","slug":"exploration-with-a-finite-brain","title":"Modeling Human Exploration Through Resource-Rational Reinforcement Learning","date":"2022-01-27","arxiv_id":"2201.11817","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":3,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploration-with-a-finite-brain#ran","syntology_url":"https://syntology.ai/paper/2201.11817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.11817"}},"official":{"repos":["marcelbinz/resource-rational-reinforcement-learning"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-spiking-neural-networks-with","slug":"meta-learning-spiking-neural-networks-with","title":"Meta-learning Spiking Neural Networks with Surrogate Gradient Descent","date":"2022-01-26","arxiv_id":"2201.10777","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/meta-learning-spiking-neural-networks-with#ran","syntology_url":"https://syntology.ai/paper/2201.10777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.10777"}},"official":null}},{"url":"/paper/tranad-deep-transformer-networks-for-anomaly","slug":"tranad-deep-transformer-networks-for-anomaly","title":"TranAD: Deep Transformer Networks for Anomaly Detection in Multivariate Time Series Data","date":"2022-01-18","arxiv_id":"2201.07284","repositories_listed":2,"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":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) · 2 unverified","sample_list":"/paper/tranad-deep-transformer-networks-for-anomaly#ran","syntology_url":"https://syntology.ai/paper/2201.07284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.07284"}},"official":{"repos":["imperial-qore/tranad"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/omniprint-a-configurable-printed-character","slug":"omniprint-a-configurable-printed-character","title":"OmniPrint: A Configurable Printed Character Synthesizer","date":"2022-01-17","arxiv_id":"2201.06648","repositories_listed":2,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/omniprint-a-configurable-printed-character#ran","syntology_url":"https://syntology.ai/paper/2201.06648","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.06648"}},"official":{"repos":["sunhaozhe/omniprint","sunhaozhe/omniprint-datasets"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/bootstrapping-informative-graph-augmentation","slug":"bootstrapping-informative-graph-augmentation","title":"Bootstrapping Informative Graph Augmentation via A Meta Learning Approach","date":"2022-01-11","arxiv_id":"2201.03812","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/bootstrapping-informative-graph-augmentation#ran","syntology_url":"https://syntology.ai/paper/2201.03812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.03812"}},"official":{"repos":["hang53/mega"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"cab9746ce9ff395bf0fd7ca6fe87a49cbd0b9da7845391c1451398da624f882a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}