{"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/7","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":7,"pages_in_order":36,"rows_per_page":100,"rows":[601,700],"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/6","next":"/task/meta-learning/papers/8","papers":[{"url":"/paper/incremental-few-shot-object-detection-via","slug":"incremental-few-shot-object-detection-via","title":"Incremental Few-Shot Object Detection via Simple Fine-Tuning Approach","date":"2023-02-20","arxiv_id":"2302.09779","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-noisy-labels-with-decoupled","slug":"learning-from-noisy-labels-with-decoupled","title":"Learning from Noisy Labels with Decoupled Meta Label Purifier","date":"2023-02-14","arxiv_id":"2302.06810","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-triplet-network-with-adaptive","slug":"meta-learning-triplet-network-with-adaptive","title":"Meta-Learning Triplet Network with Adaptive Margins for Few-Shot Named Entity Recognition","date":"2023-02-14","arxiv_id":"2302.07739","repositories_listed":1,"syntology":null},{"url":"/paper/a-large-parametrized-space-of-meta","slug":"a-large-parametrized-space-of-meta","title":"Procedural generation of meta-reinforcement learning tasks","date":"2023-02-11","arxiv_id":"2302.05583","repositories_listed":1,"syntology":null},{"url":"/paper/on-penalty-based-bilevel-gradient-descent","slug":"on-penalty-based-bilevel-gradient-descent","title":"On Penalty-based Bilevel Gradient Descent Method","date":"2023-02-10","arxiv_id":"2302.05185","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":3,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 3 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-penalty-based-bilevel-gradient-descent#ran","syntology_url":"https://syntology.ai/paper/2302.05185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.05185"}},"official":{"repos":["hanshen95/penalized-bilevel-gradient-descent"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hypernetworks-build-implicit-neural","slug":"hypernetworks-build-implicit-neural","title":"Hypernetworks build Implicit Neural Representations of Sounds","date":"2023-02-09","arxiv_id":"2302.04959","repositories_listed":1,"syntology":null},{"url":"/paper/memory-based-meta-learning-on-non-stationary","slug":"memory-based-meta-learning-on-non-stationary","title":"Memory-Based Meta-Learning on Non-Stationary Distributions","date":"2023-02-06","arxiv_id":"2302.03067","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/memory-based-meta-learning-on-non-stationary#ran","syntology_url":"https://syntology.ai/paper/2302.03067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03067"}},"official":{"repos":["deepmind/nonstationary_mbml"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-siamese-network-for-few-shot","slug":"meta-learning-siamese-network-for-few-shot","title":"Meta-Learning Siamese Network for Few-Shot Text Classification","date":"2023-02-05","arxiv_id":"2302.03507","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-optimize-for-reinforcement","slug":"learning-to-optimize-for-reinforcement","title":"Learning to Optimize for Reinforcement Learning","date":"2023-02-03","arxiv_id":"2302.01470","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-optimize-for-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2302.01470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01470"}},"official":{"repos":["sail-sg/optim4rl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/double-permutation-equivariance-for-knowledge","slug":"double-permutation-equivariance-for-knowledge","title":"Double Equivariance for Inductive Link Prediction for Both New Nodes and New Relation Types","date":"2023-02-02","arxiv_id":"2302.01313","repositories_listed":1,"syntology":{"n":6,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 6 unverified","sample_list":"/paper/double-permutation-equivariance-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2302.01313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01313"}},"official":{"repos":["purdueminds/isdea"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":[]}}},{"url":"/paper/learning-generalized-zero-shot-learners-for","slug":"learning-generalized-zero-shot-learners-for","title":"Learning Generalized Zero-Shot Learners for Open-Domain Image Geolocalization","date":"2023-02-01","arxiv_id":"2302.00275","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-object-detection-via-variational","slug":"few-shot-object-detection-via-variational","title":"Few-Shot Object Detection via Variational Feature Aggregation","date":"2023-01-31","arxiv_id":"2301.13411","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-meta-learning-for-partially","slug":"contrastive-meta-learning-for-partially","title":"Contrastive Meta-Learning for Partially Observable Few-Shot Learning","date":"2023-01-30","arxiv_id":"2301.13136","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/contrastive-meta-learning-for-partially#ran","syntology_url":"https://syntology.ai/paper/2301.13136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.13136"}},"official":{"repos":["adamjelley/poem"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/zero-shot-causal-learning","slug":"zero-shot-causal-learning","title":"Zero-shot causal learning","date":"2023-01-28","arxiv_id":"2301.12292","repositories_listed":1,"syntology":null},{"url":"/paper/meta-temporal-point-processes","slug":"meta-temporal-point-processes","title":"Meta Temporal Point Processes","date":"2023-01-27","arxiv_id":"2301.12023","repositories_listed":1,"syntology":null},{"url":"/paper/rewarded-meta-pruning-meta-learning-with","slug":"rewarded-meta-pruning-meta-learning-with","title":"Rewarded meta-pruning: Meta Learning with Rewards for Channel Pruning","date":"2023-01-26","arxiv_id":"2301.11063","repositories_listed":1,"syntology":null},{"url":"/paper/foresee-what-you-will-learn-data-augmentation","slug":"foresee-what-you-will-learn-data-augmentation","title":"Foresee What You Will Learn: Data Augmentation for Domain Generalization in Non-stationary Environment","date":"2023-01-19","arxiv_id":"2301.07845","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-survey-to-dataset","slug":"a-comprehensive-survey-to-dataset","title":"A Comprehensive Survey of Dataset Distillation","date":"2023-01-13","arxiv_id":"2301.05603","repositories_listed":1,"syntology":null},{"url":"/paper/hyperparameter-optimization-as-a-service-on","slug":"hyperparameter-optimization-as-a-service-on","title":"Hyperparameter Optimization as a Service on INFN Cloud","date":"2023-01-13","arxiv_id":"2301.05522","repositories_listed":1,"syntology":null},{"url":"/paper/hyrsm-hybrid-relation-guided-temporal-set","slug":"hyrsm-hybrid-relation-guided-temporal-set","title":"HyRSM++: Hybrid Relation Guided Temporal Set Matching for Few-shot Action Recognition","date":"2023-01-09","arxiv_id":"2301.03330","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-learning-for-combinatorial-1","slug":"unsupervised-learning-for-combinatorial-1","title":"Unsupervised Learning for Combinatorial Optimization Needs Meta-Learning","date":"2023-01-08","arxiv_id":"2301.03116","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-node-classification-with-extremely","slug":"few-shot-node-classification-with-extremely","title":"Few-shot Node Classification with Extremely Weak Supervision","date":"2023-01-06","arxiv_id":"2301.02708","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-node-classification-with-extremely#ran","syntology_url":"https://syntology.ai/paper/2301.02708","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.02708"}},"official":{"repos":["songw-sw/x-fnc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/l-hydra-multi-head-physics-informed-neural","slug":"l-hydra-multi-head-physics-informed-neural","title":"L-HYDRA: Multi-Head Physics-Informed Neural Networks","date":"2023-01-05","arxiv_id":"2301.02152","repositories_listed":1,"syntology":null},{"url":"/paper/tracking-brand-associated-polarity-bearing","slug":"tracking-brand-associated-polarity-bearing","title":"Tracking Brand-Associated Polarity-Bearing Topics in User Reviews","date":"2023-01-03","arxiv_id":"2301.07183","repositories_listed":1,"syntology":null},{"url":"/paper/deep-random-projector-accelerated-deep-image","slug":"deep-random-projector-accelerated-deep-image","title":"Deep Random Projector: Accelerated Deep Image Prior","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/generalizable-black-box-adversarial-attack","slug":"generalizable-black-box-adversarial-attack","title":"Generalizable Black-Box Adversarial Attack with Meta Learning","date":"2023-01-01","arxiv_id":"2301.00364","repositories_listed":1,"syntology":null},{"url":"/paper/metafusion-infrared-and-visible-image-fusion","slug":"metafusion-infrared-and-visible-image-fusion","title":"MetaFusion: Infrared and Visible Image Fusion via Meta-Feature Embedding From Object Detection","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-detect-noisy-labels-using-model","slug":"learning-to-detect-noisy-labels-using-model","title":"Learning to Detect Noisy Labels Using Model-Based Features","date":"2022-12-28","arxiv_id":"2212.13767","repositories_listed":1,"syntology":null},{"url":"/paper/opt-iml-scaling-language-model-instruction","slug":"opt-iml-scaling-language-model-instruction","title":"OPT-IML: Scaling Language Model Instruction Meta Learning through the Lens of Generalization","date":"2022-12-22","arxiv_id":"2212.12017","repositories_listed":1,"syntology":null},{"url":"/paper/reusable-options-through-gradient-based-meta","slug":"reusable-options-through-gradient-based-meta","title":"Reusable Options through Gradient-based Meta Learning","date":"2022-12-22","arxiv_id":"2212.11726","repositories_listed":1,"syntology":null},{"url":"/paper/robust-meta-representation-learning-via","slug":"robust-meta-representation-learning-via","title":"Robust Meta-Representation Learning via Global Label Inference and Classification","date":"2022-12-22","arxiv_id":"2212.11702","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/robust-meta-representation-learning-via#ran","syntology_url":"https://syntology.ai/paper/2212.11702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.11702"}},"official":{"repos":["isakfalk/mela"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/are-deep-neural-networks-smarter-than-second","slug":"are-deep-neural-networks-smarter-than-second","title":"Are Deep Neural Networks SMARTer than Second Graders?","date":"2022-12-20","arxiv_id":"2212.09993","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/are-deep-neural-networks-smarter-than-second#ran","syntology_url":"https://syntology.ai/paper/2212.09993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09993"}},"official":{"repos":["merlresearch/SMART"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/asynchronous-distributed-bilevel-optimization","slug":"asynchronous-distributed-bilevel-optimization","title":"Asynchronous Distributed Bilevel Optimization","date":"2022-12-20","arxiv_id":"2212.10048","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/asynchronous-distributed-bilevel-optimization#ran","syntology_url":"https://syntology.ai/paper/2212.10048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10048"}},"official":{"repos":["iclr23submission6251/adbo"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/one-shot-domain-adaptation-in-video-based","slug":"one-shot-domain-adaptation-in-video-based","title":"One-shot skill assessment in high-stakes domains with limited data via meta learning","date":"2022-12-16","arxiv_id":"2301.00812","repositories_listed":1,"syntology":null},{"url":"/paper/metaportrait-identity-preserving-talking-head","slug":"metaportrait-identity-preserving-talking-head","title":"MetaPortrait: Identity-Preserving Talking Head Generation with Fast Personalized Adaptation","date":"2022-12-15","arxiv_id":"2212.08062","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/metaportrait-identity-preserving-talking-head#ran","syntology_url":"https://syntology.ai/paper/2212.08062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.08062"}},"official":{"repos":["Meta-Portrait/MetaPortrait"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-objective-tree-structured-parzen","slug":"multi-objective-tree-structured-parzen","title":"Speeding Up Multi-Objective Hyperparameter Optimization by Task Similarity-Based Meta-Learning for the Tree-Structured Parzen Estimator","date":"2022-12-13","arxiv_id":"2212.06751","repositories_listed":1,"syntology":null},{"url":"/paper/transductive-linear-probing-a-novel-framework","slug":"transductive-linear-probing-a-novel-framework","title":"Transductive Linear Probing: A Novel Framework for Few-Shot Node Classification","date":"2022-12-11","arxiv_id":"2212.05606","repositories_listed":1,"syntology":null},{"url":"/paper/task-adaptive-meta-learning-framework-for","slug":"task-adaptive-meta-learning-framework-for","title":"Task-Adaptive Meta-Learning Framework for Advancing Spatial Generalizability","date":"2022-12-10","arxiv_id":"2212.06864","repositories_listed":1,"syntology":null},{"url":"/paper/general-purpose-in-context-learning-by-meta","slug":"general-purpose-in-context-learning-by-meta","title":"General-Purpose In-Context Learning by Meta-Learning Transformers","date":"2022-12-08","arxiv_id":"2212.04458","repositories_listed":1,"syntology":null},{"url":"/paper/generating-and-weighting-semantically","slug":"generating-and-weighting-semantically","title":"Generating and Weighting Semantically Consistent Sample Pairs for Ultrasound Contrastive Learning","date":"2022-12-08","arxiv_id":"2212.04097","repositories_listed":1,"syntology":null},{"url":"/paper/learning-domain-invariant-prompt-for-vision","slug":"learning-domain-invariant-prompt-for-vision","title":"Learning Domain Invariant Prompt for Vision-Language Models","date":"2022-12-08","arxiv_id":"2212.04196","repositories_listed":1,"syntology":null},{"url":"/paper/domain-general-crowd-counting-in-unseen","slug":"domain-general-crowd-counting-in-unseen","title":"Domain-General Crowd Counting in Unseen Scenarios","date":"2022-12-05","arxiv_id":"2212.02573","repositories_listed":1,"syntology":null},{"url":"/paper/multi-modal-few-shot-temporal-action","slug":"multi-modal-few-shot-temporal-action","title":"Multi-Modal Few-Shot Temporal Action Detection","date":"2022-11-27","arxiv_id":"2211.14905","repositories_listed":1,"syntology":null},{"url":"/paper/self-destructing-models-increasing-the-costs","slug":"self-destructing-models-increasing-the-costs","title":"Self-Destructing Models: Increasing the Costs of Harmful Dual Uses of Foundation Models","date":"2022-11-27","arxiv_id":"2211.14946","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-destructing-models-increasing-the-costs#ran","syntology_url":"https://syntology.ai/paper/2211.14946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14946"}},"official":{"repos":["breakend/selfdestructingmodels"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/synergies-between-disentanglement-and","slug":"synergies-between-disentanglement-and","title":"Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learning","date":"2022-11-26","arxiv_id":"2211.14666","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":2,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/synergies-between-disentanglement-and#ran","syntology_url":"https://syntology.ai/paper/2211.14666","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14666"}},"official":{"repos":["tristandeleu/synergies-disentanglement-sparsity"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-the-inductive-biases-of-simple","slug":"meta-learning-the-inductive-biases-of-simple","title":"Meta-Learning the Inductive Biases of Simple Neural Circuits","date":"2022-11-24","arxiv_id":"2211.13544","repositories_listed":1,"syntology":null},{"url":"/paper/generalizable-implicit-neural-representations","slug":"generalizable-implicit-neural-representations","title":"Generalizable Implicit Neural Representations via Instance Pattern Composers","date":"2022-11-23","arxiv_id":"2211.13223","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generalizable-implicit-neural-representations#ran","syntology_url":"https://syntology.ai/paper/2211.13223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.13223"}},"official":{"repos":["kakaobrain/ginr-ipc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-rasterize-differentiable","slug":"learning-to-rasterize-differentiable","title":"Learning to Rasterize Differentiably","date":"2022-11-23","arxiv_id":"2211.13333","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-loss-for-robust-learning","slug":"dynamic-loss-for-robust-learning","title":"Dynamic Loss For Robust Learning","date":"2022-11-22","arxiv_id":"2211.12506","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-evolution-strategies-via-meta","slug":"discovering-evolution-strategies-via-meta","title":"Discovering Evolution Strategies via Meta-Black-Box Optimization","date":"2022-11-21","arxiv_id":"2211.11260","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-cheap-talk","slug":"adversarial-cheap-talk","title":"Adversarial Cheap Talk","date":"2022-11-20","arxiv_id":"2211.11030","repositories_listed":1,"syntology":null},{"url":"/paper/active-learning-with-convolutional-gaussian","slug":"active-learning-with-convolutional-gaussian","title":"Environmental Sensor Placement with Convolutional Gaussian Neural Processes","date":"2022-11-18","arxiv_id":"2211.10381","repositories_listed":1,"syntology":null},{"url":"/paper/latent-bottlenecked-attentive-neural","slug":"latent-bottlenecked-attentive-neural","title":"Latent Bottlenecked Attentive Neural Processes","date":"2022-11-15","arxiv_id":"2211.08458","repositories_listed":1,"syntology":null},{"url":"/paper/nevis-22-a-stream-of-100-tasks-sampled-from","slug":"nevis-22-a-stream-of-100-tasks-sampled-from","title":"NEVIS'22: A Stream of 100 Tasks Sampled from 30 Years of Computer Vision Research","date":"2022-11-15","arxiv_id":"2211.11747","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/nevis-22-a-stream-of-100-tasks-sampled-from#ran","syntology_url":"https://syntology.ai/paper/2211.11747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.11747"}},"official":{"repos":["deepmind/dm_nevis"],"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/few-shot-character-understanding-in-movies-as","slug":"few-shot-character-understanding-in-movies-as","title":"Few-Shot Character Understanding in Movies as an Assessment to Meta-Learning of Theory-of-Mind","date":"2022-11-09","arxiv_id":"2211.04684","repositories_listed":1,"syntology":null},{"url":"/paper/learning-advisor-networks-for-noisy-image-1","slug":"learning-advisor-networks-for-noisy-image-1","title":"Learning advisor networks for noisy image classification","date":"2022-11-08","arxiv_id":"2211.04177","repositories_listed":1,"syntology":null},{"url":"/paper/tuning-language-models-as-training-data","slug":"tuning-language-models-as-training-data","title":"Tuning Language Models as Training Data Generators for Augmentation-Enhanced Few-Shot Learning","date":"2022-11-06","arxiv_id":"2211.03044","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tuning-language-models-as-training-data#ran","syntology_url":"https://syntology.ai/paper/2211.03044","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03044"}},"official":{"repos":["yumeng5/fewgen"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-few-shot-learning-without-using-any","slug":"robust-few-shot-learning-without-using-any","title":"Robust Few-shot Learning Without Using any Adversarial Samples","date":"2022-11-03","arxiv_id":"2211.01598","repositories_listed":1,"syntology":null},{"url":"/paper/toward-unsupervised-outlier-model-selection","slug":"toward-unsupervised-outlier-model-selection","title":"Toward Unsupervised Outlier Model Selection","date":"2022-11-03","arxiv_id":"2211.01834","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/toward-unsupervised-outlier-model-selection#ran","syntology_url":"https://syntology.ai/paper/2211.01834","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.01834"}},"official":{"repos":["yzhao062/elect"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-multimodal-fusion-for-generalizable","slug":"deep-multimodal-fusion-for-generalizable","title":"Deep Multimodal Fusion for Generalizable Person Re-identification","date":"2022-11-02","arxiv_id":"2211.00933","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-benchmark-for-group-distribution-shifts","slug":"a-new-benchmark-for-group-distribution-shifts","title":"A new benchmark for group distribution shifts in hand grasp regression for object manipulation. Can meta-learning raise the bar?","date":"2022-10-31","arxiv_id":"2211.00110","repositories_listed":1,"syntology":null},{"url":"/paper/learning-new-tasks-from-a-few-examples-with","slug":"learning-new-tasks-from-a-few-examples-with","title":"Learning New Tasks from a Few Examples with Soft-Label Prototypes","date":"2022-10-31","arxiv_id":"2210.17437","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-classification-of-skin-lesions-from","slug":"few-shot-classification-of-skin-lesions-from","title":"Few-Shot Classification of Skin Lesions from Dermoscopic Images by Meta-Learning Representative Embeddings","date":"2022-10-30","arxiv_id":"2210.16954","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-biologically-plausible","slug":"meta-learning-biologically-plausible","title":"Meta-Learning Biologically Plausible Plasticity Rules with Random Feedback Pathways","date":"2022-10-28","arxiv_id":"2210.16414","repositories_listed":1,"syntology":null},{"url":"/paper/resus-warm-up-cold-users-via-meta-learning","slug":"resus-warm-up-cold-users-via-meta-learning","title":"RESUS: Warm-Up Cold Users via Meta-Learning Residual User Preferences in CTR Prediction","date":"2022-10-28","arxiv_id":"2210.16080","repositories_listed":1,"syntology":null},{"url":"/paper/mars-meta-learning-as-score-matching-in-the","slug":"mars-meta-learning-as-score-matching-in-the","title":"MARS: Meta-Learning as Score Matching in the Function Space","date":"2022-10-24","arxiv_id":"2210.13319","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mars-meta-learning-as-score-matching-in-the#ran","syntology_url":"https://syntology.ai/paper/2210.13319","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13319"}},"official":{"repos":["krunolp/mars"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["community","official","unlocated"]}}},{"url":"/paper/metaassist-robust-dialogue-state-tracking","slug":"metaassist-robust-dialogue-state-tracking","title":"MetaASSIST: Robust Dialogue State Tracking with Meta Learning","date":"2022-10-22","arxiv_id":"2210.12397","repositories_listed":1,"syntology":null},{"url":"/paper/low-resource-multilingual-and-zero-shot","slug":"low-resource-multilingual-and-zero-shot","title":"Low-Resource Multilingual and Zero-Shot Multispeaker TTS","date":"2022-10-21","arxiv_id":"2210.12223","repositories_listed":1,"syntology":null},{"url":"/paper/m-4adapter-multilingual-multi-domain","slug":"m-4adapter-multilingual-multi-domain","title":"$m^4Adapter$: Multilingual Multi-Domain Adaptation for Machine Translation with a Meta-Adapter","date":"2022-10-21","arxiv_id":"2210.11912","repositories_listed":1,"syntology":null},{"url":"/paper/continued-pretraining-for-better-zero-and-few","slug":"continued-pretraining-for-better-zero-and-few","title":"Continued Pretraining for Better Zero- and Few-Shot Promptability","date":"2022-10-19","arxiv_id":"2210.10258","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-relevance-feedback-for","slug":"incorporating-relevance-feedback-for","title":"Incorporating Relevance Feedback for Information-Seeking Retrieval using Few-Shot Document Re-Ranking","date":"2022-10-19","arxiv_id":"2210.10695","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-via-classifier-free-guidance","slug":"meta-learning-via-classifier-free-guidance","title":"Meta-Learning via Classifier(-free) Diffusion Guidance","date":"2022-10-17","arxiv_id":"2210.08942","repositories_listed":1,"syntology":null},{"url":"/paper/meta-transferring-for-deblurring","slug":"meta-transferring-for-deblurring","title":"Meta Transferring for Deblurring","date":"2022-10-14","arxiv_id":"2210.08036","repositories_listed":1,"syntology":null},{"url":"/paper/neural-routing-in-meta-learning","slug":"neural-routing-in-meta-learning","title":"Neural Routing in Meta Learning","date":"2022-10-14","arxiv_id":"2210.07932","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-relational-reasoning-via-connection","slug":"few-shot-relational-reasoning-via-connection","title":"Few-shot Relational Reasoning via Connection Subgraph Pretraining","date":"2022-10-13","arxiv_id":"2210.06722","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-relational-reasoning-via-connection#ran","syntology_url":"https://syntology.ai/paper/2210.06722","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06722"}},"official":{"repos":["snap-stanford/csr"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-meta-learning-learn-how-to-adapt","slug":"multi-task-meta-learning-learn-how-to-adapt","title":"Multi-Task Meta Learning: learn how to adapt to unseen tasks","date":"2022-10-13","arxiv_id":"2210.06989","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multi-task-meta-learning-learn-how-to-adapt#ran","syntology_url":"https://syntology.ai/paper/2210.06989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06989"}},"official":{"repos":["ricupa/mtml-learn-how-to-adapt-to-unseen-tasks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cd-fsod-a-benchmark-for-cross-domain-few-shot","slug":"cd-fsod-a-benchmark-for-cross-domain-few-shot","title":"CD-FSOD: A Benchmark for Cross-domain Few-shot Object Detection","date":"2022-10-11","arxiv_id":"2210.05311","repositories_listed":1,"syntology":null},{"url":"/paper/discovered-policy-optimisation","slug":"discovered-policy-optimisation","title":"Discovered Policy Optimisation","date":"2022-10-11","arxiv_id":"2210.05639","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-with-self-improving-momentum","slug":"meta-learning-with-self-improving-momentum","title":"Meta-Learning with Self-Improving Momentum Target","date":"2022-10-11","arxiv_id":"2210.05185","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/meta-learning-with-self-improving-momentum#ran","syntology_url":"https://syntology.ai/paper/2210.05185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.05185"}},"official":{"repos":["jihoontack/SiMT"],"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/stock-trading-volume-prediction-with-dual","slug":"stock-trading-volume-prediction-with-dual","title":"Stock Trading Volume Prediction with Dual-Process Meta-Learning","date":"2022-10-11","arxiv_id":"2211.01762","repositories_listed":1,"syntology":null},{"url":"/paper/tgdm-target-guided-dynamic-mixup-for-cross","slug":"tgdm-target-guided-dynamic-mixup-for-cross","title":"TGDM: Target Guided Dynamic Mixup for Cross-Domain Few-Shot Learning","date":"2022-10-11","arxiv_id":"2210.05392","repositories_listed":1,"syntology":null},{"url":"/paper/multi-modal-fusion-by-meta-initialization","slug":"multi-modal-fusion-by-meta-initialization","title":"Multi-Modal Fusion by Meta-Initialization","date":"2022-10-10","arxiv_id":"2210.04843","repositories_listed":1,"syntology":null},{"url":"/paper/dimes-a-differentiable-meta-solver-for","slug":"dimes-a-differentiable-meta-solver-for","title":"DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems","date":"2022-10-08","arxiv_id":"2210.04123","repositories_listed":1,"syntology":{"n":25,"n_ran":10,"n_constructed":1,"n_ran_checked":1,"n_instrument":9,"n_unverified":15,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 9 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/dimes-a-differentiable-meta-solver-for#ran","syntology_url":"https://syntology.ai/paper/2210.04123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.04123"}},"official":{"repos":["dimesteam/dimes"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":15,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-dmoe-adapting-to-domain-shift-by-meta","slug":"meta-dmoe-adapting-to-domain-shift-by-meta","title":"Meta-DMoE: Adapting to Domain Shift by Meta-Distillation from Mixture-of-Experts","date":"2022-10-08","arxiv_id":"2210.03885","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/meta-dmoe-adapting-to-domain-shift-by-meta#ran","syntology_url":"https://syntology.ai/paper/2210.03885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03885"}},"official":{"repos":["n3il666/meta-dmoe"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-learn-and-sample-brdfs","slug":"learning-to-learn-and-sample-brdfs","title":"Learning to Learn and Sample BRDFs","date":"2022-10-07","arxiv_id":"2210.03510","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-calibration-of-set-predictors-via","slug":"few-shot-calibration-of-set-predictors-via","title":"Few-Shot Calibration of Set Predictors via Meta-Learned Cross-Validation-Based Conformal Prediction","date":"2022-10-06","arxiv_id":"2210.03067","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-generation-of-personalized-neural","slug":"few-shot-generation-of-personalized-neural","title":"Few-shot Generation of Personalized Neural Surrogates for Cardiac Simulation via Bayesian Meta-Learning","date":"2022-10-06","arxiv_id":"2210.02967","repositories_listed":1,"syntology":null},{"url":"/paper/hypernetwork-approach-to-bayesian-maml","slug":"hypernetwork-approach-to-bayesian-maml","title":"Hypernetwork approach to Bayesian MAML","date":"2022-10-06","arxiv_id":"2210.02796","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-aware-meta-learning-for","slug":"uncertainty-aware-meta-learning-for","title":"Uncertainty-Aware Meta-Learning for Multimodal Task Distributions","date":"2022-10-04","arxiv_id":"2210.01881","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-distillation-with-reptile-meta","slug":"knowledge-distillation-with-reptile-meta","title":"Knowledge Distillation with Reptile Meta-Learning for Pretrained Language Model Compression","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/recurrent-meta-learning-against-generalized","slug":"recurrent-meta-learning-against-generalized","title":"Recurrent Meta-Learning against Generalized Cold-start Problem in CTR Prediction","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-clustering-based-pseudo-labeling","slug":"rethinking-clustering-based-pseudo-labeling","title":"Rethinking Clustering-Based Pseudo-Labeling for Unsupervised Meta-Learning","date":"2022-09-27","arxiv_id":"2209.13635","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-a-cross-lingual-manifold-for","slug":"meta-learning-a-cross-lingual-manifold-for","title":"Meta-Learning a Cross-lingual Manifold for Semantic Parsing","date":"2022-09-26","arxiv_id":"2209.12577","repositories_listed":1,"syntology":null},{"url":"/paper/blinder-end-to-end-privacy-protection-in","slug":"blinder-end-to-end-privacy-protection-in","title":"Blinder: End-to-end Privacy Protection in Sensing Systems via Personalized Federated Learning","date":"2022-09-24","arxiv_id":"2209.12046","repositories_listed":1,"syntology":null},{"url":"/paper/metaprompting-learning-to-learn-better-1","slug":"metaprompting-learning-to-learn-better-1","title":"MetaPrompting: Learning to Learn Better Prompts","date":"2022-09-23","arxiv_id":"2209.11486","repositories_listed":1,"syntology":null},{"url":"/paper/an-investigation-of-the-bias-variance","slug":"an-investigation-of-the-bias-variance","title":"An Investigation of the Bias-Variance Tradeoff in Meta-Gradients","date":"2022-09-22","arxiv_id":"2209.11303","repositories_listed":1,"syntology":null},{"url":"/paper/bome-bilevel-optimization-made-easy-a-simple","slug":"bome-bilevel-optimization-made-easy-a-simple","title":"BOME! Bilevel Optimization Made Easy: A Simple First-Order Approach","date":"2022-09-19","arxiv_id":"2209.08709","repositories_listed":1,"syntology":null},{"url":"/paper/improving-fake-news-detection-of-influential","slug":"improving-fake-news-detection-of-influential","title":"Improving Fake News Detection of Influential Domain via Domain- and Instance-Level Transfer","date":"2022-09-19","arxiv_id":"2209.08902","repositories_listed":1,"syntology":null},{"url":"/paper/meta-adapters-parameter-efficient-few-shot","slug":"meta-adapters-parameter-efficient-few-shot","title":"Meta-Adapters: Parameter Efficient Few-shot Fine-tuning through Meta-Learning","date":"2022-09-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-weight-samples-for-dynamic-early","slug":"learning-to-weight-samples-for-dynamic-early","title":"Learning to Weight Samples for Dynamic Early-exiting Networks","date":"2022-09-17","arxiv_id":"2209.08310","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-to-weight-samples-for-dynamic-early#ran","syntology_url":"https://syntology.ai/paper/2209.08310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08310"}},"official":{"repos":["leaplabthu/l2w-den"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"ae58f13ae9c2ec2c6bcf630f2cc7bdbce2787253ebd1076f50c58a3c514c054e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}