{"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/ran/1","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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":5,"rows_per_page":100,"rows":[1,100],"of":420,"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/papers/ran/1","prev":null,"next":"/task/meta-learning/papers/ran/2","papers":[{"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/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/tsrating-rating-quality-of-diverse-time","slug":"tsrating-rating-quality-of-diverse-time","title":"TSRating: Rating Quality of Diverse Time Series Data by Meta-learning from LLM Judgment","date":"2025-06-02","arxiv_id":"2506.01290","repositories_listed":0,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"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 2 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/tsrating-rating-quality-of-diverse-time#ran","syntology_url":"https://syntology.ai/paper/2506.01290","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.01290"}},"official":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/generalizable-heuristic-generation-through","slug":"generalizable-heuristic-generation-through","title":"Generalizable Heuristic Generation Through Large Language Models with Meta-Optimization","date":"2025-05-27","arxiv_id":"2505.20881","repositories_listed":0,"syntology":{"n":13,"n_ran":9,"n_constructed":2,"n_ran_checked":3,"n_instrument":6,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"9 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/generalizable-heuristic-generation-through#ran","syntology_url":"https://syntology.ai/paper/2505.20881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.20881"}},"official":null}},{"url":"/paper/metabox-v2-a-unified-benchmark-platform-for","slug":"metabox-v2-a-unified-benchmark-platform-for","title":"MetaBox-v2: A Unified Benchmark Platform for Meta-Black-Box Optimization","date":"2025-05-23","arxiv_id":"2505.17745","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/metabox-v2-a-unified-benchmark-platform-for#ran","syntology_url":"https://syntology.ai/paper/2505.17745","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.17745"}},"official":{"repos":["metaevo/metabox"],"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":["listed","official"]}}},{"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/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/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/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/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/learning-to-generalize-without-bias-for-open","slug":"learning-to-generalize-without-bias-for-open","title":"Learning to Generalize without Bias for Open-Vocabulary Action Recognition","date":"2025-02-27","arxiv_id":"2502.20158","repositories_listed":0,"syntology":{"n":7,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-to-generalize-without-bias-for-open#ran","syntology_url":"https://syntology.ai/paper/2502.20158","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.20158"}},"official":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/in-context-meta-lora-generation","slug":"in-context-meta-lora-generation","title":"In-Context Meta LoRA Generation","date":"2025-01-29","arxiv_id":"2501.17635","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/in-context-meta-lora-generation#ran","syntology_url":"https://syntology.ai/paper/2501.17635","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.17635"}},"official":null}},{"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/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/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/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}},{"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/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/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/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/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/metaood-automatic-selection-of-ood-detection","slug":"metaood-automatic-selection-of-ood-detection","title":"MetaOOD: Automatic Selection of OOD Detection Models","date":"2024-10-04","arxiv_id":"2410.03074","repositories_listed":0,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/metaood-automatic-selection-of-ood-detection#ran","syntology_url":"https://syntology.ai/paper/2410.03074","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03074"}},"official":null}},{"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/opponent-shaping-for-antibody-development","slug":"opponent-shaping-for-antibody-development","title":"ADIOS: Antibody Development via Opponent Shaping","date":"2024-09-16","arxiv_id":"2409.10588","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/opponent-shaping-for-antibody-development#ran","syntology_url":"https://syntology.ai/paper/2409.10588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.10588"}},"official":{"repos":["olakalisz/adios","olakalisz/antibody-shapers"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/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/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/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/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/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/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/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/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/unsupervised-meta-learning-via-in-context","slug":"unsupervised-meta-learning-via-in-context","title":"Unsupervised Meta-Learning via In-Context Learning","date":"2024-05-25","arxiv_id":"2405.16124","repositories_listed":0,"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/unsupervised-meta-learning-via-in-context#ran","syntology_url":"https://syntology.ai/paper/2405.16124","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16124"}},"official":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/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/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/benchmarking-and-improving-compositional","slug":"benchmarking-and-improving-compositional","title":"Benchmarking and Improving Compositional Generalization of Multi-aspect Controllable Text Generation","date":"2024-04-05","arxiv_id":"2404.04232","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/benchmarking-and-improving-compositional#ran","syntology_url":"https://syntology.ai/paper/2404.04232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.04232"}},"official":{"repos":["tqzhong/cg4mctg"],"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/nonsmooth-implicit-differentiation","slug":"nonsmooth-implicit-differentiation","title":"Nonsmooth Implicit Differentiation: Deterministic and Stochastic Convergence Rates","date":"2024-03-18","arxiv_id":"2403.11687","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/nonsmooth-implicit-differentiation#ran","syntology_url":"https://syntology.ai/paper/2403.11687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.11687"}},"official":{"repos":["prolearner/nonsmooth_implicit_diff"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unleashing-the-power-of-meta-tuning-for-few","slug":"unleashing-the-power-of-meta-tuning-for-few","title":"Unleashing the Power of Meta-tuning for Few-shot Generalization Through Sparse Interpolated Experts","date":"2024-03-13","arxiv_id":"2403.08477","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":0,"n_no_contract":7,"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, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unleashing-the-power-of-meta-tuning-for-few#ran","syntology_url":"https://syntology.ai/paper/2403.08477","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.08477"}},"official":{"repos":["szc12153/sparse_meta_tuning"],"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/xb-maml-learning-expandable-basis-parameters","slug":"xb-maml-learning-expandable-basis-parameters","title":"XB-MAML: Learning Expandable Basis Parameters for Effective Meta-Learning with Wide Task Coverage","date":"2024-03-11","arxiv_id":"2403.06768","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"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) · 3 unverified","sample_list":"/paper/xb-maml-learning-expandable-basis-parameters#ran","syntology_url":"https://syntology.ai/paper/2403.06768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.06768"}},"official":{"repos":["johnjaejunlee95/xb-maml"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/all-in-one-multi-task-prompting-for-graph-1","slug":"all-in-one-multi-task-prompting-for-graph-1","title":"All in One: Multi-Task Prompting for Graph Neural Networks (Extended Abstract)","date":"2024-03-11","arxiv_id":"2403.07040","repositories_listed":0,"syntology":{"n":5,"n_ran":5,"n_constructed":4,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/all-in-one-multi-task-prompting-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2403.07040","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07040"}},"official":null}},{"url":"/paper/online-adaptation-of-language-models-with-a","slug":"online-adaptation-of-language-models-with-a","title":"Online Adaptation of Language Models with a Memory of Amortized Contexts","date":"2024-03-07","arxiv_id":"2403.04317","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":9,"n_instrument":4,"n_unverified":2,"n_honours":1,"n_violates":5,"n_no_contract":3,"n_pointer_only":3,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 5 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/online-adaptation-of-language-models-with-a#ran","syntology_url":"https://syntology.ai/paper/2403.04317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.04317"}},"official":{"repos":["jihoontack/mac"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/harnessing-meta-learning-for-improving-full","slug":"harnessing-meta-learning-for-improving-full","title":"Harnessing Meta-Learning for Improving Full-Frame Video Stabilization","date":"2024-03-06","arxiv_id":"2403.03662","repositories_listed":1,"syntology":{"n":10,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":10,"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) · 6 unverified","sample_list":"/paper/harnessing-meta-learning-for-improving-full#ran","syntology_url":"https://syntology.ai/paper/2403.03662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.03662"}},"official":{"repos":["mkashifali/metavideostab"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-defer-to-a-population-a-meta","slug":"learning-to-defer-to-a-population-a-meta","title":"Learning to Defer to a Population: A Meta-Learning Approach","date":"2024-03-05","arxiv_id":"2403.02683","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-to-defer-to-a-population-a-meta#ran","syntology_url":"https://syntology.ai/paper/2403.02683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.02683"}},"official":{"repos":["dvtailor/meta-l2d"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/on-latency-predictors-for-neural-architecture","slug":"on-latency-predictors-for-neural-architecture","title":"On Latency Predictors for Neural Architecture Search","date":"2024-03-04","arxiv_id":"2403.02446","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":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-latency-predictors-for-neural-architecture#ran","syntology_url":"https://syntology.ai/paper/2403.02446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.02446"}},"official":{"repos":["abdelfattah-lab/nasflat_latency"],"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/diffusion-based-neural-network-weights","slug":"diffusion-based-neural-network-weights","title":"Diffusion-Based Neural Network Weights Generation","date":"2024-02-28","arxiv_id":"2402.18153","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diffusion-based-neural-network-weights#ran","syntology_url":"https://syntology.ai/paper/2402.18153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.18153"}},"official":{"repos":["sorobedio/dnnwg"],"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","unlocated"]}}},{"url":"/paper/reinforced-in-context-black-box-optimization","slug":"reinforced-in-context-black-box-optimization","title":"Reinforced In-Context Black-Box Optimization","date":"2024-02-27","arxiv_id":"2402.17423","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reinforced-in-context-black-box-optimization#ran","syntology_url":"https://syntology.ai/paper/2402.17423","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17423"}},"official":{"repos":["songlei00/ribbo"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/vrp-sam-sam-with-visual-reference-prompt","slug":"vrp-sam-sam-with-visual-reference-prompt","title":"VRP-SAM: SAM with Visual Reference Prompt","date":"2024-02-27","arxiv_id":"2402.17726","repositories_listed":1,"syntology":{"n":38,"n_ran":25,"n_constructed":4,"n_ran_checked":11,"n_instrument":14,"n_unverified":13,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":7,"phrase":"25 ran (of which 4 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 14 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/vrp-sam-sam-with-visual-reference-prompt#ran","syntology_url":"https://syntology.ai/paper/2402.17726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17726"}},"official":{"repos":["syp2ysy/vrp-sam"],"state":"official (archive's flag): 25 ran","n_ran":25,"n_constructed":4,"n_ran_no_instrument_failure":11,"n_unverified":13,"ran_from_kinds":["official"]}}},{"url":"/paper/discovering-temporally-aware-reinforcement","slug":"discovering-temporally-aware-reinforcement","title":"Discovering Temporally-Aware Reinforcement Learning Algorithms","date":"2024-02-08","arxiv_id":"2402.05828","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/discovering-temporally-aware-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2402.05828","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05828"}},"official":{"repos":["EmptyJackson/groove"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-a-decision-tree-algorithm-with","slug":"learning-a-decision-tree-algorithm-with","title":"Learning a Decision Tree Algorithm with Transformers","date":"2024-02-06","arxiv_id":"2402.03774","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-a-decision-tree-algorithm-with#ran","syntology_url":"https://syntology.ai/paper/2402.03774","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.03774"}},"official":{"repos":["evanzhuang/metatree"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/more-flexible-pac-bayesian-meta-learning-by","slug":"more-flexible-pac-bayesian-meta-learning-by","title":"More Flexible PAC-Bayesian Meta-Learning by Learning Learning Algorithms","date":"2024-02-06","arxiv_id":"2402.04054","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":7,"n_instrument":5,"n_unverified":2,"n_honours":7,"n_violates":0,"n_no_contract":0,"n_pointer_only":14,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 7 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/more-flexible-pac-bayesian-meta-learning-by#ran","syntology_url":"https://syntology.ai/paper/2402.04054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04054"}},"official":{"repos":["hzakerinia/flexible-pac-bayes-meta-learning"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/is-mamba-capable-of-in-context-learning","slug":"is-mamba-capable-of-in-context-learning","title":"Is Mamba Capable of In-Context Learning?","date":"2024-02-05","arxiv_id":"2402.03170","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"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) · 1 unverified","sample_list":"/paper/is-mamba-capable-of-in-context-learning#ran","syntology_url":"https://syntology.ai/paper/2402.03170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.03170"}},"official":{"repos":["automl/is_mamba_capable_of_icl"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/symbol-generating-flexible-black-box","slug":"symbol-generating-flexible-black-box","title":"Symbol: Generating Flexible Black-Box Optimizers through Symbolic Equation Learning","date":"2024-02-04","arxiv_id":"2402.02355","repositories_listed":1,"syntology":{"n":18,"n_ran":15,"n_constructed":1,"n_ran_checked":14,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"15 ran (of which 1 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/symbol-generating-flexible-black-box#ran","syntology_url":"https://syntology.ai/paper/2402.02355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02355"}},"official":{"repos":["gmc-drl/symbol"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":1,"n_ran_no_instrument_failure":14,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-universal-predictors","slug":"learning-universal-predictors","title":"Learning Universal Predictors","date":"2024-01-26","arxiv_id":"2401.14953","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-universal-predictors#ran","syntology_url":"https://syntology.ai/paper/2401.14953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14953"}},"official":{"repos":["google-deepmind/neural_networks_solomonoff_induction"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/secrets-of-rlhf-in-large-language-models-part-1","slug":"secrets-of-rlhf-in-large-language-models-part-1","title":"Secrets of RLHF in Large Language Models Part II: Reward Modeling","date":"2024-01-11","arxiv_id":"2401.06080","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/secrets-of-rlhf-in-large-language-models-part-1#ran","syntology_url":"https://syntology.ai/paper/2401.06080","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06080"}},"official":{"repos":["openlmlab/moss-rlhf"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-fss-a-novel-few-shot-segmentation","slug":"adaptive-fss-a-novel-few-shot-segmentation","title":"Adaptive FSS: A Novel Few-Shot Segmentation Framework via Prototype Enhancement","date":"2023-12-25","arxiv_id":"2312.15731","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"8 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-fss-a-novel-few-shot-segmentation#ran","syntology_url":"https://syntology.ai/paper/2312.15731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.15731"}},"official":{"repos":["jingw193/adaptive_fss","jingw193/adaptivefss"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-dimensional-rationale-in-graph","slug":"rethinking-dimensional-rationale-in-graph","title":"Rethinking Dimensional Rationale in Graph Contrastive Learning from Causal Perspective","date":"2023-12-16","arxiv_id":"2312.10401","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rethinking-dimensional-rationale-in-graph#ran","syntology_url":"https://syntology.ai/paper/2312.10401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10401"}},"official":{"repos":["byronji/drgcl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mothernet-a-foundational-hypernetwork-for","slug":"mothernet-a-foundational-hypernetwork-for","title":"MotherNet: Fast Training and Inference via Hyper-Network Transformers","date":"2023-12-14","arxiv_id":"2312.08598","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mothernet-a-foundational-hypernetwork-for#ran","syntology_url":"https://syntology.ai/paper/2312.08598","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.08598"}},"official":{"repos":["microsoft/ticl"],"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/concrete-subspace-learning-based-interference","slug":"concrete-subspace-learning-based-interference","title":"Concrete Subspace Learning based Interference Elimination for Multi-task Model Fusion","date":"2023-12-11","arxiv_id":"2312.06173","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"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) · 1 unverified","sample_list":"/paper/concrete-subspace-learning-based-interference#ran","syntology_url":"https://syntology.ai/paper/2312.06173","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.06173"}},"official":{"repos":["tanganke/subspace_fusion"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/automating-continual-learning","slug":"automating-continual-learning","title":"Automating Continual Learning","date":"2023-12-01","arxiv_id":"2312.00276","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/automating-continual-learning#ran","syntology_url":"https://syntology.ai/paper/2312.00276","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.00276"}},"official":{"repos":["idsia/automated-cl"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/segic-unleashing-the-emergent-correspondence","slug":"segic-unleashing-the-emergent-correspondence","title":"SEGIC: Unleashing the Emergent Correspondence for In-Context Segmentation","date":"2023-11-24","arxiv_id":"2311.14671","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"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) · 5 unverified","sample_list":"/paper/segic-unleashing-the-emergent-correspondence#ran","syntology_url":"https://syntology.ai/paper/2311.14671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14671"}},"official":{"repos":["menglcool/segic"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/toward-robust-imperceptible-perturbation","slug":"toward-robust-imperceptible-perturbation","title":"MetaCloak: Preventing Unauthorized Subject-driven Text-to-image Diffusion-based Synthesis via Meta-learning","date":"2023-11-22","arxiv_id":"2311.13127","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"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) · 3 unverified","sample_list":"/paper/toward-robust-imperceptible-perturbation#ran","syntology_url":"https://syntology.ai/paper/2311.13127","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.13127"}},"official":{"repos":["liuyixin-louis/metacloak"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/jaxmarl-multi-agent-rl-environments-in-jax","slug":"jaxmarl-multi-agent-rl-environments-in-jax","title":"JaxMARL: Multi-Agent RL Environments and Algorithms in JAX","date":"2023-11-16","arxiv_id":"2311.10090","repositories_listed":3,"syntology":{"n":23,"n_ran":22,"n_constructed":0,"n_ran_checked":22,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":22,"n_pointer_only":0,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 0 honoured, 0 violated, 22 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/jaxmarl-multi-agent-rl-environments-in-jax#ran","syntology_url":"https://syntology.ai/paper/2311.10090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.10090"}},"official":{"repos":["flairox/jaxmarl"],"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/in-context-learning-for-mimo-equalization","slug":"in-context-learning-for-mimo-equalization","title":"In-Context Learning for MIMO Equalization Using Transformer-Based Sequence Models","date":"2023-11-10","arxiv_id":"2311.06101","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/in-context-learning-for-mimo-equalization#ran","syntology_url":"https://syntology.ai/paper/2311.06101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.06101"}},"official":{"repos":["kclip/icl-equalization"],"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/massive-editing-for-large-language-models-via","slug":"massive-editing-for-large-language-models-via","title":"Massive Editing for Large Language Models via Meta Learning","date":"2023-11-08","arxiv_id":"2311.04661","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/massive-editing-for-large-language-models-via#ran","syntology_url":"https://syntology.ai/paper/2311.04661","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.04661"}},"official":{"repos":["chenmientan/malmen"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neuroevobench-benchmarking-evolutionary","slug":"neuroevobench-benchmarking-evolutionary","title":"NeuroEvoBench: Benchmarking Evolutionary Optimizers for Deep Learning Applications","date":"2023-11-04","arxiv_id":"2311.02394","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neuroevobench-benchmarking-evolutionary#ran","syntology_url":"https://syntology.ai/paper/2311.02394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02394"}},"official":{"repos":["neuroevobench/neuroevobench"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/ever-evolving-evaluator-ev3-towards-flexible","slug":"ever-evolving-evaluator-ev3-towards-flexible","title":"Ever Evolving Evaluator (EV3): Towards Flexible and Reliable Meta-Optimization for Knowledge Distillation","date":"2023-10-29","arxiv_id":"2310.18893","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"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 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/ever-evolving-evaluator-ev3-towards-flexible#ran","syntology_url":"https://syntology.ai/paper/2310.18893","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18893"}},"official":{"repos":["google-research/google-research"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hyperbolic-graph-neural-networks-at-scale-a","slug":"hyperbolic-graph-neural-networks-at-scale-a","title":"Hyperbolic Graph Neural Networks at Scale: A Meta Learning Approach","date":"2023-10-29","arxiv_id":"2310.18918","repositories_listed":0,"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":6,"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/hyperbolic-graph-neural-networks-at-scale-a#ran","syntology_url":"https://syntology.ai/paper/2310.18918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18918"}},"official":null}},{"url":"/paper/modality-agnostic-self-supervised-learning","slug":"modality-agnostic-self-supervised-learning","title":"Modality-Agnostic Self-Supervised Learning with Meta-Learned Masked Auto-Encoder","date":"2023-10-25","arxiv_id":"2310.16318","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/modality-agnostic-self-supervised-learning#ran","syntology_url":"https://syntology.ai/paper/2310.16318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.16318"}},"official":null}},{"url":"/paper/redco-a-lightweight-tool-to-automate","slug":"redco-a-lightweight-tool-to-automate","title":"RedCoast: A Lightweight Tool to Automate Distributed Training of LLMs on Any GPU/TPUs","date":"2023-10-25","arxiv_id":"2310.16355","repositories_listed":1,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"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) · 5 unverified","sample_list":"/paper/redco-a-lightweight-tool-to-automate#ran","syntology_url":"https://syntology.ai/paper/2310.16355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.16355"}},"official":{"repos":["tanyuqian/redco"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/deceptive-fairness-attacks-on-graphs-via-meta","slug":"deceptive-fairness-attacks-on-graphs-via-meta","title":"Deceptive Fairness Attacks on Graphs via Meta Learning","date":"2023-10-24","arxiv_id":"2310.15653","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/deceptive-fairness-attacks-on-graphs-via-meta#ran","syntology_url":"https://syntology.ai/paper/2310.15653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15653"}},"official":{"repos":["jiank2/fate"],"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/meta-out-of-context-learning-in-neural","slug":"meta-out-of-context-learning-in-neural","title":"Implicit meta-learning may lead language models to trust more reliable sources","date":"2023-10-23","arxiv_id":"2310.15047","repositories_listed":1,"syntology":{"n":22,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":22,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/meta-out-of-context-learning-in-neural#ran","syntology_url":"https://syntology.ai/paper/2310.15047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15047"}},"official":{"repos":["krasheninnikov/internalization"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/context-aware-meta-learning","slug":"context-aware-meta-learning","title":"Context-Aware Meta-Learning","date":"2023-10-17","arxiv_id":"2310.10971","repositories_listed":1,"syntology":{"n":16,"n_ran":5,"n_constructed":4,"n_ran_checked":5,"n_instrument":0,"n_unverified":11,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 4 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) · 11 unverified","sample_list":"/paper/context-aware-meta-learning#ran","syntology_url":"https://syntology.ai/paper/2310.10971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10971"}},"official":{"repos":["cfifty/CAML"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":4,"n_ran_no_instrument_failure":5,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/group-preference-optimization-few-shot","slug":"group-preference-optimization-few-shot","title":"Group Preference Optimization: Few-Shot Alignment of Large Language Models","date":"2023-10-17","arxiv_id":"2310.11523","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/group-preference-optimization-few-shot#ran","syntology_url":"https://syntology.ai/paper/2310.11523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.11523"}},"official":{"repos":["jamqd/Group-Preference-Optimization"],"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/a-partially-supervised-reinforcement-learning","slug":"a-partially-supervised-reinforcement-learning","title":"A Partially Supervised Reinforcement Learning Framework for Visual Active Search","date":"2023-10-15","arxiv_id":"2310.09689","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":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-partially-supervised-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/2310.09689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09689"}},"official":{"repos":["anindyasarkariith/psrl_vas"],"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/amago-scalable-in-context-reinforcement","slug":"amago-scalable-in-context-reinforcement","title":"AMAGO: Scalable In-Context Reinforcement Learning for Adaptive Agents","date":"2023-10-15","arxiv_id":"2310.09971","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/amago-scalable-in-context-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2310.09971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09971"}},"official":{"repos":["ut-austin-rpl/amago"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-set-representation-learning","slug":"self-supervised-set-representation-learning","title":"Self-Supervised Dataset Distillation for Transfer Learning","date":"2023-10-10","arxiv_id":"2310.06511","repositories_listed":2,"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/self-supervised-set-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2310.06511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.06511"}},"official":{"repos":["db-lee/selfsup_dd"],"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/neural-relational-inference-with-fast-modular-1","slug":"neural-relational-inference-with-fast-modular-1","title":"Neural Relational Inference with Fast Modular Meta-learning","date":"2023-10-10","arxiv_id":"2310.07015","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":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/neural-relational-inference-with-fast-modular-1#ran","syntology_url":"https://syntology.ai/paper/2310.07015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07015"}},"official":{"repos":["FerranAlet/modular-metalearning"],"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/on-the-role-of-neural-collapse-in-meta","slug":"on-the-role-of-neural-collapse-in-meta","title":"On the Role of Neural Collapse in Meta Learning Models for Few-shot Learning","date":"2023-09-30","arxiv_id":"2310.00451","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-the-role-of-neural-collapse-in-meta#ran","syntology_url":"https://syntology.ai/paper/2310.00451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00451"}},"official":{"repos":["saakethmm/nc-prototypical-networks"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-contrastive-learning-meets-graph-meta","slug":"graph-contrastive-learning-meets-graph-meta","title":"Graph Contrastive Learning Meets Graph Meta Learning: A Unified Method for Few-shot Node Tasks","date":"2023-09-19","arxiv_id":"2309.10376","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":3,"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/graph-contrastive-learning-meets-graph-meta#ran","syntology_url":"https://syntology.ai/paper/2309.10376","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.10376"}},"official":{"repos":["haoliu-cola/cola"],"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/fine-grained-recognition-with-learnable","slug":"fine-grained-recognition-with-learnable","title":"Fine-grained Recognition with Learnable Semantic Data Augmentation","date":"2023-09-01","arxiv_id":"2309.00399","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"4 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/fine-grained-recognition-with-learnable#ran","syntology_url":"https://syntology.ai/paper/2309.00399","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.00399"}},"official":{"repos":["LeapLabTHU/LearnableISDA"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/metagcd-learning-to-continually-learn-in","slug":"metagcd-learning-to-continually-learn-in","title":"MetaGCD: Learning to Continually Learn in Generalized Category Discovery","date":"2023-08-21","arxiv_id":"2308.11063","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/metagcd-learning-to-continually-learn-in#ran","syntology_url":"https://syntology.ai/paper/2308.11063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11063"}},"official":{"repos":["ynanwu/metagcd"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/generalizable-decision-boundaries-dualistic","slug":"generalizable-decision-boundaries-dualistic","title":"Generalizable Decision Boundaries: Dualistic Meta-Learning for Open Set Domain Generalization","date":"2023-08-18","arxiv_id":"2308.09391","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"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) · 4 unverified","sample_list":"/paper/generalizable-decision-boundaries-dualistic#ran","syntology_url":"https://syntology.ai/paper/2308.09391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09391"}},"official":{"repos":["zzwdx/medic"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/damstf-domain-adversarial-learning-enhanced","slug":"damstf-domain-adversarial-learning-enhanced","title":"DaMSTF: Domain Adversarial Learning Enhanced Meta Self-Training for Domain Adaptation","date":"2023-08-05","arxiv_id":"2308.02753","repositories_listed":0,"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/damstf-domain-adversarial-learning-enhanced#ran","syntology_url":"https://syntology.ai/paper/2308.02753","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.02753"}},"official":null}}],"record_sha256":"e84fc205015fdace6d82b1ea3b06c1a9b0f0a68c9791ef82bb07bfbec98b9a59","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}