{"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/10","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":10,"pages_in_order":36,"rows_per_page":100,"rows":[901,1000],"of":3569,"counts":{"archive_papers_tagged":3569,"with_a_code_link":1408,"where_syntology_ran_a_sample":420,"not_listed_spam_title":0,"listed":3569,"listed_where_code_ran":420,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":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","prev":"/task/meta-learning/papers/9","next":"/task/meta-learning/papers/11","papers":[{"url":"/paper/how-neural-processes-improve-graph-link","slug":"how-neural-processes-improve-graph-link","title":"How Neural Processes Improve Graph Link Prediction","date":"2021-09-30","arxiv_id":"2109.14894","repositories_listed":1,"syntology":null},{"url":"/paper/closed-form-sample-probing-for-learning","slug":"closed-form-sample-probing-for-learning","title":"Closed-form Sample Probing for Learning Generative Models in Zero-shot Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/clustered-task-aware-meta-learning-by","slug":"clustered-task-aware-meta-learning-by","title":"Clustered Task-Aware Meta-Learning by Learning from Learning Paths","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/generalization-bounds-for-meta-learning-an","slug":"generalization-bounds-for-meta-learning-an","title":"Generalization Bounds For Meta-Learning: An Information-Theoretic Analysis","date":"2021-09-29","arxiv_id":"2109.14595","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/generalization-bounds-for-meta-learning-an#ran","syntology_url":"https://syntology.ai/paper/2109.14595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.14595"}},"official":{"repos":["livreq/meta-sgld"],"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/improving-meta-continual-learning","slug":"improving-meta-continual-learning","title":"Improving Meta-Continual Learning Representations with Representation Replay","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-on-a-sequence-of-imbalanced","slug":"meta-learning-on-a-sequence-of-imbalanced","title":"Meta Learning on a Sequence of Imbalanced Domains with Difficulty Awareness","date":"2021-09-29","arxiv_id":"2109.14120","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meta-learning-on-a-sequence-of-imbalanced#ran","syntology_url":"https://syntology.ai/paper/2109.14120","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.14120"}},"official":{"repos":["joey-wang123/imbalancemeta"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-enhanced-span-based-decomposition-method","slug":"an-enhanced-span-based-decomposition-method","title":"An Enhanced Span-based Decomposition Method for Few-Shot Sequence Labeling","date":"2021-09-27","arxiv_id":"2109.13023","repositories_listed":1,"syntology":null},{"url":"/paper/a-meta-learning-approach-for-training","slug":"a-meta-learning-approach-for-training","title":"A Meta-Learning Approach for Training Explainable Graph Neural Networks","date":"2021-09-20","arxiv_id":"2109.09426","repositories_listed":1,"syntology":null},{"url":"/paper/autoinit-analytic-signal-preserving-weight","slug":"autoinit-analytic-signal-preserving-weight","title":"AutoInit: Analytic Signal-Preserving Weight Initialization for Neural Networks","date":"2021-09-18","arxiv_id":"2109.08958","repositories_listed":1,"syntology":null},{"url":"/paper/metamedseg-volumetric-meta-learning-for-few","slug":"metamedseg-volumetric-meta-learning-for-few","title":"MetaMedSeg: Volumetric Meta-learning for Few-Shot Organ Segmentation","date":"2021-09-18","arxiv_id":"2109.09734","repositories_listed":1,"syntology":null},{"url":"/paper/sign-maml-efficient-model-agnostic-meta","slug":"sign-maml-efficient-model-agnostic-meta","title":"Sign-MAML: Efficient Model-Agnostic Meta-Learning by SignSGD","date":"2021-09-15","arxiv_id":"2109.07497","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-quality-diversity-optimisation","slug":"few-shot-quality-diversity-optimisation","title":"Few-shot Quality-Diversity Optimization","date":"2021-09-14","arxiv_id":"2109.06826","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-imitation-reinforcement-learning-for","slug":"gradient-imitation-reinforcement-learning-for","title":"Gradient Imitation Reinforcement Learning for Low Resource Relation Extraction","date":"2021-09-14","arxiv_id":"2109.06415","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":1,"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/gradient-imitation-reinforcement-learning-for#ran","syntology_url":"https://syntology.ai/paper/2109.06415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06415"}},"official":{"repos":["thu-bpm/gradlre"],"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/cross-market-product-recommendation","slug":"cross-market-product-recommendation","title":"Cross-Market Product Recommendation","date":"2021-09-13","arxiv_id":"2109.05929","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-task-difficulty-for-few-shot","slug":"exploring-task-difficulty-for-few-shot","title":"Exploring Task Difficulty for Few-Shot Relation Extraction","date":"2021-09-12","arxiv_id":"2109.05473","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-table-content-for-zero-shot-text","slug":"leveraging-table-content-for-zero-shot-text","title":"Leveraging Table Content for Zero-shot Text-to-SQL with Meta-Learning","date":"2021-09-12","arxiv_id":"2109.05395","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-aware-meta-learning-for-low","slug":"knowledge-aware-meta-learning-for-low","title":"Knowledge-Aware Meta-learning for Low-Resource Text Classification","date":"2021-09-10","arxiv_id":"2109.04707","repositories_listed":1,"syntology":null},{"url":"/paper/bootstrapped-meta-learning","slug":"bootstrapped-meta-learning","title":"Bootstrapped Meta-Learning","date":"2021-09-09","arxiv_id":"2109.04504","repositories_listed":1,"syntology":null},{"url":"/paper/learning-fast-sample-re-weighting-without","slug":"learning-fast-sample-re-weighting-without","title":"Learning Fast Sample Re-weighting Without Reward Data","date":"2021-09-07","arxiv_id":"2109.03216","repositories_listed":1,"syntology":null},{"url":"/paper/a-realistic-study-of-auto-regressive-language","slug":"a-realistic-study-of-auto-regressive-language","title":"Probing Pre-trained Auto-regressive Language Models for Named Entity Typing and Recognition","date":"2021-08-26","arxiv_id":"2108.11857","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-visual-relationship-co-localization","slug":"few-shot-visual-relationship-co-localization","title":"Few-shot Visual Relationship Co-localization","date":"2021-08-26","arxiv_id":"2108.11618","repositories_listed":1,"syntology":null},{"url":"/paper/adaptation-agnostic-meta-training","slug":"adaptation-agnostic-meta-training","title":"Adaptation-Agnostic Meta-Training","date":"2021-08-24","arxiv_id":"2108.10557","repositories_listed":1,"syntology":null},{"url":"/paper/cmml-contextual-modulation-meta-learning-for","slug":"cmml-contextual-modulation-meta-learning-for","title":"CMML: Contextual Modulation Meta Learning for Cold-Start Recommendation","date":"2021-08-24","arxiv_id":"2108.10511","repositories_listed":1,"syntology":null},{"url":"/paper/meta-self-learning-for-multi-source-domain","slug":"meta-self-learning-for-multi-source-domain","title":"Meta Self-Learning for Multi-Source Domain Adaptation: A Benchmark","date":"2021-08-24","arxiv_id":"2108.10840","repositories_listed":1,"syntology":null},{"url":"/paper/relational-embedding-for-few-shot","slug":"relational-embedding-for-few-shot","title":"Relational Embedding for Few-Shot Classification","date":"2021-08-22","arxiv_id":"2108.09666","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":10,"n_ran_checked":11,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 10 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/relational-embedding-for-few-shot#ran","syntology_url":"https://syntology.ai/paper/2108.09666","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.09666"}},"official":{"repos":["dahyun-kang/renet"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":10,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-fine-grained-action-recognition-via","slug":"few-shot-fine-grained-action-recognition-via","title":"Few-Shot Fine-Grained Action Recognition via Bidirectional Attention and Contrastive Meta-Learning","date":"2021-08-15","arxiv_id":"2108.06647","repositories_listed":1,"syntology":null},{"url":"/paper/weakly-supervised-medical-image-segmentation","slug":"weakly-supervised-medical-image-segmentation","title":"Learning to Segment Medical Images from Few-Shot Sparse Labels","date":"2021-08-12","arxiv_id":"2108.05476","repositories_listed":1,"syntology":null},{"url":"/paper/prototype-completion-for-few-shot-learning","slug":"prototype-completion-for-few-shot-learning","title":"Prototype Completion for Few-Shot Learning","date":"2021-08-11","arxiv_id":"2108.05010","repositories_listed":1,"syntology":null},{"url":"/paper/meta-gradient-adversarial-attack","slug":"meta-gradient-adversarial-attack","title":"Meta Gradient Adversarial Attack","date":"2021-08-09","arxiv_id":"2108.04204","repositories_listed":1,"syntology":null},{"url":"/paper/simpler-is-better-few-shot-semantic","slug":"simpler-is-better-few-shot-semantic","title":"Simpler is Better: Few-shot Semantic Segmentation with Classifier Weight Transformer","date":"2021-08-06","arxiv_id":"2108.03032","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"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 1 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/simpler-is-better-few-shot-semantic#ran","syntology_url":"https://syntology.ai/paper/2108.03032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03032"}},"official":{"repos":["zhiheLu/CWT-for-FSS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-relevance-learning-for-few-shot","slug":"dynamic-relevance-learning-for-few-shot","title":"Dynamic Relevance Learning for Few-Shot Object Detection","date":"2021-08-04","arxiv_id":"2108.02235","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-calibration-of-low-cost-air","slug":"few-shot-calibration-of-low-cost-air","title":"Few-shot calibration of low-cost air pollution (PM2.5) sensors using meta-learning","date":"2021-08-02","arxiv_id":"2108.00640","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-learn-to-demodulate-with","slug":"learning-to-learn-to-demodulate-with","title":"Bayesian Active Meta-Learning for Few Pilot Demodulation and Equalization","date":"2021-08-02","arxiv_id":"2108.00785","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-for-classifying-previously","slug":"meta-learning-for-classifying-previously","title":"Meta-learning for Classifying Previously Unseen Data Source into Previously Unseen Emotional Categories","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/protaugment-intent-detection-meta-learning","slug":"protaugment-intent-detection-meta-learning","title":"ProtAugment: Intent Detection Meta-Learning through Unsupervised Diverse Paraphrasing","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/meta-fdmixup-cross-domain-few-shot-learning","slug":"meta-fdmixup-cross-domain-few-shot-learning","title":"Meta-FDMixup: Cross-Domain Few-Shot Learning Guided by Labeled Target Data","date":"2021-07-26","arxiv_id":"2107.11978","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-adversarial-domain-adaptation","slug":"meta-learning-adversarial-domain-adaptation","title":"Meta-Learning Adversarial Domain Adaptation Network for Few-Shot Text Classification","date":"2021-07-26","arxiv_id":"2107.12262","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/meta-learning-adversarial-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/2107.12262","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.12262"}},"official":{"repos":["hccngu/MLADA"],"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/prototransformer-a-meta-learning-approach-to","slug":"prototransformer-a-meta-learning-approach-to","title":"ProtoTransformer: A Meta-Learning Approach to Providing Student Feedback","date":"2021-07-23","arxiv_id":"2107.14035","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/prototransformer-a-meta-learning-approach-to#ran","syntology_url":"https://syntology.ai/paper/2107.14035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.14035"}},"official":null}},{"url":"/paper/neural-fixed-point-acceleration-for-convex","slug":"neural-fixed-point-acceleration-for-convex","title":"Neural Fixed-Point Acceleration for Convex Optimization","date":"2021-07-21","arxiv_id":"2107.10254","repositories_listed":1,"syntology":null},{"url":"/paper/algorithm-selection-on-a-meta-level","slug":"algorithm-selection-on-a-meta-level","title":"Algorithm Selection on a Meta Level","date":"2021-07-20","arxiv_id":"2107.09414","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-few-shot-classification-with-view","slug":"boosting-few-shot-classification-with-view","title":"Boosting Few-Shot Classification with View-Learnable Contrastive Learning","date":"2021-07-20","arxiv_id":"2107.09242","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 2 unverified","sample_list":"/paper/boosting-few-shot-classification-with-view#ran","syntology_url":"https://syntology.ai/paper/2107.09242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.09242"}},"official":{"repos":["Frankluox/FewShotCodeBase"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/adaptive-transfer-learning-on-graph-neural","slug":"adaptive-transfer-learning-on-graph-neural","title":"Adaptive Transfer Learning on Graph Neural Networks","date":"2021-07-19","arxiv_id":"2107.08765","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/adaptive-transfer-learning-on-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2107.08765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08765"}},"official":null}},{"url":"/paper/picaso-permutation-invariant-cascaded","slug":"picaso-permutation-invariant-cascaded","title":"PICASO: Permutation-Invariant Cascaded Attentional Set Operator","date":"2021-07-17","arxiv_id":"2107.08305","repositories_listed":1,"syntology":null},{"url":"/paper/a-channel-coding-benchmark-for-meta-learning","slug":"a-channel-coding-benchmark-for-meta-learning","title":"A Channel Coding Benchmark for Meta-Learning","date":"2021-07-15","arxiv_id":"2107.07579","repositories_listed":1,"syntology":null},{"url":"/paper/carle-s-game-an-open-ended-challenge-in","slug":"carle-s-game-an-open-ended-challenge-in","title":"Carle's Game: An Open-Ended Challenge in Exploratory Machine Creativity","date":"2021-07-13","arxiv_id":"2107.05786","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-recommendation-for-cold-start","slug":"sequential-recommendation-for-cold-start","title":"Sequential Recommendation for Cold-start Users with Meta Transitional Learning","date":"2021-07-13","arxiv_id":"2107.06427","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-amidst-heterogeneity-and","slug":"meta-learning-amidst-heterogeneity-and","title":"Meta-learning Amidst Heterogeneity and Ambiguity","date":"2021-07-05","arxiv_id":"2107.02228","repositories_listed":1,"syntology":null},{"url":"/paper/rapid-neural-architecture-search-by-learning-1","slug":"rapid-neural-architecture-search-by-learning-1","title":"Rapid Neural Architecture Search by Learning to Generate Graphs from Datasets","date":"2021-07-02","arxiv_id":"2107.00860","repositories_listed":1,"syntology":{"n":19,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":6,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/rapid-neural-architecture-search-by-learning-1#ran","syntology_url":"https://syntology.ai/paper/2107.00860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.00860"}},"official":{"repos":["HayeonLee/MetaD2A"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["found_in_text","official","unlocated"]}}},{"url":"/paper/few-shot-learning-with-a-strong-teacher","slug":"few-shot-learning-with-a-strong-teacher","title":"Few-Shot Learning with a Strong Teacher","date":"2021-07-01","arxiv_id":"2107.00197","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-train-your-maml-to-excel-in-few-shot","slug":"how-to-train-your-maml-to-excel-in-few-shot","title":"How to Train Your MAML to Excel in Few-Shot Classification","date":"2021-06-30","arxiv_id":"2106.16245","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":5,"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/how-to-train-your-maml-to-excel-in-few-shot#ran","syntology_url":"https://syntology.ai/paper/2106.16245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.16245"}},"official":{"repos":["han-jia/unicorn-maml"],"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/relational-vae-a-continuous-latent-variable","slug":"relational-vae-a-continuous-latent-variable","title":"Relational VAE: A Continuous Latent Variable Model for Graph Structured Data","date":"2021-06-30","arxiv_id":"2106.16049","repositories_listed":1,"syntology":null},{"url":"/paper/resilient-uav-swarm-communications-with-graph","slug":"resilient-uav-swarm-communications-with-graph","title":"Resilient UAV Swarm Communications with Graph Convolutional Neural Network","date":"2021-06-30","arxiv_id":"2106.16048","repositories_listed":1,"syntology":null},{"url":"/paper/a-representation-learning-perspective-on-the","slug":"a-representation-learning-perspective-on-the","title":"A Representation Learning Perspective on the Importance of Train-Validation Splitting in Meta-Learning","date":"2021-06-29","arxiv_id":"2106.15615","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/a-representation-learning-perspective-on-the#ran","syntology_url":"https://syntology.ai/paper/2106.15615","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.15615"}},"official":{"repos":["nsaunshi/meta_tr_val_split"],"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/maml-is-a-noisy-contrastive-learner","slug":"maml-is-a-noisy-contrastive-learner","title":"MAML is a Noisy Contrastive Learner in Classification","date":"2021-06-29","arxiv_id":"2106.15367","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":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) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/maml-is-a-noisy-contrastive-learner#ran","syntology_url":"https://syntology.ai/paper/2106.15367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.15367"}},"official":null}},{"url":"/paper/representation-based-meta-learning-for-few","slug":"representation-based-meta-learning-for-few","title":"Representation based meta-learning for few-shot spoken intent recognition","date":"2021-06-29","arxiv_id":"2106.15238","repositories_listed":1,"syntology":null},{"url":"/paper/long-term-cross-adversarial-training-a-robust","slug":"long-term-cross-adversarial-training-a-robust","title":"Long-term Cross Adversarial Training: A Robust Meta-learning Method for Few-shot Classification Tasks","date":"2021-06-22","arxiv_id":"2106.12900","repositories_listed":1,"syntology":{"n":9,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":8,"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) · 8 unverified","sample_list":"/paper/long-term-cross-adversarial-training-a-robust#ran","syntology_url":"https://syntology.ai/paper/2106.12900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12900"}},"official":{"repos":["Gnomeek/Long-term-Cross-Adversarial-Training"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/metaavatar-learning-animatable-clothed-human","slug":"metaavatar-learning-animatable-clothed-human","title":"MetaAvatar: Learning Animatable Clothed Human Models from Few Depth Images","date":"2021-06-22","arxiv_id":"2106.11944","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/metaavatar-learning-animatable-clothed-human#ran","syntology_url":"https://syntology.ai/paper/2106.11944","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.11944"}},"official":{"repos":["taconite/MetaAvatar-release"],"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/transfer-bayesian-meta-learning-via-weighted","slug":"transfer-bayesian-meta-learning-via-weighted","title":"Transfer Bayesian Meta-learning via Weighted Free Energy Minimization","date":"2021-06-20","arxiv_id":"2106.10711","repositories_listed":1,"syntology":null},{"url":"/paper/delving-deep-into-many-to-many-attention-for","slug":"delving-deep-into-many-to-many-attention-for","title":"Delving Deep Into Many-to-Many Attention for Few-Shot Video Object Segmentation","date":"2021-06-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/evograd-efficient-gradient-based-meta","slug":"evograd-efficient-gradient-based-meta","title":"EvoGrad: Efficient Gradient-Based Meta-Learning and Hyperparameter Optimization","date":"2021-06-19","arxiv_id":"2106.10575","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"4 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; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/evograd-efficient-gradient-based-meta#ran","syntology_url":"https://syntology.ai/paper/2106.10575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10575"}},"official":{"repos":["ondrejbohdal/evograd"],"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":["community","official"]}}},{"url":"/paper/on-contrastive-representations-of-stochastic","slug":"on-contrastive-representations-of-stochastic","title":"On Contrastive Representations of Stochastic Processes","date":"2021-06-18","arxiv_id":"2106.10052","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/on-contrastive-representations-of-stochastic#ran","syntology_url":"https://syntology.ai/paper/2106.10052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10052"}},"official":{"repos":["ae-foster/cresp"],"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/how-low-can-we-go-trading-memory-for-error-in","slug":"how-low-can-we-go-trading-memory-for-error-in","title":"How Low Can We Go: Trading Memory for Error in Low-Precision Training","date":"2021-06-17","arxiv_id":"2106.09686","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/how-low-can-we-go-trading-memory-for-error-in#ran","syntology_url":"https://syntology.ai/paper/2106.09686","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09686"}},"official":{"repos":["barterer/lp"],"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":["community","official"]}}},{"url":"/paper/meta-calibration-meta-learning-of-model","slug":"meta-calibration-meta-learning-of-model","title":"Meta-Calibration: Learning of Model Calibration Using Differentiable Expected Calibration Error","date":"2021-06-17","arxiv_id":"2106.09613","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-calibration-meta-learning-of-model#ran","syntology_url":"https://syntology.ai/paper/2106.09613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09613"}},"official":{"repos":["ondrejbohdal/meta-calibration"],"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/bridging-multi-task-learning-and-meta","slug":"bridging-multi-task-learning-and-meta","title":"Bridging Multi-Task Learning and Meta-Learning: Towards Efficient Training and Effective Adaptation","date":"2021-06-16","arxiv_id":"2106.09017","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"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, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bridging-multi-task-learning-and-meta#ran","syntology_url":"https://syntology.ai/paper/2106.09017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09017"}},"official":{"repos":["AI-secure/multi-task-learning"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/help-hardware-adaptive-efficient-latency","slug":"help-hardware-adaptive-efficient-latency","title":"HELP: Hardware-Adaptive Efficient Latency Prediction for NAS via Meta-Learning","date":"2021-06-16","arxiv_id":"2106.08630","repositories_listed":1,"syntology":{"n":17,"n_ran":14,"n_constructed":4,"n_ran_checked":14,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":13,"n_pointer_only":1,"phrase":"14 ran (of which 4 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/help-hardware-adaptive-efficient-latency#ran","syntology_url":"https://syntology.ai/paper/2106.08630","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08630"}},"official":{"repos":["hayeonlee/help"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":4,"n_ran_no_instrument_failure":14,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/transductive-few-shot-learning-clustering-is","slug":"transductive-few-shot-learning-clustering-is","title":"Transductive Few-Shot Learning: Clustering is All You Need?","date":"2021-06-16","arxiv_id":"2106.09516","repositories_listed":1,"syntology":null},{"url":"/paper/contextualizing-multiple-tasks-via-learning","slug":"contextualizing-multiple-tasks-via-learning","title":"Contextualizing Meta-Learning via Learning to Decompose","date":"2021-06-15","arxiv_id":"2106.08112","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-distillation-network-for-cross-domain","slug":"dynamic-distillation-network-for-cross-domain","title":"Dynamic Distillation Network for Cross-Domain Few-Shot Recognition with Unlabeled Data","date":"2021-06-14","arxiv_id":"2106.07807","repositories_listed":1,"syntology":null},{"url":"/paper/learning-deep-morphological-networks-with","slug":"learning-deep-morphological-networks-with","title":"Learning Deep Morphological Networks with Neural Architecture Search","date":"2021-06-14","arxiv_id":"2106.07714","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-for-symbolic-hyperparameter","slug":"meta-learning-for-symbolic-hyperparameter","title":"Meta-Learning for Symbolic Hyperparameter Defaults","date":"2021-06-10","arxiv_id":"2106.05767","repositories_listed":1,"syntology":null},{"url":"/paper/attentional-meta-learners-are-polythetic","slug":"attentional-meta-learners-are-polythetic","title":"Attentional Meta-learners for Few-shot Polythetic Classification","date":"2021-06-09","arxiv_id":"2106.05317","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 0 unverified","sample_list":"/paper/attentional-meta-learners-are-polythetic#ran","syntology_url":"https://syntology.ai/paper/2106.05317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05317"}},"official":{"repos":["rvinas/polythetic_metalearning"],"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/memory-based-optimization-methods-for-model","slug":"memory-based-optimization-methods-for-model","title":"Memory-Based Optimization Methods for Model-Agnostic Meta-Learning and Personalized Federated Learning","date":"2021-06-09","arxiv_id":"2106.04911","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-task-modelling-for-meta","slug":"probabilistic-task-modelling-for-meta","title":"Probabilistic task modelling for meta-learning","date":"2021-06-09","arxiv_id":"2106.04802","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/probabilistic-task-modelling-for-meta#ran","syntology_url":"https://syntology.ai/paper/2106.04802","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04802"}},"official":{"repos":["cnguyen10/probabilistic_task_modelling"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-for-knowledge-distillation","slug":"meta-learning-for-knowledge-distillation","title":"BERT Learns to Teach: Knowledge Distillation with Meta Learning","date":"2021-06-08","arxiv_id":"2106.04570","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"5 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; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/meta-learning-for-knowledge-distillation#ran","syntology_url":"https://syntology.ai/paper/2106.04570","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04570"}},"official":{"repos":["JetRunner/MetaDistil"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/meta-learning-to-compositionally-generalize","slug":"meta-learning-to-compositionally-generalize","title":"Meta-Learning to Compositionally Generalize","date":"2021-06-08","arxiv_id":"2106.04252","repositories_listed":1,"syntology":null},{"url":"/paper/provably-faster-algorithms-for-bilevel","slug":"provably-faster-algorithms-for-bilevel","title":"Provably Faster Algorithms for Bilevel Optimization","date":"2021-06-08","arxiv_id":"2106.04692","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/provably-faster-algorithms-for-bilevel#ran","syntology_url":"https://syntology.ai/paper/2106.04692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04692"}},"official":{"repos":["JunjieYang97/MRVRBO"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/evaluating-meta-feature-selection-for-the","slug":"evaluating-meta-feature-selection-for-the","title":"Evaluating Meta-Feature Selection for the Algorithm Recommendation Problem","date":"2021-06-07","arxiv_id":"2106.03954","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervision-meta-learning-for-one-shot","slug":"self-supervision-meta-learning-for-one-shot","title":"Self-Supervision & Meta-Learning for One-Shot Unsupervised Cross-Domain Detection","date":"2021-06-07","arxiv_id":"2106.03496","repositories_listed":1,"syntology":null},{"url":"/paper/damsl-domain-agnostic-meta-score-based","slug":"damsl-domain-agnostic-meta-score-based","title":"DAMSL: Domain Agnostic Meta Score-based Learning","date":"2021-06-06","arxiv_id":"2106.03041","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-with-variational-semantic","slug":"meta-learning-with-variational-semantic","title":"Meta-Learning with Variational Semantic Memory for Word Sense Disambiguation","date":"2021-06-05","arxiv_id":"2106.02960","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":4,"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 4 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; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/meta-learning-with-variational-semantic#ran","syntology_url":"https://syntology.ai/paper/2106.02960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02960"}},"official":{"repos":["YDU-uva/VSM_WSD"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/light-field-networks-neural-scene","slug":"light-field-networks-neural-scene","title":"Light Field Networks: Neural Scene Representations with Single-Evaluation Rendering","date":"2021-06-04","arxiv_id":"2106.02634","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/light-field-networks-neural-scene#ran","syntology_url":"https://syntology.ai/paper/2106.02634","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02634"}},"official":null}},{"url":"/paper/meta-learning-with-fewer-tasks-through-task","slug":"meta-learning-with-fewer-tasks-through-task","title":"Meta-Learning with Fewer Tasks through Task Interpolation","date":"2021-06-04","arxiv_id":"2106.02695","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/meta-learning-with-fewer-tasks-through-task#ran","syntology_url":"https://syntology.ai/paper/2106.02695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02695"}},"official":{"repos":["huaxiuyao/mlti"],"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/write-like-you-synthesizing-your-cursive","slug":"write-like-you-synthesizing-your-cursive","title":"Write like you: Synthesizing your cursive online Chinese handwriting via metric-based meta learning","date":"2021-06-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/minimax-and-neyman-pearson-meta-learning-for","slug":"minimax-and-neyman-pearson-meta-learning-for","title":"Minimax and Neyman-Pearson Meta-Learning for Outlier Languages","date":"2021-06-02","arxiv_id":"2106.01051","repositories_listed":1,"syntology":null},{"url":"/paper/rotom-a-meta-learned-data-augmentation","slug":"rotom-a-meta-learned-data-augmentation","title":"Rotom: A Meta-Learned Data Augmentation Framework for Entity Matching, Data Cleaning, Text Classification, and Beyond","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/bambnet-a-blur-aware-multi-branch-network-for","slug":"bambnet-a-blur-aware-multi-branch-network-for","title":"BaMBNet: A Blur-aware Multi-branch Network for Defocus Deblurring","date":"2021-05-31","arxiv_id":"2105.14766","repositories_listed":1,"syntology":null},{"url":"/paper/meta-har-federated-representation-learning","slug":"meta-har-federated-representation-learning","title":"Meta-HAR: Federated Representation Learning for Human Activity Recognition","date":"2021-05-31","arxiv_id":"2106.00615","repositories_listed":1,"syntology":null},{"url":"/paper/protaugment-unsupervised-diverse-short-texts","slug":"protaugment-unsupervised-diverse-short-texts","title":"ProtAugment: Unsupervised diverse short-texts paraphrasing for intent detection meta-learning","date":"2021-05-27","arxiv_id":"2105.12995","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":0,"n_no_contract":1,"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, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/protaugment-unsupervised-diverse-short-texts#ran","syntology_url":"https://syntology.ai/paper/2105.12995","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.12995"}},"official":{"repos":["tdopierre/ProtAugment"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/miassr-an-approach-for-medical-image","slug":"miassr-an-approach-for-medical-image","title":"MIASSR: An Approach for Medical Image Arbitrary Scale Super-Resolution","date":"2021-05-22","arxiv_id":"2105.10738","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-weight-initializers-with-meta","slug":"discovering-weight-initializers-with-meta","title":"Discovering Weight Initializers with Meta Learning","date":"2021-05-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/minimum-delay-adaptation-in-non-stationary","slug":"minimum-delay-adaptation-in-non-stationary","title":"Minimum-Delay Adaptation in Non-Stationary Reinforcement Learning via Online High-Confidence Change-Point Detection","date":"2021-05-20","arxiv_id":"2105.09452","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"10 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/minimum-delay-adaptation-in-non-stationary#ran","syntology_url":"https://syntology.ai/paper/2105.09452","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.09452"}},"official":{"repos":["LucasAlegre/mbcd"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-graph-meta-embeddings-for-cold-start","slug":"learning-graph-meta-embeddings-for-cold-start","title":"Learning Graph Meta Embeddings for Cold-Start Ads in Click-Through Rate Prediction","date":"2021-05-19","arxiv_id":"2105.08909","repositories_listed":1,"syntology":null},{"url":"/paper/drill-dynamic-representations-for-imbalanced","slug":"drill-dynamic-representations-for-imbalanced","title":"DRILL: Dynamic Representations for Imbalanced Lifelong Learning","date":"2021-05-18","arxiv_id":"2105.08445","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/drill-dynamic-representations-for-imbalanced#ran","syntology_url":"https://syntology.ai/paper/2105.08445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08445"}},"official":{"repos":["knowledgetechnologyuhh/drill"],"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/exploring-the-similarity-of-representations","slug":"exploring-the-similarity-of-representations","title":"Exploring the Similarity of Representations in Model-Agnostic Meta-Learning","date":"2021-05-12","arxiv_id":"2105.05757","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/exploring-the-similarity-of-representations#ran","syntology_url":"https://syntology.ai/paper/2105.05757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.05757"}},"official":{"repos":["ThomasGoerttler/similarity-analysis-of-maml"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/autodebias-learning-to-debias-for","slug":"autodebias-learning-to-debias-for","title":"AutoDebias: Learning to Debias for Recommendation","date":"2021-05-10","arxiv_id":"2105.04170","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/autodebias-learning-to-debias-for#ran","syntology_url":"https://syntology.ai/paper/2105.04170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04170"}},"official":{"repos":["DongHande/AutoDebias"],"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/metakernel-learning-variational-random","slug":"metakernel-learning-variational-random","title":"MetaKernel: Learning Variational Random Features with Limited Labels","date":"2021-05-08","arxiv_id":"2105.03781","repositories_listed":1,"syntology":null},{"url":"/paper/adv-makeup-a-new-imperceptible-and","slug":"adv-makeup-a-new-imperceptible-and","title":"Adv-Makeup: A New Imperceptible and Transferable Attack on Face Recognition","date":"2021-05-07","arxiv_id":"2105.03162","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-learning-for-image-classification-of","slug":"few-shot-learning-for-image-classification-of","title":"Few-Shot Learning for Image Classification of Common Flora","date":"2021-05-07","arxiv_id":"2105.03056","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-based-deep-reinforcement","slug":"meta-learning-based-deep-reinforcement","title":"Meta-Learning-Based Deep Reinforcement Learning for Multiobjective Optimization Problems","date":"2021-05-06","arxiv_id":"2105.02741","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/meta-learning-based-deep-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2105.02741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02741"}},"official":{"repos":["zhangzizhen/ml-dam"],"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/fast-adaptive-meta-learning-for-few-shot","slug":"fast-adaptive-meta-learning-for-few-shot","title":"Fast Adaptive Meta-Learning for Few-Shot Image Generation","date":"2021-05-05","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"0924ace8505d1369f105bbaee728c9d0e0fcae927a26468f603d2470e3b8eae5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}