{"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/4","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":4,"pages_in_order":36,"rows_per_page":100,"rows":[301,400],"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/3","next":"/task/meta-learning/papers/5","papers":[{"url":"/paper/consistency-of-compositional-generalization","slug":"consistency-of-compositional-generalization","title":"Consistency of Compositional Generalization across Multiple Levels","date":"2024-12-18","arxiv_id":"2412.13636","repositories_listed":1,"syntology":null},{"url":"/paper/spatio-temporal-fuzzy-oriented-multi-modal","slug":"spatio-temporal-fuzzy-oriented-multi-modal","title":"Spatio-Temporal Fuzzy-oriented Multi-Modal Meta-Learning for Fine-grained Emotion Recognition","date":"2024-12-18","arxiv_id":"2412.13541","repositories_listed":1,"syntology":null},{"url":"/paper/tseml-a-task-specific-embedding-based-method","slug":"tseml-a-task-specific-embedding-based-method","title":"TSEML: A task-specific embedding-based method for few-shot classification of cancer molecular subtypes","date":"2024-12-17","arxiv_id":"2412.13228","repositories_listed":1,"syntology":null},{"url":"/paper/generalizable-representation-learning-for-1","slug":"generalizable-representation-learning-for-1","title":"Generalizable Representation Learning for fMRI-based Neurological Disorder Identification","date":"2024-12-16","arxiv_id":"2412.16197","repositories_listed":1,"syntology":null},{"url":"/paper/famnet-frequency-aware-matching-network-for","slug":"famnet-frequency-aware-matching-network-for","title":"FAMNet: Frequency-aware Matching Network for Cross-domain Few-shot Medical Image Segmentation","date":"2024-12-12","arxiv_id":"2412.09319","repositories_listed":1,"syntology":null},{"url":"/paper/neural-networks-for-threshold-dynamics","slug":"neural-networks-for-threshold-dynamics","title":"Neural Networks for Threshold Dynamics Reconstruction","date":"2024-12-12","arxiv_id":"2412.09079","repositories_listed":1,"syntology":null},{"url":"/paper/configx-modular-configuration-for","slug":"configx-modular-configuration-for","title":"ConfigX: Modular Configuration for Evolutionary Algorithms via Multitask Reinforcement Learning","date":"2024-12-10","arxiv_id":"2412.07507","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-to-learn-quantum","slug":"reinforcement-learning-to-learn-quantum","title":"Reinforcement learning to learn quantum states for Heisenberg scaling accuracy","date":"2024-12-03","arxiv_id":"2412.02334","repositories_listed":1,"syntology":null},{"url":"/paper/unlocking-tuning-free-few-shot-adaptability","slug":"unlocking-tuning-free-few-shot-adaptability","title":"Unlocking Tuning-Free Few-Shot Adaptability in Visual Foundation Models by Recycling Pre-Tuned LoRAs","date":"2024-12-03","arxiv_id":"2412.02220","repositories_listed":1,"syntology":null},{"url":"/paper/towards-cross-lingual-audio-abuse-detection","slug":"towards-cross-lingual-audio-abuse-detection","title":"Towards Cross-Lingual Audio Abuse Detection in Low-Resource Settings with Few-Shot Learning","date":"2024-12-02","arxiv_id":"2412.01408","repositories_listed":1,"syntology":null},{"url":"/paper/online-item-cold-start-recommendation-with","slug":"online-item-cold-start-recommendation-with","title":"Online Item Cold-Start Recommendation with Popularity-Aware Meta-Learning","date":"2024-11-18","arxiv_id":"2411.11225","repositories_listed":1,"syntology":null},{"url":"/paper/amago-2-breaking-the-multi-task-barrier-in","slug":"amago-2-breaking-the-multi-task-barrier-in","title":"AMAGO-2: Breaking the Multi-Task Barrier in Meta-Reinforcement Learning with Transformers","date":"2024-11-17","arxiv_id":"2411.11188","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/amago-2-breaking-the-multi-task-barrier-in#ran","syntology_url":"https://syntology.ai/paper/2411.11188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.11188"}},"official":{"repos":["ut-austin-rpl/amago"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-meta-learning-for-robust-deepfake","slug":"adaptive-meta-learning-for-robust-deepfake","title":"Adaptive Meta-Learning for Robust Deepfake Detection: A Multi-Agent Framework to Data Drift and Model Generalization","date":"2024-11-12","arxiv_id":"2411.08148","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-memory-module-for-graph-few-shot","slug":"an-efficient-memory-module-for-graph-few-shot","title":"An Efficient Memory Module for Graph Few-Shot Class-Incremental Learning","date":"2024-11-11","arxiv_id":"2411.06659","repositories_listed":1,"syntology":null},{"url":"/paper/neuromodulated-meta-learning","slug":"neuromodulated-meta-learning","title":"Neuromodulated Meta-Learning","date":"2024-11-11","arxiv_id":"2411.06746","repositories_listed":1,"syntology":null},{"url":"/paper/t2-only-prostate-cancer-prediction-by-meta","slug":"t2-only-prostate-cancer-prediction-by-meta","title":"T2-Only Prostate Cancer Prediction by Meta-Learning from Bi-Parametric MR Imaging","date":"2024-11-11","arxiv_id":"2411.07416","repositories_listed":1,"syntology":null},{"url":"/paper/noisy-zero-shot-coordination-breaking-the","slug":"noisy-zero-shot-coordination-breaking-the","title":"Noisy Zero-Shot Coordination: Breaking The Common Knowledge Assumption In Zero-Shot Coordination Games","date":"2024-11-07","arxiv_id":"2411.04976","repositories_listed":1,"syntology":null},{"url":"/paper/learning-where-to-edit-vision-transformers","slug":"learning-where-to-edit-vision-transformers","title":"Learning Where to Edit Vision Transformers","date":"2024-11-04","arxiv_id":"2411.01948","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-where-to-edit-vision-transformers#ran","syntology_url":"https://syntology.ai/paper/2411.01948","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.01948"}},"official":{"repos":["hustyyq/where-to-edit"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/specrage-robust-and-generalizable-multi-view","slug":"specrage-robust-and-generalizable-multi-view","title":"Generalizable and Robust Spectral Method for Multi-view Representation Learning","date":"2024-11-04","arxiv_id":"2411.02138","repositories_listed":1,"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":5,"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/specrage-robust-and-generalizable-multi-view#ran","syntology_url":"https://syntology.ai/paper/2411.02138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02138"}},"official":{"repos":["shaham-lab/specrage"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/investigating-large-language-models-for-1","slug":"investigating-large-language-models-for-1","title":"Investigating Large Language Models for Complex Word Identification in Multilingual and Multidomain Setups","date":"2024-11-03","arxiv_id":"2411.01706","repositories_listed":1,"syntology":null},{"url":"/paper/task-aware-harmony-multi-task-decision","slug":"task-aware-harmony-multi-task-decision","title":"Task-Aware Harmony Multi-Task Decision Transformer for Offline Reinforcement Learning","date":"2024-11-02","arxiv_id":"2411.01146","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/task-aware-harmony-multi-task-decision#ran","syntology_url":"https://syntology.ai/paper/2411.01146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.01146"}},"official":{"repos":["charleshsc/HarmoDT"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/theoretical-investigations-and-practical","slug":"theoretical-investigations-and-practical","title":"Theoretical Investigations and Practical Enhancements on Tail Task Risk Minimization in Meta Learning","date":"2024-10-30","arxiv_id":"2410.22788","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/theoretical-investigations-and-practical#ran","syntology_url":"https://syntology.ai/paper/2410.22788","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22788"}},"official":{"repos":["lvyiqin/DRMAML"],"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/amortized-probabilistic-conditioning-for","slug":"amortized-probabilistic-conditioning-for","title":"Amortized Probabilistic Conditioning for Optimization, Simulation and Inference","date":"2024-10-20","arxiv_id":"2410.15320","repositories_listed":1,"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/amortized-probabilistic-conditioning-for#ran","syntology_url":"https://syntology.ai/paper/2410.15320","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.15320"}},"official":null}},{"url":"/paper/mitigating-the-backdoor-effect-for-multi-task","slug":"mitigating-the-backdoor-effect-for-multi-task","title":"Mitigating the Backdoor Effect for Multi-Task Model Merging via Safety-Aware Subspace","date":"2024-10-17","arxiv_id":"2410.13910","repositories_listed":1,"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":5,"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/mitigating-the-backdoor-effect-for-multi-task#ran","syntology_url":"https://syntology.ai/paper/2410.13910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13910"}},"official":{"repos":["yangjinluan/dam"],"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/improve-meta-learning-for-few-shot-text","slug":"improve-meta-learning-for-few-shot-text","title":"Improve Meta-learning for Few-Shot Text Classification with All You Can Acquire from the Tasks","date":"2024-10-14","arxiv_id":"2410.10454","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-adapter-tuning-for-few-shot","slug":"context-aware-adapter-tuning-for-few-shot","title":"Context-Aware Adapter Tuning for Few-Shot Relation Learning in Knowledge Graphs","date":"2024-10-11","arxiv_id":"2410.09123","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/context-aware-adapter-tuning-for-few-shot#ran","syntology_url":"https://syntology.ai/paper/2410.09123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09123"}},"official":{"repos":["liuran998/RelAdapter"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/pyhgf-a-neural-network-library-for-predictive","slug":"pyhgf-a-neural-network-library-for-predictive","title":"pyhgf: A neural network library for predictive coding","date":"2024-10-11","arxiv_id":"2410.09206","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-integration-in-hierarchical","slug":"meta-learning-integration-in-hierarchical","title":"Meta-Learning Integration in Hierarchical Reinforcement Learning for Advanced Task Complexity","date":"2024-10-10","arxiv_id":"2410.07921","repositories_listed":1,"syntology":null},{"url":"/paper/metalic-meta-learning-in-context-with-protein","slug":"metalic-meta-learning-in-context-with-protein","title":"Metalic: Meta-Learning In-Context with Protein Language Models","date":"2024-10-10","arxiv_id":"2410.08355","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/metalic-meta-learning-in-context-with-protein#ran","syntology_url":"https://syntology.ai/paper/2410.08355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.08355"}},"official":{"repos":["instadeepai/metalic"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-arabic-multi-label-emotion","slug":"improving-arabic-multi-label-emotion","title":"Improving Arabic Multi-Label Emotion Classification using Stacked Embeddings and Hybrid Loss Function","date":"2024-10-04","arxiv_id":"2410.03979","repositories_listed":1,"syntology":null},{"url":"/paper/should-cross-lingual-amr-parsing-go-meta-an","slug":"should-cross-lingual-amr-parsing-go-meta-an","title":"Should Cross-Lingual AMR Parsing go Meta? An Empirical Assessment of Meta-Learning and Joint Learning AMR Parsing","date":"2024-10-04","arxiv_id":"2410.03357","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-meta-learning-via-dynamic-head","slug":"unsupervised-meta-learning-via-dynamic-head","title":"Unsupervised Meta-Learning via Dynamic Head and Heterogeneous Task Construction for Few-Shot Classification","date":"2024-10-03","arxiv_id":"2410.02267","repositories_listed":1,"syntology":null},{"url":"/paper/extending-contextual-self-modulation-meta","slug":"extending-contextual-self-modulation-meta","title":"Reevaluating Meta-Learning Optimization Algorithms Through Contextual Self-Modulation","date":"2024-10-02","arxiv_id":"2410.01655","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/extending-contextual-self-modulation-meta#ran","syntology_url":"https://syntology.ai/paper/2410.01655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01655"}},"official":{"repos":["ddrous/self-mod"],"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/learning-to-learn-ecosystems-from-limited","slug":"learning-to-learn-ecosystems-from-limited","title":"Learning to learn ecosystems from limited data -- a meta-learning approach","date":"2024-10-02","arxiv_id":"2410.07368","repositories_listed":1,"syntology":null},{"url":"/paper/personalllm-tailoring-llms-to-individual","slug":"personalllm-tailoring-llms-to-individual","title":"PersonalLLM: Tailoring LLMs to Individual Preferences","date":"2024-09-30","arxiv_id":"2409.20296","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/personalllm-tailoring-llms-to-individual#ran","syntology_url":"https://syntology.ai/paper/2409.20296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.20296"}},"official":{"repos":["namkoong-lab/PersonalLLM"],"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/advancing-open-set-domain-generalization","slug":"advancing-open-set-domain-generalization","title":"Advancing Open-Set Domain Generalization Using Evidential Bi-Level Hardest Domain Scheduler","date":"2024-09-26","arxiv_id":"2409.17555","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"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) · 4 unverified","sample_list":"/paper/advancing-open-set-domain-generalization#ran","syntology_url":"https://syntology.ai/paper/2409.17555","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17555"}},"official":{"repos":["kpeng9510/ebil-hads"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/refine-boosting-time-series-prediction-of","slug":"refine-boosting-time-series-prediction-of","title":"ReFine: Boosting Time Series Prediction of Extreme Events by Reweighting and Fine-tuning","date":"2024-09-21","arxiv_id":"2409.14232","repositories_listed":1,"syntology":null},{"url":"/paper/aalf-almost-always-linear-forecasting","slug":"aalf-almost-always-linear-forecasting","title":"AALF: Almost Always Linear Forecasting","date":"2024-09-16","arxiv_id":"2409.10142","repositories_listed":1,"syntology":null},{"url":"/paper/e-quartic-energy-efficient-edge-ensemble-of","slug":"e-quartic-energy-efficient-edge-ensemble-of","title":"E-QUARTIC: Energy Efficient Edge Ensemble of Convolutional Neural Networks for Resource-Optimized Learning","date":"2024-09-12","arxiv_id":"2409.08369","repositories_listed":1,"syntology":null},{"url":"/paper/learning-vs-retrieval-the-role-of-in-context","slug":"learning-vs-retrieval-the-role-of-in-context","title":"Learning vs Retrieval: The Role of In-Context Examples in Regression with LLMs","date":"2024-09-06","arxiv_id":"2409.04318","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":12,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-vs-retrieval-the-role-of-in-context#ran","syntology_url":"https://syntology.ai/paper/2409.04318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.04318"}},"official":{"repos":["HLR/LvsR-LLM"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lemon-learning-to-learn-multi-operator","slug":"lemon-learning-to-learn-multi-operator","title":"LeMON: Learning to Learn Multi-Operator Networks","date":"2024-08-28","arxiv_id":"2408.16168","repositories_listed":1,"syntology":null},{"url":"/paper/a-practitioner-s-guide-to-continual","slug":"a-practitioner-s-guide-to-continual","title":"A Practitioner's Guide to Continual Multimodal Pretraining","date":"2024-08-26","arxiv_id":"2408.14471","repositories_listed":1,"syntology":null},{"url":"/paper/learning-unknowns-from-unknowns-diversified","slug":"learning-unknowns-from-unknowns-diversified","title":"Learning Unknowns from Unknowns: Diversified Negative Prototypes Generator for Few-Shot Open-Set Recognition","date":"2024-08-23","arxiv_id":"2408.13373","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":2,"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/learning-unknowns-from-unknowns-diversified#ran","syntology_url":"https://syntology.ai/paper/2408.13373","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.13373"}},"official":{"repos":["icgy96/dnpg"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-on-augmented-gene-expression","slug":"meta-learning-on-augmented-gene-expression","title":"Meta-Learning on Augmented Gene Expression Profiles for Enhanced Lung Cancer Detection","date":"2024-08-19","arxiv_id":"2408.09635","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-explore-for-stochastic-gradient","slug":"learning-to-explore-for-stochastic-gradient","title":"Learning to Explore for Stochastic Gradient MCMC","date":"2024-08-17","arxiv_id":"2408.09140","repositories_listed":1,"syntology":null},{"url":"/paper/2408-03219","slug":"2408-03219","title":"Learning to Learn without Forgetting using Attention","date":"2024-08-06","arxiv_id":"2408.03219","repositories_listed":1,"syntology":null},{"url":"/paper/2408-00570","slug":"2408-00570","title":"Analyzing the Effectiveness of Quantum Annealing with Meta-Learning","date":"2024-08-01","arxiv_id":"2408.00570","repositories_listed":1,"syntology":null},{"url":"/paper/black-box-meta-learning-intrinsic-rewards-for","slug":"black-box-meta-learning-intrinsic-rewards-for","title":"Black box meta-learning intrinsic rewards for sparse-reward environments","date":"2024-07-31","arxiv_id":"2407.21546","repositories_listed":1,"syntology":null},{"url":"/paper/designing-time-series-models-with","slug":"designing-time-series-models-with","title":"Designing Time-Series Models With Hypernetworks & Adversarial Portfolios","date":"2024-07-29","arxiv_id":"2407.20352","repositories_listed":1,"syntology":null},{"url":"/paper/navix-scaling-minigrid-environments-with-jax","slug":"navix-scaling-minigrid-environments-with-jax","title":"NAVIX: Scaling MiniGrid Environments with JAX","date":"2024-07-28","arxiv_id":"2407.19396","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/navix-scaling-minigrid-environments-with-jax#ran","syntology_url":"https://syntology.ai/paper/2407.19396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.19396"}},"official":{"repos":["epignatelli/navix"],"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/train-attention-meta-learning-where-to-focus","slug":"train-attention-meta-learning-where-to-focus","title":"Train-Attention: Meta-Learning Where to Focus in Continual Knowledge Learning","date":"2024-07-24","arxiv_id":"2407.16920","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":12,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/train-attention-meta-learning-where-to-focus#ran","syntology_url":"https://syntology.ai/paper/2407.16920","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.16920"}},"official":{"repos":["ybseo-academy/TAALM"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-gps-enhancing-graph-meta-learning-with","slug":"meta-gps-enhancing-graph-meta-learning-with","title":"Meta-GPS++: Enhancing Graph Meta-Learning with Contrastive Learning and Self-Training","date":"2024-07-20","arxiv_id":"2407.14732","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-cascading-network-for-continual-test","slug":"adaptive-cascading-network-for-continual-test","title":"Adaptive Cascading Network for Continual Test-Time Adaptation","date":"2024-07-17","arxiv_id":"2407.12240","repositories_listed":1,"syntology":null},{"url":"/paper/base-models-for-parabolic-partial","slug":"base-models-for-parabolic-partial","title":"Base Models for Parabolic Partial Differential Equations","date":"2024-07-17","arxiv_id":"2407.12234","repositories_listed":1,"syntology":null},{"url":"/paper/deep-diffusion-image-prior-for-efficient-ood","slug":"deep-diffusion-image-prior-for-efficient-ood","title":"Deep Diffusion Image Prior for Efficient OOD Adaptation in 3D Inverse Problems","date":"2024-07-15","arxiv_id":"2407.10641","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":13,"phrase":"10 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; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/deep-diffusion-image-prior-for-efficient-ood#ran","syntology_url":"https://syntology.ai/paper/2407.10641","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10641"}},"official":{"repos":["hj-harry/ddip3d"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/generalized-face-anti-spoofing-via-finer","slug":"generalized-face-anti-spoofing-via-finer","title":"Generalized Face Anti-spoofing via Finer Domain Partition and Disentangling Liveness-irrelevant Factors","date":"2024-07-11","arxiv_id":"2407.08243","repositories_listed":1,"syntology":null},{"url":"/paper/mlrs-pds-a-meta-learning-recommendation-of","slug":"mlrs-pds-a-meta-learning-recommendation-of","title":"MLRS-PDS: A Meta-learning recommendation of dynamic ensemble selection pipelines","date":"2024-07-10","arxiv_id":"2407.07528","repositories_listed":1,"syntology":null},{"url":"/paper/can-learned-optimization-make-reinforcement","slug":"can-learned-optimization-make-reinforcement","title":"Can Learned Optimization Make Reinforcement Learning Less Difficult?","date":"2024-07-09","arxiv_id":"2407.07082","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 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) · 0 unverified","sample_list":"/paper/can-learned-optimization-make-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2407.07082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.07082"}},"official":{"repos":["alexgoldie/rl-learned-optimization"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/nonrigid-reconstruction-of-freehand","slug":"nonrigid-reconstruction-of-freehand","title":"Nonrigid Reconstruction of Freehand Ultrasound without a Tracker","date":"2024-07-08","arxiv_id":"2407.05767","repositories_listed":1,"syntology":null},{"url":"/paper/artificial-inductive-bias-for-synthetic","slug":"artificial-inductive-bias-for-synthetic","title":"Artificial Inductive Bias for Synthetic Tabular Data Generation in Data-Scarce Scenarios","date":"2024-07-03","arxiv_id":"2407.03080","repositories_listed":1,"syntology":null},{"url":"/paper/towards-multimodal-open-set-domain","slug":"towards-multimodal-open-set-domain","title":"Towards Multimodal Open-Set Domain Generalization and Adaptation through Self-supervision","date":"2024-07-01","arxiv_id":"2407.01518","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/towards-multimodal-open-set-domain#ran","syntology_url":"https://syntology.ai/paper/2407.01518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.01518"}},"official":{"repos":["donghao51/moosa"],"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/gm-df-generalized-multi-scenario-deepfake","slug":"gm-df-generalized-multi-scenario-deepfake","title":"GM-DF: Generalized Multi-Scenario Deepfake Detection","date":"2024-06-28","arxiv_id":"2406.20078","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-for-efficient-fine-tuning-of-1","slug":"meta-learning-for-efficient-fine-tuning-of-1","title":"Meta Learning for Efficient Fine-Tuning of Large Language Models","date":"2024-06-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pairwise-difference-learning-for","slug":"pairwise-difference-learning-for","title":"Pairwise Difference Learning for Classification","date":"2024-06-28","arxiv_id":"2406.20031","repositories_listed":1,"syntology":null},{"url":"/paper/automated-privacy-preserving-techniques-via","slug":"automated-privacy-preserving-techniques-via","title":"Automated Privacy-Preserving Techniques via Meta-Learning","date":"2024-06-24","arxiv_id":"2406.16456","repositories_listed":1,"syntology":null},{"url":"/paper/cross-domain-transfer-of-valence-preferences","slug":"cross-domain-transfer-of-valence-preferences","title":"Cross-domain Transfer of Valence Preferences via a Meta-optimization Approach","date":"2024-06-24","arxiv_id":"2406.16494","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-cross-domain-few-shot","slug":"exploring-cross-domain-few-shot","title":"Exploring Cross-Domain Few-Shot Classification via Frequency-Aware Prompting","date":"2024-06-24","arxiv_id":"2406.16422","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":9,"phrase":"5 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/exploring-cross-domain-few-shot#ran","syntology_url":"https://syntology.ai/paper/2406.16422","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.16422"}},"official":{"repos":["tinkez/fap_cdfsc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-and-data-augmentation-for","slug":"meta-learning-and-data-augmentation-for","title":"Meta-learning and Data Augmentation for Stress Testing Forecasting Models","date":"2024-06-24","arxiv_id":"2406.17008","repositories_listed":1,"syntology":null},{"url":"/paper/metagreen-meta-learning-inspired-transformer","slug":"metagreen-meta-learning-inspired-transformer","title":"MetaGreen: Meta-Learning Inspired Transformer Selection for Green Semantic Communication","date":"2024-06-22","arxiv_id":"2406.16962","repositories_listed":1,"syntology":null},{"url":"/paper/approximately-equivariant-neural-processes","slug":"approximately-equivariant-neural-processes","title":"Approximately Equivariant Neural Processes","date":"2024-06-19","arxiv_id":"2406.13488","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-minimal-reinforcement-learning","slug":"discovering-minimal-reinforcement-learning","title":"Discovering Minimal Reinforcement Learning Environments","date":"2024-06-18","arxiv_id":"2406.12589","repositories_listed":1,"syntology":null},{"url":"/paper/spuriousness-aware-meta-learning-for-learning","slug":"spuriousness-aware-meta-learning-for-learning","title":"Spuriousness-Aware Meta-Learning for Learning Robust Classifiers","date":"2024-06-15","arxiv_id":"2406.10742","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/spuriousness-aware-meta-learning-for-learning#ran","syntology_url":"https://syntology.ai/paper/2406.10742","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10742"}},"official":{"repos":["gtzheng/SPUME"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/blind-super-resolution-via-meta-learning-and","slug":"blind-super-resolution-via-meta-learning-and","title":"Blind Super-Resolution via Meta-learning and Markov Chain Monte Carlo Simulation","date":"2024-06-13","arxiv_id":"2406.08896","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-an-evolvable-developmental","slug":"meta-learning-an-evolvable-developmental","title":"Meta-Learning an Evolvable Developmental Encoding","date":"2024-06-13","arxiv_id":"2406.09020","repositories_listed":1,"syntology":null},{"url":"/paper/noise-aware-differentially-private-regression","slug":"noise-aware-differentially-private-regression","title":"Noise-Aware Differentially Private Regression via Meta-Learning","date":"2024-06-12","arxiv_id":"2406.08569","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/noise-aware-differentially-private-regression#ran","syntology_url":"https://syntology.ai/paper/2406.08569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08569"}},"official":{"repos":["cambridge-mlg/dpconvcnp"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-text-to-speech-synthesis-in","slug":"meta-learning-text-to-speech-synthesis-in","title":"Meta Learning Text-to-Speech Synthesis in over 7000 Languages","date":"2024-06-10","arxiv_id":"2406.06403","repositories_listed":1,"syntology":null},{"url":"/paper/cooperative-meta-learning-with-gradient","slug":"cooperative-meta-learning-with-gradient","title":"Cooperative Meta-Learning with Gradient Augmentation","date":"2024-06-07","arxiv_id":"2406.04639","repositories_listed":1,"syntology":null},{"url":"/paper/what-do-language-models-learn-in-context-the","slug":"what-do-language-models-learn-in-context-the","title":"What Do Language Models Learn in Context? The Structured Task Hypothesis","date":"2024-06-06","arxiv_id":"2406.04216","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/what-do-language-models-learn-in-context-the#ran","syntology_url":"https://syntology.ai/paper/2406.04216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04216"}},"official":{"repos":["eth-lre/llm_icl"],"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/gs-phong-meta-learned-3d-gaussians-for","slug":"gs-phong-meta-learned-3d-gaussians-for","title":"GS-Phong: Meta-Learned 3D Gaussians for Relightable Novel View Synthesis","date":"2024-05-31","arxiv_id":"2405.20791","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":13,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gs-phong-meta-learned-3d-gaussians-for#ran","syntology_url":"https://syntology.ai/paper/2405.20791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20791"}},"official":{"repos":["ymhe12/GS-Phong"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-continually-learn-with-the","slug":"learning-to-continually-learn-with-the","title":"Learning to Continually Learn with the Bayesian Principle","date":"2024-05-29","arxiv_id":"2405.18758","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-continually-learn-with-the#ran","syntology_url":"https://syntology.ai/paper/2405.18758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18758"}},"official":{"repos":["soochan-lee/sb-mcl"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/harmodt-harmony-multi-task-decision","slug":"harmodt-harmony-multi-task-decision","title":"HarmoDT: Harmony Multi-Task Decision Transformer for Offline Reinforcement Learning","date":"2024-05-28","arxiv_id":"2405.18080","repositories_listed":1,"syntology":null},{"url":"/paper/task-groupings-regularization-data-free-meta","slug":"task-groupings-regularization-data-free-meta","title":"Task Groupings Regularization: Data-Free Meta-Learning with Heterogeneous Pre-trained Models","date":"2024-05-26","arxiv_id":"2405.16560","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/task-groupings-regularization-data-free-meta#ran","syntology_url":"https://syntology.ai/paper/2405.16560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16560"}},"official":{"repos":["walkerworldpeace/tgr"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-enhanced-relation-graph-and-task","slug":"knowledge-enhanced-relation-graph-and-task","title":"Knowledge-enhanced Relation Graph and Task Sampling for Few-shot Molecular Property Prediction","date":"2024-05-24","arxiv_id":"2405.15544","repositories_listed":1,"syntology":null},{"url":"/paper/anomalydino-boosting-patch-based-few-shot","slug":"anomalydino-boosting-patch-based-few-shot","title":"AnomalyDINO: Boosting Patch-based Few-shot Anomaly Detection with DINOv2","date":"2024-05-23","arxiv_id":"2405.14529","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/anomalydino-boosting-patch-based-few-shot#ran","syntology_url":"https://syntology.ai/paper/2405.14529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14529"}},"official":{"repos":["dammsi/AnomalyDINO"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/foundation-model-for-chemical-process","slug":"foundation-model-for-chemical-process","title":"Towards Foundation Model for Chemical Reactor Modeling: Meta-Learning with Physics-Informed Adaptation","date":"2024-05-20","arxiv_id":"2405.11752","repositories_listed":1,"syntology":null},{"url":"/paper/perturbing-the-gradient-for-alleviating-meta","slug":"perturbing-the-gradient-for-alleviating-meta","title":"Perturbing the Gradient for Alleviating Meta Overfitting","date":"2024-05-20","arxiv_id":"2405.12299","repositories_listed":1,"syntology":null},{"url":"/paper/scrutinize-what-we-ignore-reining-task","slug":"scrutinize-what-we-ignore-reining-task","title":"Scrutinize What We Ignore: Reining In Task Representation Shift Of Context-Based Offline Meta Reinforcement Learning","date":"2024-05-20","arxiv_id":"2405.12001","repositories_listed":1,"syntology":null},{"url":"/paper/on-device-online-learning-and-semantic","slug":"on-device-online-learning-and-semantic","title":"On-device Online Learning and Semantic Management of TinyML Systems","date":"2024-05-13","arxiv_id":"2405.07601","repositories_listed":1,"syntology":null},{"url":"/paper/cross-domain-continual-learning-via-clamp","slug":"cross-domain-continual-learning-via-clamp","title":"Cross-Domain Continual Learning via CLAMP","date":"2024-05-12","arxiv_id":"2405.07142","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-multi-modal-learning-meta-learned","slug":"enhancing-multi-modal-learning-meta-learned","title":"Meta-Learned Modality-Weighted Knowledge Distillation for Robust Multi-Modal Learning with Missing Data","date":"2024-05-12","arxiv_id":"2405.07155","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-for-efficient-fine-tuning-of","slug":"meta-learning-for-efficient-fine-tuning-of","title":"Meta-Learning for Efficient Fine-Tuning of Large Language Models","date":"2024-05-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/exploring-frequencies-via-feature-mixing-and","slug":"exploring-frequencies-via-feature-mixing-and","title":"Exploring Frequencies via Feature Mixing and Meta-Learning for Improving Adversarial Transferability","date":"2024-05-06","arxiv_id":"2405.03193","repositories_listed":1,"syntology":null},{"url":"/paper/adapting-to-distribution-shift-by-visual","slug":"adapting-to-distribution-shift-by-visual","title":"Adapting to Distribution Shift by Visual Domain Prompt Generation","date":"2024-05-05","arxiv_id":"2405.02797","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":5,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 2 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adapting-to-distribution-shift-by-visual#ran","syntology_url":"https://syntology.ai/paper/2405.02797","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.02797"}},"official":{"repos":["guliisgreat/vdpg"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-context-flows-for-learning","slug":"neural-context-flows-for-learning","title":"Neural Context Flows for Meta-Learning of Dynamical Systems","date":"2024-05-03","arxiv_id":"2405.02154","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/neural-context-flows-for-learning#ran","syntology_url":"https://syntology.ai/paper/2405.02154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.02154"}},"official":{"repos":["ddrous/ncflow"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/free-faster-and-better-data-free-meta","slug":"free-faster-and-better-data-free-meta","title":"FREE: Faster and Better Data-Free Meta-Learning","date":"2024-05-02","arxiv_id":"2405.00984","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/free-faster-and-better-data-free-meta#ran","syntology_url":"https://syntology.ai/paper/2405.00984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.00984"}},"official":{"repos":["walkerworldpeace/free"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/chameleon-a-data-efficient-generalist-for","slug":"chameleon-a-data-efficient-generalist-for","title":"Chameleon: A Data-Efficient Generalist for Dense Visual Prediction in the Wild","date":"2024-04-29","arxiv_id":"2404.18459","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/chameleon-a-data-efficient-generalist-for#ran","syntology_url":"https://syntology.ai/paper/2404.18459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.18459"}},"official":{"repos":["gitgyun/chameleon"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/metasd-a-unified-framework-for-scalable","slug":"metasd-a-unified-framework-for-scalable","title":"MetaSD: A Unified Framework for Scalable Downscaling of Meteorological Variables in Diverse Situations","date":"2024-04-26","arxiv_id":"2404.17611","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-performance-guarantees-for","slug":"data-driven-performance-guarantees-for","title":"Data-Driven Performance Guarantees for Classical and Learned Optimizers","date":"2024-04-22","arxiv_id":"2404.13831","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/data-driven-performance-guarantees-for#ran","syntology_url":"https://syntology.ai/paper/2404.13831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13831"}},"official":{"repos":["stellatogrp/datadrivenoptimizerguarantees"],"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/sophon-non-fine-tunable-learning-to-restrain","slug":"sophon-non-fine-tunable-learning-to-restrain","title":"SOPHON: Non-Fine-Tunable Learning to Restrain Task Transferability For Pre-trained Models","date":"2024-04-19","arxiv_id":"2404.12699","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":12,"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) · 3 unverified","sample_list":"/paper/sophon-non-fine-tunable-learning-to-restrain#ran","syntology_url":"https://syntology.ai/paper/2404.12699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.12699"}},"official":{"repos":["chiange/sophon"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/spectral-convolutional-conditional-neural","slug":"spectral-convolutional-conditional-neural","title":"Spectral Convolutional Conditional Neural Processes","date":"2024-04-19","arxiv_id":"2404.13182","repositories_listed":1,"syntology":null}],"record_sha256":"0c4c61c80cb251213a797d3b539c1f1c193b38a8298a5692fa426c7e87b53fba","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}