{"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/3","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":3,"pages_in_order":36,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/meta-learning/papers/4","papers":[{"url":"/paper/learning-neural-causal-models-from-unknown-1","slug":"learning-neural-causal-models-from-unknown-1","title":"Learning Neural Causal Models from Unknown Interventions","date":"2019-10-02","arxiv_id":"1910.01075","repositories_listed":2,"syntology":null},{"url":"/paper/overcoming-data-limitation-in-medical-visual","slug":"overcoming-data-limitation-in-medical-visual","title":"Overcoming Data Limitation in Medical Visual Question Answering","date":"2019-09-26","arxiv_id":"1909.11867","repositories_listed":2,"syntology":null},{"url":"/paper/data-valuation-using-reinforcement-learning","slug":"data-valuation-using-reinforcement-learning","title":"Data Valuation using Reinforcement Learning","date":"2019-09-25","arxiv_id":"1909.11671","repositories_listed":2,"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/data-valuation-using-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/1909.11671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11671"}},"official":{"repos":["google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/rapid-learning-or-feature-reuse-towards","slug":"rapid-learning-or-feature-reuse-towards","title":"Rapid Learning or Feature Reuse? Towards Understanding the Effectiveness of MAML","date":"2019-09-19","arxiv_id":"1909.09157","repositories_listed":2,"syntology":null},{"url":"/paper/stacking-models-for-nearly-optimal-link","slug":"stacking-models-for-nearly-optimal-link","title":"Stacking Models for Nearly Optimal Link Prediction in Complex Networks","date":"2019-09-17","arxiv_id":"1909.07578","repositories_listed":2,"syntology":null},{"url":"/paper/few-shot-text-classification-with","slug":"few-shot-text-classification-with","title":"Few-shot Text Classification with Distributional Signatures","date":"2019-08-16","arxiv_id":"1908.06039","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-text-classification-with#ran","syntology_url":"https://syntology.ai/paper/1908.06039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.06039"}},"official":{"repos":["YujiaBao/Distributional-Signatures"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-learning-with-global-class","slug":"few-shot-learning-with-global-class","title":"Few-Shot Learning with Global Class Representations","date":"2019-08-14","arxiv_id":"1908.05257","repositories_listed":2,"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/few-shot-learning-with-global-class#ran","syntology_url":"https://syntology.ai/paper/1908.05257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.05257"}},"official":{"repos":["tiangeluo/fsl-global"],"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/embedded-meta-learning-toward-more-flexible","slug":"embedded-meta-learning-toward-more-flexible","title":"Zero-shot task adaptation by homoiconic meta-mapping","date":"2019-05-23","arxiv_id":"1905.09950","repositories_listed":2,"syntology":null},{"url":"/paper/evaluating-recommender-systems-for-ai-driven","slug":"evaluating-recommender-systems-for-ai-driven","title":"Evaluating recommender systems for AI-driven biomedical informatics","date":"2019-05-22","arxiv_id":"1905.09205","repositories_listed":2,"syntology":null},{"url":"/paper/meta-reinforcement-learning-with-task","slug":"meta-reinforcement-learning-with-task","title":"Meta Reinforcement Learning with Task Embedding and Shared Policy","date":"2019-05-16","arxiv_id":"1905.06527","repositories_listed":2,"syntology":null},{"url":"/paper/prototype-propagation-networks-ppn-for-weakly","slug":"prototype-propagation-networks-ppn-for-weakly","title":"Prototype Propagation Networks (PPN) for Weakly-supervised Few-shot Learning on Category Graph","date":"2019-05-10","arxiv_id":"1905.04042","repositories_listed":2,"syntology":null},{"url":"/paper/faster-and-more-accurate-learning-with-meta","slug":"faster-and-more-accurate-learning-with-meta","title":"META-Learning State-based Eligibility Traces for More Sample-Efficient Policy Evaluation","date":"2019-04-25","arxiv_id":"1904.11439","repositories_listed":2,"syntology":{"n":14,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":11,"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) · 11 unverified","sample_list":"/paper/faster-and-more-accurate-learning-with-meta#ran","syntology_url":"https://syntology.ai/paper/1904.11439","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.11439"}},"official":{"repos":["PwnerHarry/META","PwnerHarry/MTA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-acquisition-functions-for","slug":"meta-learning-acquisition-functions-for","title":"Meta-Learning Acquisition Functions for Transfer Learning in Bayesian Optimization","date":"2019-04-04","arxiv_id":"1904.02642","repositories_listed":2,"syntology":null},{"url":"/paper/190408486","slug":"190408486","title":"Meta-learning Convolutional Neural Architectures for Multi-target Concrete Defect Classification with the COncrete DEfect BRidge IMage Dataset","date":"2019-04-02","arxiv_id":"1904.08486","repositories_listed":2,"syntology":null},{"url":"/paper/metapruning-meta-learning-for-automatic","slug":"metapruning-meta-learning-for-automatic","title":"MetaPruning: Meta Learning for Automatic Neural Network Channel Pruning","date":"2019-03-25","arxiv_id":"1903.10258","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/metapruning-meta-learning-for-automatic#ran","syntology_url":"https://syntology.ai/paper/1903.10258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.10258"}},"official":{"repos":["liuzechun/MetaPruning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/reproducing-meta-learning-with-differentiable","slug":"reproducing-meta-learning-with-differentiable","title":"Reproducing Meta-learning with differentiable closed-form solvers","date":"2019-03-06","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/meta-particle-flow-for-sequential-bayesian","slug":"meta-particle-flow-for-sequential-bayesian","title":"Particle Flow Bayes' Rule","date":"2019-02-02","arxiv_id":"1902.00640","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/meta-particle-flow-for-sequential-bayesian#ran","syntology_url":"https://syntology.ai/paper/1902.00640","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00640"}},"official":null}},{"url":"/paper/a-meta-transfer-objective-for-learning-to","slug":"a-meta-transfer-objective-for-learning-to","title":"A Meta-Transfer Objective for Learning to Disentangle Causal Mechanisms","date":"2019-01-30","arxiv_id":"1901.10912","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/a-meta-transfer-objective-for-learning-to#ran","syntology_url":"https://syntology.ai/paper/1901.10912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10912"}},"official":{"repos":["authors-1901-10912/A-Meta-Transfer-Objective-For-Learning-To-Disentangle-Causal-Mechanisms","ec6dde01667145e58de60f864e05a4/CausalOptimizationAnon"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-transfer-learning-for-few-shot-learning","slug":"meta-transfer-learning-for-few-shot-learning","title":"Meta-Transfer Learning for Few-Shot Learning","date":"2018-12-06","arxiv_id":"1812.02391","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-learn-how-to-learn-self-adaptive","slug":"learning-to-learn-how-to-learn-self-adaptive","title":"Learning to Learn How to Learn: Self-Adaptive Visual Navigation Using Meta-Learning","date":"2018-12-03","arxiv_id":"1812.00971","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-learn-how-to-learn-self-adaptive#ran","syntology_url":"https://syntology.ai/paper/1812.00971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.00971"}},"official":{"repos":["allenai/savn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/truncated-back-propagation-for-bilevel","slug":"truncated-back-propagation-for-bilevel","title":"Truncated Back-propagation for Bilevel Optimization","date":"2018-10-25","arxiv_id":"1810.10667","repositories_listed":2,"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/truncated-back-propagation-for-bilevel#ran","syntology_url":"https://syntology.ai/paper/1810.10667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.10667"}},"official":null}},{"url":"/paper/towards-reproducible-empirical-research-in","slug":"towards-reproducible-empirical-research-in","title":"Characterizing classification datasets: a study of meta-features for meta-learning","date":"2018-08-30","arxiv_id":"1808.10406","repositories_listed":2,"syntology":null},{"url":"/paper/skin-lesion-diagnosis-using-ensembles","slug":"skin-lesion-diagnosis-using-ensembles","title":"Skin Lesion Diagnosis using Ensembles, Unscaled Multi-Crop Evaluation and Loss Weighting","date":"2018-08-05","arxiv_id":"1808.01694","repositories_listed":2,"syntology":null},{"url":"/paper/fine-grained-visual-categorization-using-meta","slug":"fine-grained-visual-categorization-using-meta","title":"Fine-Grained Visual Categorization using Meta-Learning Optimization with Sample Selection of Auxiliary Data","date":"2018-07-28","arxiv_id":"1807.10916","repositories_listed":2,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/fine-grained-visual-categorization-using-meta#ran","syntology_url":"https://syntology.ai/paper/1807.10916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.10916"}},"official":null}},{"url":"/paper/far-ho-a-bilevel-programming-package-for","slug":"far-ho-a-bilevel-programming-package-for","title":"Far-HO: A Bilevel Programming Package for Hyperparameter Optimization and Meta-Learning","date":"2018-06-13","arxiv_id":"1806.04941","repositories_listed":2,"syntology":null},{"url":"/paper/bayesian-model-agnostic-meta-learning","slug":"bayesian-model-agnostic-meta-learning","title":"Bayesian Model-Agnostic Meta-Learning","date":"2018-06-11","arxiv_id":"1806.03836","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/bayesian-model-agnostic-meta-learning#ran","syntology_url":"https://syntology.ai/paper/1806.03836","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.03836"}},"official":null}},{"url":"/paper/learning-to-propagate-labels-transductive","slug":"learning-to-propagate-labels-transductive","title":"Learning to Propagate Labels: Transductive Propagation Network for Few-shot Learning","date":"2018-05-25","arxiv_id":"1805.10002","repositories_listed":2,"syntology":null},{"url":"/paper/diverse-few-shot-text-classification-with","slug":"diverse-few-shot-text-classification-with","title":"Diverse Few-Shot Text Classification with Multiple Metrics","date":"2018-05-19","arxiv_id":"1805.07513","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diverse-few-shot-text-classification-with#ran","syntology_url":"https://syntology.ai/paper/1805.07513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07513"}},"official":{"repos":["Gorov/DiverseFewShot_Amazon"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/meta-learning-update-rules-for-unsupervised","slug":"meta-learning-update-rules-for-unsupervised","title":"Meta-Learning Update Rules for Unsupervised Representation Learning","date":"2018-03-31","arxiv_id":"1804.00222","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-adapt-in-dynamic-real-world","slug":"learning-to-adapt-in-dynamic-real-world","title":"Learning to Adapt in Dynamic, Real-World Environments Through Meta-Reinforcement Learning","date":"2018-03-30","arxiv_id":"1803.11347","repositories_listed":2,"syntology":null},{"url":"/paper/scalable-meta-learning-for-bayesian","slug":"scalable-meta-learning-for-bayesian","title":"Practical Transfer Learning for Bayesian Optimization","date":"2018-02-06","arxiv_id":"1802.02219","repositories_listed":2,"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":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) · 0 unverified","sample_list":"/paper/scalable-meta-learning-for-bayesian#ran","syntology_url":"https://syntology.ai/paper/1802.02219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.02219"}},"official":{"repos":["automl/transfer-hpo-framework"],"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/one-shot-imitation-from-observing-humans-via","slug":"one-shot-imitation-from-observing-humans-via","title":"One-Shot Imitation from Observing Humans via Domain-Adaptive Meta-Learning","date":"2018-02-05","arxiv_id":"1802.01557","repositories_listed":2,"syntology":null},{"url":"/paper/fast-meta-learning-for-adaptive-hierarchical","slug":"fast-meta-learning-for-adaptive-hierarchical","title":"Fast Meta-Learning for Adaptive Hierarchical Classifier Design","date":"2017-11-09","arxiv_id":"1711.03512","repositories_listed":2,"syntology":null},{"url":"/paper/hyperparameter-importance-across-datasets","slug":"hyperparameter-importance-across-datasets","title":"Hyperparameter Importance Across Datasets","date":"2017-10-12","arxiv_id":"1710.04725","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/hyperparameter-importance-across-datasets#ran","syntology_url":"https://syntology.ai/paper/1710.04725","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.04725"}},"official":null}},{"url":"/paper/a-greedy-approach-to-adapting-the-trace","slug":"a-greedy-approach-to-adapting-the-trace","title":"A Greedy Approach to Adapting the Trace Parameter for Temporal Difference Learning","date":"2016-07-02","arxiv_id":"1607.00446","repositories_listed":2,"syntology":null},{"url":"/paper/online-portfolio-selection-a-survey","slug":"online-portfolio-selection-a-survey","title":"Online Portfolio Selection: A Survey","date":"2012-12-10","arxiv_id":"1212.2129","repositories_listed":2,"syntology":null},{"url":"/paper/geo-orbit-a-federated-digital-twin-framework","slug":"geo-orbit-a-federated-digital-twin-framework","title":"Geo-ORBIT: A Federated Digital Twin Framework for Scene-Adaptive Lane Geometry Detection","date":"2025-07-11","arxiv_id":"2507.08743","repositories_listed":1,"syntology":null},{"url":"/paper/dip-unsupervised-dense-in-context-post","slug":"dip-unsupervised-dense-in-context-post","title":"DIP: Unsupervised Dense In-Context Post-training of Visual Representations","date":"2025-06-23","arxiv_id":"2506.18463","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/dip-unsupervised-dense-in-context-post#ran","syntology_url":"https://syntology.ai/paper/2506.18463","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.18463"}},"official":{"repos":["sirkosophia/dip"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/episode-specific-fine-tuning-for-metric-based","slug":"episode-specific-fine-tuning-for-metric-based","title":"Episode-specific Fine-tuning for Metric-based Few-shot Learners with Optimization-based Training","date":"2025-06-20","arxiv_id":"2506.17499","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-how-to-share-credit-among-macro","slug":"meta-learning-how-to-share-credit-among-macro","title":"Meta-learning how to Share Credit among Macro-Actions","date":"2025-06-16","arxiv_id":"2506.13690","repositories_listed":1,"syntology":null},{"url":"/paper/latent-representation-learning-of-multi-scale","slug":"latent-representation-learning-of-multi-scale","title":"Latent Representation Learning of Multi-scale Thermophysics: Application to Dynamics in Shocked Porous Energetic Material","date":"2025-06-15","arxiv_id":"2506.12996","repositories_listed":1,"syntology":null},{"url":"/paper/robust-llm-unlearning-with-mudman-meta","slug":"robust-llm-unlearning-with-mudman-meta","title":"Robust LLM Unlearning with MUDMAN: Meta-Unlearning with Disruption Masking And Normalization","date":"2025-06-14","arxiv_id":"2506.12484","repositories_listed":1,"syntology":null},{"url":"/paper/robust-molecular-property-prediction-via","slug":"robust-molecular-property-prediction-via","title":"Robust Molecular Property Prediction via Densifying Scarce Labeled Data","date":"2025-06-13","arxiv_id":"2506.11877","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-sockpuppetry-on-wikipedia-using","slug":"detecting-sockpuppetry-on-wikipedia-using","title":"Detecting Sockpuppetry on Wikipedia Using Meta-Learning","date":"2025-06-12","arxiv_id":"2506.10314","repositories_listed":1,"syntology":null},{"url":"/paper/improving-memory-efficiency-for-training-kans","slug":"improving-memory-efficiency-for-training-kans","title":"Improving Memory Efficiency for Training KANs via Meta Learning","date":"2025-06-09","arxiv_id":"2506.07549","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":9,"phrase":"3 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; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/improving-memory-efficiency-for-training-kans#ran","syntology_url":"https://syntology.ai/paper/2506.07549","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.07549"}},"official":{"repos":["murphyzc/metakan"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/a-brain-graph-foundation-model-pre-training","slug":"a-brain-graph-foundation-model-pre-training","title":"A Brain Graph Foundation Model: Pre-Training and Prompt-Tuning for Any Atlas and Disorder","date":"2025-05-31","arxiv_id":"2506.02044","repositories_listed":1,"syntology":null},{"url":"/paper/darwin-godel-machine-open-ended-evolution-of","slug":"darwin-godel-machine-open-ended-evolution-of","title":"Darwin Godel Machine: Open-Ended Evolution of Self-Improving Agents","date":"2025-05-29","arxiv_id":"2505.22954","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/darwin-godel-machine-open-ended-evolution-of#ran","syntology_url":"https://syntology.ai/paper/2505.22954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.22954"}},"official":{"repos":["jennyzzt/dgm"],"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/cellclat-preserving-topology-and-trimming","slug":"cellclat-preserving-topology-and-trimming","title":"CellCLAT: Preserving Topology and Trimming Redundancy in Self-Supervised Cellular Contrastive Learning","date":"2025-05-27","arxiv_id":"2505.21587","repositories_listed":1,"syntology":null},{"url":"/paper/deciphering-trajectory-aided-llm-reasoning-an","slug":"deciphering-trajectory-aided-llm-reasoning-an","title":"Deciphering Trajectory-Aided LLM Reasoning: An Optimization Perspective","date":"2025-05-26","arxiv_id":"2505.19815","repositories_listed":1,"syntology":null},{"url":"/paper/finetuning-activated-backdoors-in-llms","slug":"finetuning-activated-backdoors-in-llms","title":"Finetuning-Activated Backdoors in LLMs","date":"2025-05-22","arxiv_id":"2505.16567","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-prompt-tuning-and-in-context","slug":"understanding-prompt-tuning-and-in-context","title":"Understanding Prompt Tuning and In-Context Learning via Meta-Learning","date":"2025-05-22","arxiv_id":"2505.17010","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/understanding-prompt-tuning-and-in-context#ran","syntology_url":"https://syntology.ai/paper/2505.17010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.17010"}},"official":{"repos":["google-deepmind/thunnini"],"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/a-mind-for-reasoning-meta-learning-for-in","slug":"a-mind-for-reasoning-meta-learning-for-in","title":"A MIND for Reasoning: Meta-learning for In-context Deduction","date":"2025-05-20","arxiv_id":"2505.14313","repositories_listed":1,"syntology":null},{"url":"/paper/metauas-universal-anomaly-segmentation-with","slug":"metauas-universal-anomaly-segmentation-with","title":"MetaUAS: Universal Anomaly Segmentation with One-Prompt Meta-Learning","date":"2025-05-14","arxiv_id":"2505.09265","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/metauas-universal-anomaly-segmentation-with#ran","syntology_url":"https://syntology.ai/paper/2505.09265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.09265"}},"official":null}},{"url":"/paper/system-prompt-optimization-with-meta-learning","slug":"system-prompt-optimization-with-meta-learning","title":"System Prompt Optimization with Meta-Learning","date":"2025-05-14","arxiv_id":"2505.09666","repositories_listed":1,"syntology":null},{"url":"/paper/towards-adaptive-meta-gradient-adversarial","slug":"towards-adaptive-meta-gradient-adversarial","title":"Towards Adaptive Meta-Gradient Adversarial Examples for Visual Tracking","date":"2025-05-13","arxiv_id":"2505.08999","repositories_listed":1,"syntology":null},{"url":"/paper/component-based-fairness-in-face-attribute","slug":"component-based-fairness-in-face-attribute","title":"Component-Based Fairness in Face Attribute Classification with Bayesian Network-informed Meta Learning","date":"2025-05-03","arxiv_id":"2505.01699","repositories_listed":1,"syntology":null},{"url":"/paper/mise-meta-knowledge-inheritance-for-social","slug":"mise-meta-knowledge-inheritance-for-social","title":"MISE: Meta-knowledge Inheritance for Social Media-Based Stressor Estimation","date":"2025-05-03","arxiv_id":"2505.03827","repositories_listed":1,"syntology":null},{"url":"/paper/learning-low-dimensional-embeddings-for-black","slug":"learning-low-dimensional-embeddings-for-black","title":"Learning Low-Dimensional Embeddings for Black-Box Optimization","date":"2025-05-02","arxiv_id":"2505.01112","repositories_listed":1,"syntology":null},{"url":"/paper/toward-evaluative-thinking-meta-policy","slug":"toward-evaluative-thinking-meta-policy","title":"Toward Evaluative Thinking: Meta Policy Optimization with Evolving Reward Models","date":"2025-04-28","arxiv_id":"2504.20157","repositories_listed":1,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":15,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/toward-evaluative-thinking-meta-policy#ran","syntology_url":"https://syntology.ai/paper/2504.20157","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.20157"}},"official":{"repos":["minnesotanlp/mpo"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/camel-cross-modality-adaptive-meta-learning","slug":"camel-cross-modality-adaptive-meta-learning","title":"CAMeL: Cross-modality Adaptive Meta-Learning for Text-based Person Retrieval","date":"2025-04-26","arxiv_id":"2504.18782","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-and-knowledge-discovery-based","slug":"meta-learning-and-knowledge-discovery-based","title":"Meta-Learning and Knowledge Discovery based Physics-Informed Neural Network for Remaining Useful Life Prediction","date":"2025-04-18","arxiv_id":"2504.13797","repositories_listed":1,"syntology":null},{"url":"/paper/manifold-meta-learning-for-reduced-complexity","slug":"manifold-meta-learning-for-reduced-complexity","title":"Manifold meta-learning for reduced-complexity neural system identification","date":"2025-04-16","arxiv_id":"2504.11811","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-meta-learning-based-poisoning","slug":"exploiting-meta-learning-based-poisoning","title":"Exploiting Meta-Learning-based Poisoning Attacks for Graph Link Prediction","date":"2025-04-08","arxiv_id":"2504.06492","repositories_listed":1,"syntology":null},{"url":"/paper/towards-an-efficient-and-effective-en-route","slug":"towards-an-efficient-and-effective-en-route","title":"Towards An Efficient and Effective En Route Travel Time Estimation Framework","date":"2025-04-05","arxiv_id":"2504.04086","repositories_listed":1,"syntology":null},{"url":"/paper/a-physics-informed-meta-learning-framework","slug":"a-physics-informed-meta-learning-framework","title":"A Physics-Informed Meta-Learning Framework for the Continuous Solution of Parametric PDEs on Arbitrary Geometries","date":"2025-04-03","arxiv_id":"2504.02459","repositories_listed":1,"syntology":null},{"url":"/paper/enabling-systematic-generalization-in","slug":"enabling-systematic-generalization-in","title":"Enabling Systematic Generalization in Abstract Spatial Reasoning through Meta-Learning for Compositionality","date":"2025-04-02","arxiv_id":"2504.01445","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-gaussian-neural-processes","slug":"sparse-gaussian-neural-processes","title":"Sparse Gaussian Neural Processes","date":"2025-04-02","arxiv_id":"2504.01650","repositories_listed":1,"syntology":null},{"url":"/paper/hyperman-hypergraph-enhanced-meta-learning","slug":"hyperman-hypergraph-enhanced-meta-learning","title":"HyperMAN: Hypergraph-enhanced Meta-learning Adaptive Network for Next POI Recommendation","date":"2025-03-27","arxiv_id":"2503.22049","repositories_listed":1,"syntology":null},{"url":"/paper/reward-design-for-reinforcement-learning","slug":"reward-design-for-reinforcement-learning","title":"Reward Design for Reinforcement Learning Agents","date":"2025-03-27","arxiv_id":"2503.21949","repositories_listed":1,"syntology":null},{"url":"/paper/platmetax-an-integrated-matlab-platform-for","slug":"platmetax-an-integrated-matlab-platform-for","title":"PlatMetaX: An Integrated MATLAB platform for Meta-Black-Box Optimization","date":"2025-03-26","arxiv_id":"2503.22722","repositories_listed":1,"syntology":null},{"url":"/paper/balanced-direction-from-multifarious-choices","slug":"balanced-direction-from-multifarious-choices","title":"Balanced Direction from Multifarious Choices: Arithmetic Meta-Learning for Domain Generalization","date":"2025-03-23","arxiv_id":"2503.18987","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-based-self-adaptive","slug":"reinforcement-learning-based-self-adaptive","title":"Reinforcement Learning-based Self-adaptive Differential Evolution through Automated Landscape Feature Learning","date":"2025-03-23","arxiv_id":"2503.18061","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reinforcement-learning-based-self-adaptive#ran","syntology_url":"https://syntology.ai/paper/2503.18061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.18061"}},"official":{"repos":["gmc-drl/rlde-afl"],"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/dress-disentangled-representation-based-self","slug":"dress-disentangled-representation-based-self","title":"DRESS: Disentangled Representation-based Self-Supervised Meta-Learning for Diverse Tasks","date":"2025-03-12","arxiv_id":"2503.09679","repositories_listed":1,"syntology":{"n":11,"n_ran":5,"n_constructed":3,"n_ran_checked":3,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/dress-disentangled-representation-based-self#ran","syntology_url":"https://syntology.ai/paper/2503.09679","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09679"}},"official":{"repos":["layer6ai-labs/DRESS"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/a-comprehensive-survey-of-mixture-of-experts","slug":"a-comprehensive-survey-of-mixture-of-experts","title":"A Comprehensive Survey of Mixture-of-Experts: Algorithms, Theory, and Applications","date":"2025-03-10","arxiv_id":"2503.07137","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-comprehensive-survey-of-mixture-of-experts#ran","syntology_url":"https://syntology.ai/paper/2503.07137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.07137"}},"official":{"repos":["deepseek-ai/DeepEP"],"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/pied-physics-informed-experimental-design-for","slug":"pied-physics-informed-experimental-design-for","title":"PIED: Physics-Informed Experimental Design for Inverse Problems","date":"2025-03-10","arxiv_id":"2503.07070","repositories_listed":1,"syntology":null},{"url":"/paper/blackgoose-rimer-harnessing-rwkv-7-as-a","slug":"blackgoose-rimer-harnessing-rwkv-7-as-a","title":"BlackGoose Rimer: Harnessing RWKV-7 as a Simple yet Superior Replacement for Transformers in Large-Scale Time Series Modeling","date":"2025-03-08","arxiv_id":"2503.06121","repositories_listed":1,"syntology":null},{"url":"/paper/augfl-augmenting-federated-learning-with","slug":"augfl-augmenting-federated-learning-with","title":"AugFL: Augmenting Federated Learning with Pretrained Models","date":"2025-03-04","arxiv_id":"2503.02154","repositories_listed":1,"syntology":null},{"url":"/paper/pabbo-preferential-amortized-black-box","slug":"pabbo-preferential-amortized-black-box","title":"PABBO: Preferential Amortized Black-Box Optimization","date":"2025-03-02","arxiv_id":"2503.00924","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/pabbo-preferential-amortized-black-box#ran","syntology_url":"https://syntology.ai/paper/2503.00924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.00924"}},"official":{"repos":["xinyuzc/PABBO"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/automl-for-multi-class-anomaly-compensation","slug":"automl-for-multi-class-anomaly-compensation","title":"AutoML for Multi-Class Anomaly Compensation of Sensor Drift","date":"2025-02-26","arxiv_id":"2502.19180","repositories_listed":1,"syntology":null},{"url":"/paper/fspo-few-shot-preference-optimization-of","slug":"fspo-few-shot-preference-optimization-of","title":"FSPO: Few-Shot Preference Optimization of Synthetic Preference Data in LLMs Elicits Effective Personalization to Real Users","date":"2025-02-26","arxiv_id":"2502.19312","repositories_listed":1,"syntology":null},{"url":"/paper/cross-domain-few-shot-object-detection-with","slug":"cross-domain-few-shot-object-detection-with","title":"Cross-domain Few-shot Object Detection with Multi-modal Textual Enrichment","date":"2025-02-23","arxiv_id":"2502.16469","repositories_listed":1,"syntology":null},{"url":"/paper/medfuncta-modality-agnostic-representations","slug":"medfuncta-modality-agnostic-representations","title":"MedFuncta: Modality-Agnostic Representations Based on Efficient Neural Fields","date":"2025-02-20","arxiv_id":"2502.14401","repositories_listed":1,"syntology":null},{"url":"/paper/ai-driven-discovery-of-high-performance","slug":"ai-driven-discovery-of-high-performance","title":"AI-Driven Discovery of High Performance Polymer Electrodes for Next-Generation Batteries","date":"2025-02-19","arxiv_id":"2502.13899","repositories_listed":1,"syntology":null},{"url":"/paper/dual-level-mixup-for-graph-few-shot-learning","slug":"dual-level-mixup-for-graph-few-shot-learning","title":"Dual-level Mixup for Graph Few-shot Learning with Fewer Tasks","date":"2025-02-19","arxiv_id":"2502.14158","repositories_listed":1,"syntology":null},{"url":"/paper/unimatch-universal-matching-from-atom-to-task","slug":"unimatch-universal-matching-from-atom-to-task","title":"UniMatch: Universal Matching from Atom to Task for Few-Shot Drug Discovery","date":"2025-02-18","arxiv_id":"2502.12453","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unimatch-universal-matching-from-atom-to-task#ran","syntology_url":"https://syntology.ai/paper/2502.12453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.12453"}},"official":{"repos":["Lirain21/UniMatch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-inr-efficient-encoding-of-volumetric","slug":"meta-inr-efficient-encoding-of-volumetric","title":"Meta-INR: Efficient Encoding of Volumetric Data via Meta-Learning Implicit Neural Representation","date":"2025-02-12","arxiv_id":"2502.09669","repositories_listed":1,"syntology":null},{"url":"/paper/td3-tucker-decomposition-based-dataset","slug":"td3-tucker-decomposition-based-dataset","title":"TD3: Tucker Decomposition Based Dataset Distillation Method for Sequential Recommendation","date":"2025-02-05","arxiv_id":"2502.02854","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-few-shot-defect-segmentation-in","slug":"exploring-few-shot-defect-segmentation-in","title":"Exploring Few-Shot Defect Segmentation in General Industrial Scenarios with Metric Learning and Vision Foundation Models","date":"2025-02-03","arxiv_id":"2502.01216","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-induced-transferable-binding","slug":"leveraging-induced-transferable-binding","title":"Inductive-Associative Meta-learning Pipeline with Human Cognitive Patterns for Unseen Drug-Target Interaction Prediction","date":"2025-01-26","arxiv_id":"2501.16391","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-multimodal-fusion-via-meta-learning","slug":"dynamic-multimodal-fusion-via-meta-learning","title":"Dynamic Multimodal Fusion via Meta-Learning Towards Micro-Video Recommendation","date":"2025-01-13","arxiv_id":"2501.07110","repositories_listed":1,"syntology":null},{"url":"/paper/learning-flexible-heterogeneous-coordination","slug":"learning-flexible-heterogeneous-coordination","title":"Capability-Aware Shared Hypernetworks for Flexible Heterogeneous Multi-Robot Coordination","date":"2025-01-10","arxiv_id":"2501.06058","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-flexible-heterogeneous-coordination#ran","syntology_url":"https://syntology.ai/paper/2501.06058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.06058"}},"official":{"repos":["kfu02/jaxmarl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/q-maml-quantum-model-agnostic-meta-learning","slug":"q-maml-quantum-model-agnostic-meta-learning","title":"Q-MAML: Quantum Model-Agnostic Meta-Learning for Variational Quantum Algorithms","date":"2025-01-10","arxiv_id":"2501.05906","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/q-maml-quantum-model-agnostic-meta-learning#ran","syntology_url":"https://syntology.ai/paper/2501.05906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.05906"}},"official":{"repos":["JayC1208/Q-MAML"],"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/social-processes-probabilistic-meta-learning","slug":"social-processes-probabilistic-meta-learning","title":"Social Processes: Probabilistic Meta-learning for Adaptive Multiparty Interaction Forecasting","date":"2025-01-03","arxiv_id":"2501.01915","repositories_listed":1,"syntology":null},{"url":"/paper/lora-recycle-unlocking-tuning-free-few-shot","slug":"lora-recycle-unlocking-tuning-free-few-shot","title":"LoRA Recycle: Unlocking Tuning-Free Few-Shot Adaptability in Visual Foundation Models by Recycling Pre-Tuned LoRAs","date":"2025-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-nearly-optimal-single-loop-algorithm-for","slug":"a-nearly-optimal-single-loop-algorithm-for","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","date":"2024-12-28","arxiv_id":"2412.20017","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/a-nearly-optimal-single-loop-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/2412.20017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.20017"}},"official":{"repos":["MingruiLiu-ML-Lab/Single-Loop-bilevel-Optimizer-under-Unbounded-Smoothness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/imitation-learning-from-suboptimal","slug":"imitation-learning-from-suboptimal","title":"Imitation Learning from Suboptimal Demonstrations via Meta-Learning An Action Ranker","date":"2024-12-28","arxiv_id":"2412.20193","repositories_listed":1,"syntology":null},{"url":"/paper/eeg-reptile-an-automatized-reptile-based-meta","slug":"eeg-reptile-an-automatized-reptile-based-meta","title":"EEG-Reptile: An Automatized Reptile-Based Meta-Learning Library for BCIs","date":"2024-12-27","arxiv_id":"2412.19725","repositories_listed":1,"syntology":null},{"url":"/paper/personalized-dynamic-music-emotion","slug":"personalized-dynamic-music-emotion","title":"Personalized Dynamic Music Emotion Recognition with Dual-Scale Attention-Based Meta-Learning","date":"2024-12-26","arxiv_id":"2412.19200","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-label-noise-using-prompt-based","slug":"mitigating-label-noise-using-prompt-based","title":"Mitigating Label Noise using Prompt-Based Hyperbolic Meta-Learning in Open-Set Domain Generalization","date":"2024-12-24","arxiv_id":"2412.18342","repositories_listed":1,"syntology":null},{"url":"/paper/a-meta-learning-approach-to-bayesian-causal","slug":"a-meta-learning-approach-to-bayesian-causal","title":"A Meta-Learning Approach to Bayesian Causal Discovery","date":"2024-12-21","arxiv_id":"2412.16577","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-meta-learning-approach-to-bayesian-causal#ran","syntology_url":"https://syntology.ai/paper/2412.16577","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.16577"}},"official":null}}],"record_sha256":"ede6ee6ab83ce0ecc3cb4936c44849b0093285e5b8764cff32eca2268c0a2335","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}