{"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/14","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":14,"pages_in_order":36,"rows_per_page":100,"rows":[1301,1400],"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/13","next":"/task/meta-learning/papers/15","papers":[{"url":"/paper/uncertainty-in-model-agnostic-meta-learning","slug":"uncertainty-in-model-agnostic-meta-learning","title":"Uncertainty in Model-Agnostic Meta-Learning using Variational Inference","date":"2019-07-27","arxiv_id":"1907.11864","repositories_listed":1,"syntology":null},{"url":"/paper/urban-traffic-prediction-from-spatio-temporal","slug":"urban-traffic-prediction-from-spatio-temporal","title":"Urban Traffic Prediction from Spatio-Temporal Data Using Deep Meta Learning","date":"2019-07-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-prior-selection-for-repertoire-based","slug":"adaptive-prior-selection-for-repertoire-based","title":"Adaptive Prior Selection for Repertoire-based Online Adaptation in Robotics","date":"2019-07-16","arxiv_id":"1907.07029","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-prior-selection-for-repertoire-based#ran","syntology_url":"https://syntology.ai/paper/1907.07029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.07029"}},"official":{"repos":["resibots/kaushik_2019_aprol"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/evolvability-es-scalable-and-direct","slug":"evolvability-es-scalable-and-direct","title":"Evolvability ES: Scalable and Direct Optimization of Evolvability","date":"2019-07-13","arxiv_id":"1907.06077","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-representation-learning-for-out-of","slug":"few-shot-representation-learning-for-out-of","title":"Few-Shot Representation Learning for Out-Of-Vocabulary Words","date":"2019-07-01","arxiv_id":"1907.00505","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/few-shot-representation-learning-for-out-of#ran","syntology_url":"https://syntology.ai/paper/1907.00505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00505"}},"official":{"repos":["acbull/HiCE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/two-stage-optimization-for-machine-learning","slug":"two-stage-optimization-for-machine-learning","title":"Two-stage Optimization for Machine Learning Workflow","date":"2019-07-01","arxiv_id":"1907.00678","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-of-textual-representations","slug":"meta-learning-of-textual-representations","title":"Meta-learning of textual representations","date":"2019-06-21","arxiv_id":"1906.08934","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-flexible-multi-task-classification","slug":"fast-and-flexible-multi-task-classification","title":"Fast and Flexible Multi-Task Classification Using Conditional Neural Adaptive Processes","date":"2019-06-18","arxiv_id":"1906.07697","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-forget-for-meta-learning","slug":"learning-to-forget-for-meta-learning","title":"Learning to Forget for Meta-Learning","date":"2019-06-13","arxiv_id":"1906.05895","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-forget-for-meta-learning#ran","syntology_url":"https://syntology.ai/paper/1906.05895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05895"}},"official":{"repos":["baiksung/L2F"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-via-learned-loss","slug":"meta-learning-via-learned-loss","title":"Meta-Learning via Learned Loss","date":"2019-06-12","arxiv_id":"1906.05374","repositories_listed":1,"syntology":null},{"url":"/paper/domain-adaptive-dialog-generation-via-meta","slug":"domain-adaptive-dialog-generation-via-meta","title":"Domain Adaptive Dialog Generation via Meta Learning","date":"2019-06-08","arxiv_id":"1906.03520","repositories_listed":1,"syntology":null},{"url":"/paper/one-shot-neural-architecture-search-via","slug":"one-shot-neural-architecture-search-via","title":"One-Shot Neural Architecture Search via Compressive Sensing","date":"2019-06-07","arxiv_id":"1906.02869","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/one-shot-neural-architecture-search-via#ran","syntology_url":"https://syntology.ai/paper/1906.02869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02869"}},"official":{"repos":["chomd90/conas_release"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-gradient-based-meta-learning-methods","slug":"adaptive-gradient-based-meta-learning-methods","title":"Adaptive Gradient-Based Meta-Learning Methods","date":"2019-06-06","arxiv_id":"1906.02717","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adaptive-gradient-based-meta-learning-methods#ran","syntology_url":"https://syntology.ai/paper/1906.02717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02717"}},"official":{"repos":["mkhodak/ARUBA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/query-efficient-meta-attack-to-deep-neural","slug":"query-efficient-meta-attack-to-deep-neural","title":"Query-efficient Meta Attack to Deep Neural Networks","date":"2019-06-06","arxiv_id":"1906.02398","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/query-efficient-meta-attack-to-deep-neural#ran","syntology_url":"https://syntology.ai/paper/1906.02398","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02398"}},"official":{"repos":["dydjw9/MetaAttack_ICLR2020"],"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/a-meta-learning-recommender-system-for","slug":"a-meta-learning-recommender-system-for","title":"A meta-learning recommender system for hyperparameter tuning: predicting when tuning improves SVM classifiers","date":"2019-06-04","arxiv_id":"1906.01684","repositories_listed":1,"syntology":null},{"url":"/paper/190600562","slug":"190600562","title":"Learning to Self-Train for Semi-Supervised Few-Shot Classification","date":"2019-06-03","arxiv_id":"1906.00562","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190600562#ran","syntology_url":"https://syntology.ai/paper/1906.00562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00562"}},"official":{"repos":["xinzheli1217/learning-to-self-train"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/190600391","slug":"190600391","title":"Sequential Scenario-Specific Meta Learner for Online Recommendation","date":"2019-06-02","arxiv_id":"1906.00391","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190600391#ran","syntology_url":"https://syntology.ai/paper/1906.00391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00391"}},"official":{"repos":["THUDM/ScenarioMeta"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/190600181","slug":"190600181","title":"Learning to Transfer: Unsupervised Meta Domain Translation","date":"2019-06-01","arxiv_id":"1906.00181","repositories_listed":1,"syntology":null},{"url":"/paper/subspace-networks-for-few-shot-classification","slug":"subspace-networks-for-few-shot-classification","title":"Regression Networks for Meta-Learning Few-Shot Classification","date":"2019-05-31","arxiv_id":"1905.13613","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/subspace-networks-for-few-shot-classification#ran","syntology_url":"https://syntology.ai/paper/1905.13613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13613"}},"official":{"repos":["ArnoutDevos/RegressionNet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-balance-bayesian-meta-learning","slug":"learning-to-balance-bayesian-meta-learning","title":"Learning to Balance: Bayesian Meta-Learning for Imbalanced and Out-of-distribution Tasks","date":"2019-05-30","arxiv_id":"1905.12917","repositories_listed":1,"syntology":null},{"url":"/paper/meta-dropout-learning-to-perturb-features-for","slug":"meta-dropout-learning-to-perturb-features-for","title":"Meta Dropout: Learning to Perturb Features for Generalization","date":"2019-05-30","arxiv_id":"1905.12914","repositories_listed":1,"syntology":null},{"url":"/paper/190511641","slug":"190511641","title":"Image Deformation Meta-Networks for One-Shot Learning","date":"2019-05-28","arxiv_id":"1905.11641","repositories_listed":1,"syntology":null},{"url":"/paper/dataset2vec-learning-dataset-meta-features","slug":"dataset2vec-learning-dataset-meta-features","title":"Dataset2Vec: Learning Dataset Meta-Features","date":"2019-05-27","arxiv_id":"1905.11063","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-discretize-solving-1d-scalar","slug":"learning-to-discretize-solving-1d-scalar","title":"Learning to Discretize: Solving 1D Scalar Conservation Laws via Deep Reinforcement Learning","date":"2019-05-27","arxiv_id":"1905.11079","repositories_listed":1,"syntology":null},{"url":"/paper/viterbinet-a-deep-learning-based-viterbi","slug":"viterbinet-a-deep-learning-based-viterbi","title":"ViterbiNet: A Deep Learning Based Viterbi Algorithm for Symbol Detection","date":"2019-05-26","arxiv_id":"1905.10750","repositories_listed":1,"syntology":null},{"url":"/paper/personalizing-dialogue-agents-via-meta","slug":"personalizing-dialogue-agents-via-meta","title":"Personalizing Dialogue Agents via Meta-Learning","date":"2019-05-24","arxiv_id":"1905.10033","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/personalizing-dialogue-agents-via-meta#ran","syntology_url":"https://syntology.ai/paper/1905.10033","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10033"}},"official":{"repos":["HLTCHKUST/PAML"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-gnn-on-few-shot-node-classification-in","slug":"meta-gnn-on-few-shot-node-classification-in","title":"Meta-GNN: On Few-shot Node Classification in Graph Meta-learning","date":"2019-05-23","arxiv_id":"1905.09718","repositories_listed":1,"syntology":null},{"url":"/paper/a-neural-symbolic-architecture-for-inverse","slug":"a-neural-symbolic-architecture-for-inverse","title":"A Neural-Symbolic Architecture for Inverse Graphics Improved by Lifelong Meta-Learning","date":"2019-05-22","arxiv_id":"1905.08910","repositories_listed":1,"syntology":null},{"url":"/paper/deep-compressed-sensing","slug":"deep-compressed-sensing","title":"Deep Compressed Sensing","date":"2019-05-16","arxiv_id":"1905.06723","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-optimization-of-loops-and-limits","slug":"efficient-optimization-of-loops-and-limits","title":"Efficient Optimization of Loops and Limits with Randomized Telescoping Sums","date":"2019-05-16","arxiv_id":"1905.07006","repositories_listed":1,"syntology":null},{"url":"/paper/tapnet-neural-network-augmented-with-task","slug":"tapnet-neural-network-augmented-with-task","title":"TapNet: Neural Network Augmented with Task-Adaptive Projection for Few-Shot Learning","date":"2019-05-16","arxiv_id":"1905.06549","repositories_listed":1,"syntology":null},{"url":"/paper/lgm-net-learning-to-generate-matching","slug":"lgm-net-learning-to-generate-matching","title":"LGM-Net: Learning to Generate Matching Networks for Few-Shot Learning","date":"2019-05-15","arxiv_id":"1905.06331","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lgm-net-learning-to-generate-matching#ran","syntology_url":"https://syntology.ai/paper/1905.06331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06331"}},"official":{"repos":["likesiwell/LGM-Net"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-reinforcement-learning-as-task-inference","slug":"meta-reinforcement-learning-as-task-inference","title":"Meta reinforcement learning as task inference","date":"2019-05-15","arxiv_id":"1905.06424","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchically-structured-meta-learning","slug":"hierarchically-structured-meta-learning","title":"Hierarchically Structured Meta-learning","date":"2019-05-13","arxiv_id":"1905.05301","repositories_listed":1,"syntology":null},{"url":"/paper/metapred-meta-learning-for-clinical-risk","slug":"metapred-meta-learning-for-clinical-risk","title":"MetaPred: Meta-Learning for Clinical Risk Prediction with Limited Patient Electronic Health Records","date":"2019-05-08","arxiv_id":"1905.03218","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-adaptive-gaze-estimation","slug":"few-shot-adaptive-gaze-estimation","title":"Few-Shot Adaptive Gaze Estimation","date":"2019-05-06","arxiv_id":"1905.01941","repositories_listed":1,"syntology":null},{"url":"/paper/amortized-bayesian-meta-learning","slug":"amortized-bayesian-meta-learning","title":"Amortized Bayesian Meta-Learning","date":"2019-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/warm-up-cold-start-advertisements-improving","slug":"warm-up-cold-start-advertisements-improving","title":"Warm Up Cold-start Advertisements: Improving CTR Predictions via Learning to Learn ID Embeddings","date":"2019-04-25","arxiv_id":"1904.11547","repositories_listed":1,"syntology":null},{"url":"/paper/lcc-learning-to-customize-and-combine-neural","slug":"lcc-learning-to-customize-and-combine-neural","title":"An Ensemble of Epoch-wise Empirical Bayes for Few-shot Learning","date":"2019-04-17","arxiv_id":"1904.08479","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lcc-learning-to-customize-and-combine-neural#ran","syntology_url":"https://syntology.ai/paper/1904.08479","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08479"}},"official":{"repos":["yaoyao-liu/E3BM"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tafe-net-task-aware-feature-embeddings-for-1","slug":"tafe-net-task-aware-feature-embeddings-for-1","title":"TAFE-Net: Task-Aware Feature Embeddings for Low Shot Learning","date":"2019-04-11","arxiv_id":"1904.05967","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tafe-net-task-aware-feature-embeddings-for-1#ran","syntology_url":"https://syntology.ai/paper/1904.05967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.05967"}},"official":{"repos":["ucbdrive/tafe-net"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/190408502","slug":"190408502","title":"Few-Shot Learning with Localization in Realistic Settings","date":"2019-04-09","arxiv_id":"1904.08502","repositories_listed":1,"syntology":null},{"url":"/paper/compare-more-nuancedpairwise-alignment","slug":"compare-more-nuancedpairwise-alignment","title":"Compare More Nuanced:Pairwise Alignment Bilinear Network For Few-shot Fine-grained Learning","date":"2019-04-07","arxiv_id":"1904.03580","repositories_listed":1,"syntology":null},{"url":"/paper/diversity-with-cooperation-ensemble-methods","slug":"diversity-with-cooperation-ensemble-methods","title":"Diversity with Cooperation: Ensemble Methods for Few-Shot Classification","date":"2019-03-27","arxiv_id":"1903.11341","repositories_listed":1,"syntology":null},{"url":"/paper/concurrent-meta-reinforcement-learning","slug":"concurrent-meta-reinforcement-learning","title":"Concurrent Meta Reinforcement Learning","date":"2019-03-07","arxiv_id":"1903.02710","repositories_listed":1,"syntology":null},{"url":"/paper/learning-how-to-demodulate-from-few-pilots","slug":"learning-how-to-demodulate-from-few-pilots","title":"Learning How to Demodulate from Few Pilots via Meta-Learning","date":"2019-03-06","arxiv_id":"1903.02184","repositories_listed":1,"syntology":null},{"url":"/paper/model-primitive-hierarchical-lifelong","slug":"model-primitive-hierarchical-lifelong","title":"Model Primitive Hierarchical Lifelong Reinforcement Learning","date":"2019-03-04","arxiv_id":"1903.01567","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/model-primitive-hierarchical-lifelong#ran","syntology_url":"https://syntology.ai/paper/1903.01567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.01567"}},"official":{"repos":["sisl/MPHRL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/norml-no-reward-meta-learning","slug":"norml-no-reward-meta-learning","title":"NoRML: No-Reward Meta Learning","date":"2019-03-04","arxiv_id":"1903.01063","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-task-transfer","slug":"zero-shot-task-transfer","title":"Zero-Shot Task Transfer","date":"2019-03-04","arxiv_id":"1903.01092","repositories_listed":1,"syntology":null},{"url":"/paper/provable-guarantees-for-gradient-based-meta","slug":"provable-guarantees-for-gradient-based-meta","title":"Provable Guarantees for Gradient-Based Meta-Learning","date":"2019-02-27","arxiv_id":"1902.10644","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attacks-on-graph-neural-networks","slug":"adversarial-attacks-on-graph-neural-networks","title":"Adversarial Attacks on Graph Neural Networks via Meta Learning","date":"2019-02-22","arxiv_id":"1902.08412","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adversarial-attacks-on-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1902.08412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.08412"}},"official":{"repos":["danielzuegner/gnn-meta-attack"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/centroid-networks-for-few-shot-clustering-and","slug":"centroid-networks-for-few-shot-clustering-and","title":"Are Few-Shot Learning Benchmarks too Simple ? Solving them without Task Supervision at Test-Time","date":"2019-02-22","arxiv_id":"1902.08605","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/centroid-networks-for-few-shot-clustering-and#ran","syntology_url":"https://syntology.ai/paper/1902.08605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.08605"}},"official":null}},{"url":"/paper/adaptive-cross-modal-few-shot-learning","slug":"adaptive-cross-modal-few-shot-learning","title":"Adaptive Cross-Modal Few-Shot Learning","date":"2019-02-19","arxiv_id":"1902.07104","repositories_listed":1,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adaptive-cross-modal-few-shot-learning#ran","syntology_url":"https://syntology.ai/paper/1902.07104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07104"}},"official":null}},{"url":"/paper/fast-efficient-hyperparameter-tuning-for","slug":"fast-efficient-hyperparameter-tuning-for","title":"Fast Efficient Hyperparameter Tuning for Policy Gradients","date":"2019-02-18","arxiv_id":"1902.06583","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/fast-efficient-hyperparameter-tuning-for#ran","syntology_url":"https://syntology.ai/paper/1902.06583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06583"}},"official":null}},{"url":"/paper/task2vec-task-embedding-for-meta-learning","slug":"task2vec-task-embedding-for-meta-learning","title":"Task2Vec: Task Embedding for Meta-Learning","date":"2019-02-10","arxiv_id":"1902.03545","repositories_listed":1,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/task2vec-task-embedding-for-meta-learning#ran","syntology_url":"https://syntology.ai/paper/1902.03545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.03545"}},"official":null}},{"url":"/paper/adaptive-posterior-learning-few-shot-learning","slug":"adaptive-posterior-learning-few-shot-learning","title":"Adaptive Posterior Learning: few-shot learning with a surprise-based memory module","date":"2019-02-07","arxiv_id":"1902.02527","repositories_listed":1,"syntology":null},{"url":"/paper/emergence-of-hierarchy-via-reinforcement","slug":"emergence-of-hierarchy-via-reinforcement","title":"Self-organization of action hierarchy and compositionality by reinforcement learning with recurrent neural networks","date":"2019-01-29","arxiv_id":"1901.10113","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-multiple-cities-a-meta-learning","slug":"learning-from-multiple-cities-a-meta-learning","title":"Learning from Multiple Cities: A Meta-Learning Approach for Spatial-Temporal Prediction","date":"2019-01-24","arxiv_id":"1901.08518","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-skip-prediction-with-few-shot-in","slug":"sequential-skip-prediction-with-few-shot-in","title":"Sequential Skip Prediction with Few-shot in Streamed Music Contents","date":"2019-01-24","arxiv_id":"1901.08203","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-for-few-shot-keyword-spotting","slug":"meta-learning-for-few-shot-keyword-spotting","title":"An Investigation of Few-Shot Learning in Spoken Term Classification","date":"2018-12-26","arxiv_id":"1812.10233","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-meta-network-architecture-learning","slug":"bayesian-meta-network-architecture-learning","title":"Meta Architecture Search","date":"2018-12-22","arxiv_id":"1812.09584","repositories_listed":1,"syntology":null},{"url":"/paper/modular-meta-learning-in-abstract-graph","slug":"modular-meta-learning-in-abstract-graph","title":"Modular meta-learning in abstract graph networks for combinatorial generalization","date":"2018-12-19","arxiv_id":"1812.07768","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-classification-in-named-entity","slug":"few-shot-classification-in-named-entity","title":"Few-shot classification in Named Entity Recognition Task","date":"2018-12-14","arxiv_id":"1812.06158","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-learn-from-noisy-labeled-data","slug":"learning-to-learn-from-noisy-labeled-data","title":"Learning to Learn from Noisy Labeled Data","date":"2018-12-13","arxiv_id":"1812.05214","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-deep-visual-words-for-fast","slug":"meta-learning-deep-visual-words-for-fast","title":"Meta Learning Deep Visual Words for Fast Video Object Segmentation","date":"2018-12-04","arxiv_id":"1812.01397","repositories_listed":1,"syntology":null},{"url":"/paper/recurrent-machines-for-likelihood-free","slug":"recurrent-machines-for-likelihood-free","title":"Recurrent machines for likelihood-free inference","date":"2018-11-30","arxiv_id":"1811.12932","repositories_listed":1,"syntology":null},{"url":"/paper/guiding-policies-with-language-via-meta","slug":"guiding-policies-with-language-via-meta","title":"Guiding Policies with Language via Meta-Learning","date":"2018-11-19","arxiv_id":"1811.07882","repositories_listed":1,"syntology":null},{"url":"/paper/incremental-few-shot-learning-with-attention","slug":"incremental-few-shot-learning-with-attention","title":"Incremental Few-Shot Learning with Attention Attractor Networks","date":"2018-10-16","arxiv_id":"1810.07218","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/incremental-few-shot-learning-with-attention#ran","syntology_url":"https://syntology.ai/paper/1810.07218","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.07218"}},"official":{"repos":["renmengye/inc-few-shot-attractor-public"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-context-adaptation-via-meta-learning","slug":"fast-context-adaptation-via-meta-learning","title":"Fast Context Adaptation via Meta-Learning","date":"2018-10-08","arxiv_id":"1810.03642","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fast-context-adaptation-via-meta-learning#ran","syntology_url":"https://syntology.ai/paper/1810.03642","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.03642"}},"official":{"repos":["lmzintgraf/cavia"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/autoloss-learning-discrete-schedules-for","slug":"autoloss-learning-discrete-schedules-for","title":"AutoLoss: Learning Discrete Schedules for Alternate Optimization","date":"2018-10-04","arxiv_id":"1810.02442","repositories_listed":1,"syntology":null},{"url":"/paper/layer-compensated-pruning-for-resource","slug":"layer-compensated-pruning-for-resource","title":"Layer-compensated Pruning for Resource-constrained Convolutional Neural Networks","date":"2018-10-01","arxiv_id":"1810.00518","repositories_listed":1,"syntology":null},{"url":"/paper/learning-quickly-to-plan-quickly-using","slug":"learning-quickly-to-plan-quickly-using","title":"Learning Quickly to Plan Quickly Using Modular Meta-Learning","date":"2018-09-20","arxiv_id":"1809.07878","repositories_listed":1,"syntology":null},{"url":"/paper/open-world-learning-and-application-to","slug":"open-world-learning-and-application-to","title":"Open-world Learning and Application to Product Classification","date":"2018-09-17","arxiv_id":"1809.06004","repositories_listed":1,"syntology":null},{"url":"/paper/searching-for-efficient-multi-scale","slug":"searching-for-efficient-multi-scale","title":"Searching for Efficient Multi-Scale Architectures for Dense Image Prediction","date":"2018-09-11","arxiv_id":"1809.04184","repositories_listed":1,"syntology":null},{"url":"/paper/learning-invariances-for-policy","slug":"learning-invariances-for-policy","title":"Learning Invariances for Policy Generalization","date":"2018-09-07","arxiv_id":"1809.02591","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-adapt-a-meta-learning-approach","slug":"learning-to-adapt-a-meta-learning-approach","title":"Learning to adapt: a meta-learning approach for speaker adaptation","date":"2018-08-30","arxiv_id":"1808.10239","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-autoencoders-for-few-shot","slug":"meta-learning-autoencoders-for-few-shot","title":"Meta-learning autoencoders for few-shot prediction","date":"2018-07-26","arxiv_id":"1807.09912","repositories_listed":1,"syntology":null},{"url":"/paper/autoprognosis-automated-clinical-prognostic-1","slug":"autoprognosis-automated-clinical-prognostic-1","title":"AutoPrognosis: Automated Clinical Prognostic Modeling via Bayesian Optimization with Structured Kernel Learning","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/dice-the-infinitely-differentiable-monte-1","slug":"dice-the-infinitely-differentiable-monte-1","title":"DiCE: The Infinitely Differentiable Monte Carlo Estimator","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/guided-evolutionary-strategies-escaping-the","slug":"guided-evolutionary-strategies-escaping-the","title":"Guided evolutionary strategies: Augmenting random search with surrogate gradients","date":"2018-06-26","arxiv_id":"1806.10230","repositories_listed":1,"syntology":null},{"url":"/paper/modular-meta-learning","slug":"modular-meta-learning","title":"Modular meta-learning","date":"2018-06-26","arxiv_id":"1806.10166","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-for-stochastic-gradient-mcmc","slug":"meta-learning-for-stochastic-gradient-mcmc","title":"Meta-Learning for Stochastic Gradient MCMC","date":"2018-06-12","arxiv_id":"1806.04522","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-model-agnostic-meta-learning","slug":"probabilistic-model-agnostic-meta-learning","title":"Probabilistic Model-Agnostic Meta-Learning","date":"2018-06-07","arxiv_id":"1806.02817","repositories_listed":1,"syntology":null},{"url":"/paper/tafe-net-task-aware-feature-embeddings-for","slug":"tafe-net-task-aware-feature-embeddings-for","title":"Deep Mixture of Experts via Shallow Embedding","date":"2018-06-05","arxiv_id":"1806.01531","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tafe-net-task-aware-feature-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/1806.01531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01531"}},"official":null}},{"url":"/paper/text-normalization-using-memory-augmented","slug":"text-normalization-using-memory-augmented","title":"Text normalization using memory augmented neural networks","date":"2018-05-31","arxiv_id":"1806.00044","repositories_listed":1,"syntology":null},{"url":"/paper/lifelong-domain-word-embedding-via-meta","slug":"lifelong-domain-word-embedding-via-meta","title":"Lifelong Domain Word Embedding via Meta-Learning","date":"2018-05-25","arxiv_id":"1805.09991","repositories_listed":1,"syntology":null},{"url":"/paper/been-there-done-that-meta-learning-with","slug":"been-there-done-that-meta-learning-with","title":"Been There, Done That: Meta-Learning with Episodic Recall","date":"2018-05-24","arxiv_id":"1805.09692","repositories_listed":1,"syntology":null},{"url":"/paper/meta-gradient-reinforcement-learning","slug":"meta-gradient-reinforcement-learning","title":"Meta-Gradient Reinforcement Learning","date":"2018-05-24","arxiv_id":"1805.09801","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meta-gradient-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/1805.09801","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09801"}},"official":null}},{"url":"/paper/meta-learning-probabilistic-inference-for","slug":"meta-learning-probabilistic-inference-for","title":"Meta-Learning Probabilistic Inference For Prediction","date":"2018-05-24","arxiv_id":"1805.09921","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/meta-learning-probabilistic-inference-for#ran","syntology_url":"https://syntology.ai/paper/1805.09921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09921"}},"official":{"repos":["Gordonjo/versa"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-with-hessian-free-approach-in","slug":"meta-learning-with-hessian-free-approach-in","title":"Meta-Learning with Hessian-Free Approach in Deep Neural Nets Training","date":"2018-05-22","arxiv_id":"1805.08462","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-maximum-entropy-inverse","slug":"multi-task-maximum-entropy-inverse","title":"Multi-task Maximum Entropy Inverse Reinforcement Learning","date":"2018-05-22","arxiv_id":"1805.08882","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multi-task-maximum-entropy-inverse#ran","syntology_url":"https://syntology.ai/paper/1805.08882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.08882"}},"official":{"repos":["HumanCompatibleAI/population-irl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/piecewise-classifier-mappings-learning-fine","slug":"piecewise-classifier-mappings-learning-fine","title":"Piecewise classifier mappings: Learning fine-grained learners for novel categories with few examples","date":"2018-05-11","arxiv_id":"1805.04288","repositories_listed":1,"syntology":null},{"url":"/paper/natural-language-to-structured-query","slug":"natural-language-to-structured-query","title":"Natural Language to Structured Query Generation via Meta-Learning","date":"2018-03-02","arxiv_id":"1803.02400","repositories_listed":1,"syntology":null},{"url":"/paper/federated-meta-learning-for-recommendation","slug":"federated-meta-learning-for-recommendation","title":"Federated Meta-Learning with Fast Convergence and Efficient Communication","date":"2018-02-22","arxiv_id":"1802.07876","repositories_listed":1,"syntology":null},{"url":"/paper/autoprognosis-automated-clinical-prognostic","slug":"autoprognosis-automated-clinical-prognostic","title":"AutoPrognosis: Automated Clinical Prognostic Modeling via Bayesian Optimization with Structured Kernel Learning","date":"2018-02-20","arxiv_id":"1802.07207","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-based-meta-learning-with-learned","slug":"gradient-based-meta-learning-with-learned","title":"Gradient-Based Meta-Learning with Learned Layerwise Metric and Subspace","date":"2018-01-17","arxiv_id":"1801.05558","repositories_listed":1,"syntology":null},{"url":"/paper/a-bridge-between-hyperparameter-optimization","slug":"a-bridge-between-hyperparameter-optimization","title":"A Bridge Between Hyperparameter Optimization and Learning-to-learn","date":"2017-12-18","arxiv_id":"1712.06283","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-by-adjusting-priors-based-on","slug":"meta-learning-by-adjusting-priors-based-on","title":"Meta-Learning by Adjusting Priors Based on Extended PAC-Bayes Theory","date":"2017-11-03","arxiv_id":"1711.01244","repositories_listed":1,"syntology":null},{"url":"/paper/continuous-adaptation-via-meta-learning-in","slug":"continuous-adaptation-via-meta-learning-in","title":"Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments","date":"2017-10-10","arxiv_id":"1710.03641","repositories_listed":1,"syntology":null},{"url":"/paper/cost-adaptation-for-robust-decentralized","slug":"cost-adaptation-for-robust-decentralized","title":"Cost Adaptation for Robust Decentralized Swarm Behaviour","date":"2017-09-21","arxiv_id":"1709.07114","repositories_listed":1,"syntology":null},{"url":"/paper/online-learning-of-a-memory-for-learning","slug":"online-learning-of-a-memory-for-learning","title":"Online Learning of a Memory for Learning Rates","date":"2017-09-20","arxiv_id":"1709.06709","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/online-learning-of-a-memory-for-learning#ran","syntology_url":"https://syntology.ai/paper/1709.06709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.06709"}},"official":null}}],"record_sha256":"a1ecf117d0404a2fb8a0156c4606bfdac846424c906c4aa45271b7909be2c0c8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}