{"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/9","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":9,"pages_in_order":36,"rows_per_page":100,"rows":[801,900],"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/8","next":"/task/meta-learning/papers/10","papers":[{"url":"/paper/pre-training-to-match-for-unified-low-shot","slug":"pre-training-to-match-for-unified-low-shot","title":"Pre-training to Match for Unified Low-shot Relation Extraction","date":"2022-03-23","arxiv_id":"2203.12274","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-multi-antenna-frequency-selective","slug":"predicting-multi-antenna-frequency-selective","title":"Predicting Multi-Antenna Frequency-Selective Channels via Meta-Learned Linear Filters based on Long-Short Term Channel Decomposition","date":"2022-03-23","arxiv_id":"2203.12715","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-for-online-update-of","slug":"meta-learning-for-online-update-of","title":"Meta-Learning for Online Update of Recommender Systems","date":"2022-03-19","arxiv_id":"2203.10354","repositories_listed":1,"syntology":null},{"url":"/paper/meta-x-nlg-a-meta-learning-approach-based-on","slug":"meta-x-nlg-a-meta-learning-approach-based-on","title":"Meta-X$_{NLG}$: A Meta-Learning Approach Based on Language Clustering for Zero-Shot Cross-Lingual Transfer and Generation","date":"2022-03-19","arxiv_id":"2203.10250","repositories_listed":1,"syntology":null},{"url":"/paper/towards-robust-semantic-segmentation-of","slug":"towards-robust-semantic-segmentation-of","title":"Towards Robust Semantic Segmentation of Accident Scenes via Multi-Source Mixed Sampling and Meta-Learning","date":"2022-03-19","arxiv_id":"2203.10395","repositories_listed":1,"syntology":null},{"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/model-agnostic-multitask-fine-tuning-for-few","slug":"model-agnostic-multitask-fine-tuning-for-few","title":"Rethinking Task Sampling for Few-shot Vision-Language Transfer Learning","date":"2022-03-09","arxiv_id":"2203.04904","repositories_listed":1,"syntology":null},{"url":"/paper/language-agnostic-meta-learning-for-low","slug":"language-agnostic-meta-learning-for-low","title":"Language-Agnostic Meta-Learning for Low-Resource Text-to-Speech with Articulatory Features","date":"2022-03-07","arxiv_id":"2203.03191","repositories_listed":1,"syntology":null},{"url":"/paper/is-bayesian-model-agnostic-meta-learning","slug":"is-bayesian-model-agnostic-meta-learning","title":"Is Bayesian Model-Agnostic Meta Learning Better than Model-Agnostic Meta Learning, Provably?","date":"2022-03-06","arxiv_id":"2203.03059","repositories_listed":1,"syntology":null},{"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/an-unsupervised-cross-modal-hashing-method","slug":"an-unsupervised-cross-modal-hashing-method","title":"An Unsupervised Cross-Modal Hashing Method Robust to Noisy Training Image-Text Correspondences in Remote Sensing","date":"2022-02-26","arxiv_id":"2202.13117","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-for-simple-regret-minimization","slug":"meta-learning-for-simple-regret-minimization","title":"Meta-Learning for Simple Regret Minimization","date":"2022-02-25","arxiv_id":"2202.12888","repositories_listed":1,"syntology":null},{"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/contrastive-meta-learning-with-behavior","slug":"contrastive-meta-learning-with-behavior","title":"Contrastive Meta Learning with Behavior Multiplicity for Recommendation","date":"2022-02-17","arxiv_id":"2202.08523","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-generalize-across-domains-on-1","slug":"learning-to-generalize-across-domains-on-1","title":"Learning to Generalize across Domains on Single Test Samples","date":"2022-02-16","arxiv_id":"2202.08045","repositories_listed":1,"syntology":null},{"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/trace-norm-regularization-for-multi-task","slug":"trace-norm-regularization-for-multi-task","title":"Trace norm regularization for multi-task learning with scarce data","date":"2022-02-14","arxiv_id":"2202.06742","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-bootstrap-for-combating-label","slug":"learning-to-bootstrap-for-combating-label","title":"L2B: Learning to Bootstrap Robust Models for Combating Label Noise","date":"2022-02-09","arxiv_id":"2202.04291","repositories_listed":1,"syntology":null},{"url":"/paper/metakg-meta-learning-on-knowledge-graph-for","slug":"metakg-meta-learning-on-knowledge-graph-for","title":"MetaKG: Meta-learning on Knowledge Graph for Cold-start Recommendation","date":"2022-02-08","arxiv_id":"2202.03851","repositories_listed":1,"syntology":null},{"url":"/paper/alm-kd-knowledge-distillation-with-noisy","slug":"alm-kd-knowledge-distillation-with-noisy","title":"Adaptive Mixing of Auxiliary Losses in Supervised Learning","date":"2022-02-07","arxiv_id":"2202.03250","repositories_listed":1,"syntology":null},{"url":"/paper/auto-lambda-disentangling-dynamic-task","slug":"auto-lambda-disentangling-dynamic-task","title":"Auto-Lambda: Disentangling Dynamic Task Relationships","date":"2022-02-07","arxiv_id":"2202.03091","repositories_listed":1,"syntology":null},{"url":"/paper/timl-task-informed-meta-learning-for","slug":"timl-task-informed-meta-learning-for","title":"TIML: Task-Informed Meta-Learning for Agriculture","date":"2022-02-04","arxiv_id":"2202.02124","repositories_listed":1,"syntology":null},{"url":"/paper/tutorial-on-amortized-optimization-for","slug":"tutorial-on-amortized-optimization-for","title":"Tutorial on amortized optimization","date":"2022-02-01","arxiv_id":"2202.00665","repositories_listed":1,"syntology":null},{"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/deep-task-based-analog-to-digital-conversion","slug":"deep-task-based-analog-to-digital-conversion","title":"Deep Task-Based Analog-to-Digital Conversion","date":"2022-01-29","arxiv_id":"2201.12634","repositories_listed":1,"syntology":null},{"url":"/paper/consolidated-learning-a-domain-specific-model","slug":"consolidated-learning-a-domain-specific-model","title":"Consolidated learning -- a domain-specific model-free optimization strategy with examples for XGBoost and MIMIC-IV","date":"2022-01-27","arxiv_id":"2201.11815","repositories_listed":1,"syntology":null},{"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/grad2task-improved-few-shot-text-1","slug":"grad2task-improved-few-shot-text-1","title":"Grad2Task: Improved Few-shot Text Classification Using Gradients for Task Representation","date":"2022-01-27","arxiv_id":"2201.11576","repositories_listed":1,"syntology":null},{"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/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/cross-domain-few-shot-graph-classification","slug":"cross-domain-few-shot-graph-classification","title":"Cross-Domain Few-Shot Graph Classification","date":"2022-01-20","arxiv_id":"2201.08265","repositories_listed":1,"syntology":null},{"url":"/paper/fine-grained-trajectory-based-travel-time","slug":"fine-grained-trajectory-based-travel-time","title":"Fine-Grained Trajectory-based Travel Time Estimation for Multi-city Scenarios Based on Deep Meta-Learning","date":"2022-01-20","arxiv_id":"2201.08017","repositories_listed":1,"syntology":null},{"url":"/paper/towards-sample-efficient-overparameterized-1","slug":"towards-sample-efficient-overparameterized-1","title":"Towards Sample-efficient Overparameterized Meta-learning","date":"2022-01-16","arxiv_id":"2201.06142","repositories_listed":1,"syntology":null},{"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"]}}},{"url":"/paper/graph-representation-learning-for-multi-task-1","slug":"graph-representation-learning-for-multi-task-1","title":"Graph Representation Learning for Multi-Task Settings: a Meta-Learning Approach","date":"2022-01-10","arxiv_id":"2201.03326","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-learn-and-remember-super-long","slug":"learning-to-learn-and-remember-super-long","title":"Learning To Learn and Remember Super Long Multi-Domain Task Sequence","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/meta-distribution-alignment-for-generalizable","slug":"meta-distribution-alignment-for-generalizable","title":"Meta Distribution Alignment for Generalizable Person Re-Identification","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/delving-into-sample-loss-curve-to-embrace","slug":"delving-into-sample-loss-curve-to-embrace","title":"Delving into Sample Loss Curve to Embrace Noisy and Imbalanced Data","date":"2021-12-30","arxiv_id":"2201.00849","repositories_listed":1,"syntology":null},{"url":"/paper/n-omniglot-a-large-scale-neuromorphic-dataset","slug":"n-omniglot-a-large-scale-neuromorphic-dataset","title":"N-Omniglot, a large-scale neuromorphic dataset for spatio-temporal sparse few-shot learning","date":"2021-12-25","arxiv_id":"2112.13230","repositories_listed":1,"syntology":null},{"url":"/paper/does-maml-only-work-via-feature-re-use-a-data","slug":"does-maml-only-work-via-feature-re-use-a-data","title":"Does MAML Only Work via Feature Re-use? A Data Centric Perspective","date":"2021-12-24","arxiv_id":"2112.13137","repositories_listed":1,"syntology":null},{"url":"/paper/graph-few-shot-class-incremental-learning","slug":"graph-few-shot-class-incremental-learning","title":"Graph Few-shot Class-incremental Learning","date":"2021-12-23","arxiv_id":"2112.12819","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/graph-few-shot-class-incremental-learning#ran","syntology_url":"https://syntology.ai/paper/2112.12819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.12819"}},"official":{"repos":["zhen-tan-dmml/gfcil"],"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-propagation-networks-for-graph-few-shot","slug":"meta-propagation-networks-for-graph-few-shot","title":"Meta Propagation Networks for Graph Few-shot Semi-supervised Learning","date":"2021-12-18","arxiv_id":"2112.09810","repositories_listed":1,"syntology":null},{"url":"/paper/query-adaptive-few-shot-object-detection-with-1","slug":"query-adaptive-few-shot-object-detection-with-1","title":"Query Adaptive Few-Shot Object Detection with Heterogeneous Graph Convolutional Networks","date":"2021-12-17","arxiv_id":"2112.09791","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-acquire-novel-cognitive-tasks","slug":"learning-to-acquire-novel-cognitive-tasks","title":"Learning to acquire novel cognitive tasks with evolution, plasticity and meta-meta-learning","date":"2021-12-16","arxiv_id":"2112.08588","repositories_listed":1,"syntology":null},{"url":"/paper/improving-both-domain-robustness-and-domain","slug":"improving-both-domain-robustness-and-domain","title":"Improving Both Domain Robustness and Domain Adaptability in Machine Translation","date":"2021-12-15","arxiv_id":"2112.08288","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-learn-and-represent-abstractions-an","slug":"how-to-learn-and-represent-abstractions-an","title":"How to Learn and Represent Abstractions: An Investigation using Symbolic Alchemy","date":"2021-12-14","arxiv_id":"2112.08360","repositories_listed":1,"syntology":null},{"url":"/paper/leaping-through-time-with-gradient-based","slug":"leaping-through-time-with-gradient-based","title":"Leaping Through Time with Gradient-based Adaptation for Recommendation","date":"2021-12-11","arxiv_id":"2112.05914","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-learn-transferable-attack","slug":"learning-to-learn-transferable-attack","title":"Learning to Learn Transferable Attack","date":"2021-12-10","arxiv_id":"2112.06658","repositories_listed":1,"syntology":null},{"url":"/paper/pmfl-partial-meta-federated-learning-for","slug":"pmfl-partial-meta-federated-learning-for","title":"PMFL: Partial Meta-Federated Learning for heterogeneous tasks and its applications on real-world medical records","date":"2021-12-10","arxiv_id":"2112.05321","repositories_listed":1,"syntology":null},{"url":"/paper/curriculum-meta-learning-for-few-shot","slug":"curriculum-meta-learning-for-few-shot","title":"Curriculum Meta-Learning for Few-shot Classification","date":"2021-12-06","arxiv_id":"2112.02913","repositories_listed":1,"syntology":null},{"url":"/paper/a-structured-dictionary-perspective-on","slug":"a-structured-dictionary-perspective-on","title":"A Structured Dictionary Perspective on Implicit Neural Representations","date":"2021-12-03","arxiv_id":"2112.01917","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/a-structured-dictionary-perspective-on#ran","syntology_url":"https://syntology.ai/paper/2112.01917","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.01917"}},"official":{"repos":["gortizji/inr_dictionaries"],"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/airdet-few-shot-detection-without-fine-tuning","slug":"airdet-few-shot-detection-without-fine-tuning","title":"AirDet: Few-Shot Detection without Fine-tuning for Autonomous Exploration","date":"2021-12-03","arxiv_id":"2112.01740","repositories_listed":1,"syntology":null},{"url":"/paper/distilling-meta-knowledge-on-heterogeneous","slug":"distilling-meta-knowledge-on-heterogeneous","title":"Distilling Meta Knowledge on Heterogeneous Graph for Illicit Drug Trafficker Detection on Social Media","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/generative-vs-discriminative-rethinking-the","slug":"generative-vs-discriminative-rethinking-the","title":"Generative vs. Discriminative: Rethinking The Meta-Continual Learning","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hardware-adaptive-efficient-latency","slug":"hardware-adaptive-efficient-latency","title":"Hardware-adaptive Efficient Latency Prediction for NAS via Meta-Learning","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/camera-distortion-aware-3d-human-pose-1","slug":"camera-distortion-aware-3d-human-pose-1","title":"Camera Distortion-aware 3D Human Pose Estimation in Video with Optimization-based Meta-Learning","date":"2021-11-30","arxiv_id":"2111.15056","repositories_listed":1,"syntology":null},{"url":"/paper/learning-with-noisy-labels-by-efficient-1","slug":"learning-with-noisy-labels-by-efficient-1","title":"Learning with Noisy Labels by Efficient Transition Matrix Estimation to Combat Label Miscorrection","date":"2021-11-29","arxiv_id":"2111.14932","repositories_listed":1,"syntology":null},{"url":"/paper/joint-inference-and-input-optimization-in-1","slug":"joint-inference-and-input-optimization-in-1","title":"Joint inference and input optimization in equilibrium networks","date":"2021-11-25","arxiv_id":"2111.13236","repositories_listed":1,"syntology":null},{"url":"/paper/vaxnerf-revisiting-the-classic-for-voxel","slug":"vaxnerf-revisiting-the-classic-for-voxel","title":"VaxNeRF: Revisiting the Classic for Voxel-Accelerated Neural Radiance Field","date":"2021-11-25","arxiv_id":"2111.13112","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-for-few-shot-text","slug":"reinforcement-learning-for-few-shot-text","title":"Reinforcement Learning for Few-Shot Text Generation Adaptation","date":"2021-11-22","arxiv_id":"2111.11030","repositories_listed":1,"syntology":null},{"url":"/paper/towards-improving-embedding-based-models-of","slug":"towards-improving-embedding-based-models-of","title":"Towards Improving Embedding Based Models of Social Network Alignment via Pseudo Anchors","date":"2021-11-22","arxiv_id":"2111.11335","repositories_listed":1,"syntology":null},{"url":"/paper/maml-cl-edited-model-agnostic-meta-learning","slug":"maml-cl-edited-model-agnostic-meta-learning","title":"MAML-CL: Edited Model-Agnostic Meta-Learning for Continual Learning","date":"2021-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/st-sql-semi-supervised-self-training-for-text","slug":"st-sql-semi-supervised-self-training-for-text","title":"ST-SQL: Semi-Supervised Self-Training for Text-to-SQL via Column Specificity Meta-Learning","date":"2021-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-evolve-on-dynamic-graphs","slug":"learning-to-evolve-on-dynamic-graphs","title":"Learning to Evolve on Dynamic Graphs","date":"2021-11-13","arxiv_id":"2111.07032","repositories_listed":1,"syntology":null},{"url":"/paper/attention-guided-cosine-margin-for-overcoming","slug":"attention-guided-cosine-margin-for-overcoming","title":"Attention Guided Cosine Margin For Overcoming Class-Imbalance in Few-Shot Road Object Detection","date":"2021-11-12","arxiv_id":"2111.06639","repositories_listed":1,"syntology":null},{"url":"/paper/incremental-meta-learning-via-episodic-replay","slug":"incremental-meta-learning-via-episodic-replay","title":"Incremental Meta-Learning via Episodic Replay Distillation for Few-Shot Image Recognition","date":"2021-11-09","arxiv_id":"2111.04993","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rectify-for-robust-learning-with","slug":"learning-to-rectify-for-robust-learning-with","title":"Learning to Rectify for Robust Learning with Noisy Labels","date":"2021-11-08","arxiv_id":"2111.04239","repositories_listed":1,"syntology":null},{"url":"/paper/meta-tts-meta-learning-for-few-shot-speaker","slug":"meta-tts-meta-learning-for-few-shot-speaker","title":"Meta-TTS: Meta-Learning for Few-Shot Speaker Adaptive Text-to-Speech","date":"2021-11-07","arxiv_id":"2111.04040","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-the-search-distribution-of","slug":"meta-learning-the-search-distribution-of","title":"Meta-Learning the Search Distribution of Black-Box Random Search Based Adversarial Attacks","date":"2021-11-02","arxiv_id":"2111.01714","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/meta-learning-the-search-distribution-of#ran","syntology_url":"https://syntology.ai/paper/2111.01714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.01714"}},"official":{"repos":["boschresearch/meta-rs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-scalable-automl-approach-based-on-graph","slug":"a-scalable-automl-approach-based-on-graph","title":"A Scalable AutoML Approach Based on Graph Neural Networks","date":"2021-10-29","arxiv_id":"2111.00083","repositories_listed":1,"syntology":null},{"url":"/paper/rf-net-a-unified-meta-learning-framework-for","slug":"rf-net-a-unified-meta-learning-framework-for","title":"RF-Net: a Unified Meta-learning Framework for RF-enabled One-shot Human Activity Recognition","date":"2021-10-29","arxiv_id":"2111.04566","repositories_listed":1,"syntology":null},{"url":"/paper/learning-where-to-learn-gradient-sparsity-in","slug":"learning-where-to-learn-gradient-sparsity-in","title":"Learning where to learn: Gradient sparsity in meta and continual learning","date":"2021-10-27","arxiv_id":"2110.14402","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-sparse-implicit-neural","slug":"meta-learning-sparse-implicit-neural","title":"Meta-Learning Sparse Implicit Neural Representations","date":"2021-10-27","arxiv_id":"2110.14678","repositories_listed":1,"syntology":null},{"url":"/paper/revisit-multimodal-meta-learning-through-the","slug":"revisit-multimodal-meta-learning-through-the","title":"Revisit Multimodal Meta-Learning through the Lens of Multi-Task Learning","date":"2021-10-27","arxiv_id":"2110.14202","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":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/revisit-multimodal-meta-learning-through-the#ran","syntology_url":"https://syntology.ai/paper/2110.14202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14202"}},"official":{"repos":["sutd-visual-computing-group/KML-Classification"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/standing-on-the-shoulders-of-predecessors","slug":"standing-on-the-shoulders-of-predecessors","title":"Meta-Knowledge Transfer for Inductive Knowledge Graph Embedding","date":"2021-10-27","arxiv_id":"2110.14170","repositories_listed":1,"syntology":null},{"url":"/paper/on-sensitivity-of-meta-learning-to-support","slug":"on-sensitivity-of-meta-learning-to-support","title":"On sensitivity of meta-learning to support data","date":"2021-10-26","arxiv_id":"2110.13953","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-meta-learning-modification-with","slug":"multi-task-meta-learning-modification-with","title":"Simultaneous Perturbation Method for Multi-Task Weight Optimization in One-Shot Meta-Learning","date":"2021-10-25","arxiv_id":"2110.13188","repositories_listed":1,"syntology":null},{"url":"/paper/a-closer-look-at-few-shot-video","slug":"a-closer-look-at-few-shot-video","title":"A Closer Look at Few-Shot Video Classification: A New Baseline and Benchmark","date":"2021-10-24","arxiv_id":"2110.12358","repositories_listed":1,"syntology":null},{"url":"/paper/masksplit-self-supervised-meta-learning-for","slug":"masksplit-self-supervised-meta-learning-for","title":"MaskSplit: Self-supervised Meta-learning for Few-shot Semantic Segmentation","date":"2021-10-23","arxiv_id":"2110.12207","repositories_listed":1,"syntology":null},{"url":"/paper/migs-meta-image-generation-from-scene-graphs","slug":"migs-meta-image-generation-from-scene-graphs","title":"MIGS: Meta Image Generation from Scene Graphs","date":"2021-10-22","arxiv_id":"2110.11918","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-meta-learning-through-variational","slug":"bayesian-meta-learning-through-variational","title":"Bayesian Meta-Learning Through Variational Gaussian Processes","date":"2021-10-21","arxiv_id":"2110.11044","repositories_listed":1,"syntology":null},{"url":"/paper/contextual-gradient-scaling-for-few-shot","slug":"contextual-gradient-scaling-for-few-shot","title":"Contextual Gradient Scaling for Few-Shot Learning","date":"2021-10-20","arxiv_id":"2110.10353","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-domain-specific-features-to","slug":"exploiting-domain-specific-features-to","title":"Exploiting Domain-Specific Features to Enhance Domain Generalization","date":"2021-10-18","arxiv_id":"2110.09410","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":3,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/exploiting-domain-specific-features-to#ran","syntology_url":"https://syntology.ai/paper/2110.09410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.09410"}},"official":{"repos":["vinairesearch/mdsdi"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hrkd-hierarchical-relational-knowledge","slug":"hrkd-hierarchical-relational-knowledge","title":"HRKD: Hierarchical Relational Knowledge Distillation for Cross-domain Language Model Compression","date":"2021-10-16","arxiv_id":"2110.08551","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":3,"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/hrkd-hierarchical-relational-knowledge#ran","syntology_url":"https://syntology.ai/paper/2110.08551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.08551"}},"official":{"repos":["cheneydon/hrkd"],"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/meta-learning-via-language-model-in-context","slug":"meta-learning-via-language-model-in-context","title":"Meta-learning via Language Model In-context Tuning","date":"2021-10-15","arxiv_id":"2110.07814","repositories_listed":1,"syntology":null},{"url":"/paper/es-based-jacobian-enables-faster-bilevel-1","slug":"es-based-jacobian-enables-faster-bilevel-1","title":"On the Convergence Theory for Hessian-Free Bilevel Algorithms","date":"2021-10-13","arxiv_id":"2110.07004","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/es-based-jacobian-enables-faster-bilevel-1#ran","syntology_url":"https://syntology.ai/paper/2110.07004","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.07004"}},"official":{"repos":["sowmaster/esjacobians"],"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/list-lite-self-training-makes-efficient-few-1","slug":"list-lite-self-training-makes-efficient-few-1","title":"LiST: Lite Prompted Self-training Makes Parameter-Efficient Few-shot Learners","date":"2021-10-12","arxiv_id":"2110.06274","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/list-lite-self-training-makes-efficient-few-1#ran","syntology_url":"https://syntology.ai/paper/2110.06274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.06274"}},"official":{"repos":["microsoft/list"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/homogeneous-learning-self-attention-1","slug":"homogeneous-learning-self-attention-1","title":"Homogeneous Learning: Self-Attention Decentralized Deep Learning","date":"2021-10-11","arxiv_id":"2110.05290","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-in-two-player-zero-sum","slug":"reinforcement-learning-in-two-player-zero-sum","title":"Reinforcement Learning In Two Player Zero Sum Simultaneous Action Games","date":"2021-10-10","arxiv_id":"2110.04835","repositories_listed":1,"syntology":null},{"url":"/paper/graph-meta-network-for-multi-behavior","slug":"graph-meta-network-for-multi-behavior","title":"Graph Meta Network for Multi-Behavior Recommendation","date":"2021-10-08","arxiv_id":"2110.03969","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-with-task-adaptive-loss-1","slug":"meta-learning-with-task-adaptive-loss-1","title":"Meta-Learning with Task-Adaptive Loss Function for Few-Shot Learning","date":"2021-10-08","arxiv_id":"2110.03909","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meta-learning-with-task-adaptive-loss-1#ran","syntology_url":"https://syntology.ai/paper/2110.03909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.03909"}},"official":{"repos":["baiksung/MeTAL"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/darts-user-friendly-modern-machine-learning","slug":"darts-user-friendly-modern-machine-learning","title":"Darts: User-Friendly Modern Machine Learning for Time Series","date":"2021-10-07","arxiv_id":"2110.03224","repositories_listed":1,"syntology":null},{"url":"/paper/influence-balanced-loss-for-imbalanced-visual-1","slug":"influence-balanced-loss-for-imbalanced-visual-1","title":"Influence-Balanced Loss for Imbalanced Visual Classification","date":"2021-10-06","arxiv_id":"2110.02444","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/influence-balanced-loss-for-imbalanced-visual-1#ran","syntology_url":"https://syntology.ai/paper/2110.02444","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.02444"}},"official":{"repos":["pseulki/ib-loss"],"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/meta-internal-learning","slug":"meta-internal-learning","title":"Meta Internal Learning","date":"2021-10-06","arxiv_id":"2110.02900","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-internal-learning#ran","syntology_url":"https://syntology.ai/paper/2110.02900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.02900"}},"official":{"repos":["RaphaelBensTAU/MetaInternalLearning"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/metapix-domain-transfer-for-semantic","slug":"metapix-domain-transfer-for-semantic","title":"MetaPix: Domain Transfer for Semantic Segmentation by Meta Pixel Weighting","date":"2021-10-05","arxiv_id":"2110.01777","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-an-intermediate-representation","slug":"meta-learning-an-intermediate-representation","title":"Meta-learning an Intermediate Representation for Few-shot Block-wise Prediction of Landslide Susceptibility","date":"2021-10-03","arxiv_id":"2110.04922","repositories_listed":1,"syntology":null},{"url":"/paper/meta-reinforcement-learning-via-buffering","slug":"meta-reinforcement-learning-via-buffering","title":"Meta-Reinforcement Learning via Buffering Graph Signatures for Live Video Streaming Events","date":"2021-10-03","arxiv_id":"2111.09412","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-flat-fading-channels-via-meta","slug":"predicting-flat-fading-channels-via-meta","title":"Predicting Flat-Fading Channels via Meta-Learned Closed-Form Linear Filters and Equilibrium Propagation","date":"2021-10-01","arxiv_id":"2110.00414","repositories_listed":1,"syntology":null}],"record_sha256":"7cfb3698335c307d7b168f51d07028204bdb30b4f4b092f4b56092b9bdc4b161","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}