{"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/transfer-learning/papers/ran/1","list_of":"/task/transfer-learning","task":"Transfer 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":7,"rows_per_page":100,"rows":[1,100],"of":692,"counts":{"archive_papers_tagged":10307,"with_a_code_link":3502,"where_syntology_ran_a_sample":692,"not_listed_spam_title":0,"listed":10307,"listed_where_code_ran":692,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":563,"every_run_a_failure_of_syntologys_instrument":129,"listed_with_a_run_with_no_instrument_failure":563,"listed_every_run_a_failure_of_syntologys_instrument":129,"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/transfer-learning/papers/ran/1","prev":null,"next":"/task/transfer-learning/papers/ran/2","papers":[{"url":"/paper/agent-kb-leveraging-cross-domain-experience","slug":"agent-kb-leveraging-cross-domain-experience","title":"Agent KB: Leveraging Cross-Domain Experience for Agentic Problem Solving","date":"2025-07-08","arxiv_id":"2507.06229","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/agent-kb-leveraging-cross-domain-experience#ran","syntology_url":"https://syntology.ai/paper/2507.06229","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2507.06229"}},"official":{"repos":["oppo-personalai/agent-kb"],"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/adjustment-for-confounding-using-pre-trained","slug":"adjustment-for-confounding-using-pre-trained","title":"Adjustment for Confounding using Pre-Trained Representations","date":"2025-06-17","arxiv_id":"2506.14329","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":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adjustment-for-confounding-using-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2506.14329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.14329"}},"official":{"repos":["rickmer-schulte/pretrained-causal-adjust"],"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/the-catechol-benchmark-time-series-solvent","slug":"the-catechol-benchmark-time-series-solvent","title":"The Catechol Benchmark: Time-series Solvent Selection Data for Few-shot Machine Learning","date":"2025-06-09","arxiv_id":"2506.07619","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-catechol-benchmark-time-series-solvent#ran","syntology_url":"https://syntology.ai/paper/2506.07619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.07619"}},"official":{"repos":["jpfolch/catechol_solvent_selection"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/taxadiffusion-progressively-trained-diffusion","slug":"taxadiffusion-progressively-trained-diffusion","title":"TaxaDiffusion: Progressively Trained Diffusion Model for Fine-Grained Species Generation","date":"2025-06-02","arxiv_id":"2506.01923","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/taxadiffusion-progressively-trained-diffusion#ran","syntology_url":"https://syntology.ai/paper/2506.01923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.01923"}},"official":{"repos":["aminK8/TaxaDiffusion"],"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/conformal-prediction-for-zero-shot-models","slug":"conformal-prediction-for-zero-shot-models","title":"Conformal Prediction for Zero-Shot Models","date":"2025-05-30","arxiv_id":"2505.24693","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/conformal-prediction-for-zero-shot-models#ran","syntology_url":"https://syntology.ai/paper/2505.24693","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.24693"}},"official":{"repos":["jusiro/clip-conformal"],"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/scalable-graph-generative-modeling-via","slug":"scalable-graph-generative-modeling-via","title":"Scalable Graph Generative Modeling via Substructure Sequences","date":"2025-05-22","arxiv_id":"2505.16130","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":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-graph-generative-modeling-via#ran","syntology_url":"https://syntology.ai/paper/2505.16130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16130"}},"official":{"repos":["zehong-wang/g2pm"],"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/neural-incompatibility-the-unbridgeable-gap","slug":"neural-incompatibility-the-unbridgeable-gap","title":"Neural Incompatibility: The Unbridgeable Gap of Cross-Scale Parametric Knowledge Transfer in Large Language Models","date":"2025-05-20","arxiv_id":"2505.14436","repositories_listed":1,"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/neural-incompatibility-the-unbridgeable-gap#ran","syntology_url":"https://syntology.ai/paper/2505.14436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.14436"}},"official":{"repos":["trae1oung/neural_incompatibility"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/logos-as-a-well-tempered-pre-train-for-sign","slug":"logos-as-a-well-tempered-pre-train-for-sign","title":"Logos as a Well-Tempered Pre-train for Sign Language Recognition","date":"2025-05-15","arxiv_id":"2505.10481","repositories_listed":0,"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/logos-as-a-well-tempered-pre-train-for-sign#ran","syntology_url":"https://syntology.ai/paper/2505.10481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.10481"}},"official":null}},{"url":"/paper/contrastive-cross-course-knowledge-tracing","slug":"contrastive-cross-course-knowledge-tracing","title":"Contrastive Cross-Course Knowledge Tracing via Concept Graph Guided Knowledge Transfer","date":"2025-05-14","arxiv_id":"2505.13489","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":5,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 5 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) · 2 unverified","sample_list":"/paper/contrastive-cross-course-knowledge-tracing#ran","syntology_url":"https://syntology.ai/paper/2505.13489","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.13489"}},"official":{"repos":["dqyzhwk/transkt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/noesis-differentially-private-knowledge","slug":"noesis-differentially-private-knowledge","title":"NoEsis: Differentially Private Knowledge Transfer in Modular LLM Adaptation","date":"2025-04-25","arxiv_id":"2504.18147","repositories_listed":0,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/noesis-differentially-private-knowledge#ran","syntology_url":"https://syntology.ai/paper/2504.18147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.18147"}},"official":null}},{"url":"/paper/chexworld-exploring-image-world-modeling-for","slug":"chexworld-exploring-image-world-modeling-for","title":"CheXWorld: Exploring Image World Modeling for Radiograph Representation Learning","date":"2025-04-18","arxiv_id":"2504.13820","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":4,"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/chexworld-exploring-image-world-modeling-for#ran","syntology_url":"https://syntology.ai/paper/2504.13820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.13820"}},"official":{"repos":["LeapLabTHU/CheXWorld"],"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/the-impact-of-model-zoo-size-and-composition","slug":"the-impact-of-model-zoo-size-and-composition","title":"The Impact of Model Zoo Size and Composition on Weight Space Learning","date":"2025-04-14","arxiv_id":"2504.10141","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/the-impact-of-model-zoo-size-and-composition#ran","syntology_url":"https://syntology.ai/paper/2504.10141","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.10141"}},"official":{"repos":["hsg-aiml/multizoo-sane"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/mige-a-unified-framework-for-multimodal","slug":"mige-a-unified-framework-for-multimodal","title":"MIGE: A Unified Framework for Multimodal Instruction-Based Image Generation and Editing","date":"2025-02-28","arxiv_id":"2502.21291","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":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mige-a-unified-framework-for-multimodal#ran","syntology_url":"https://syntology.ai/paper/2502.21291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.21291"}},"official":{"repos":["eureka-maggie/mige"],"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/graphbridge-towards-arbitrary-transfer","slug":"graphbridge-towards-arbitrary-transfer","title":"GraphBridge: Towards Arbitrary Transfer Learning in GNNs","date":"2025-02-26","arxiv_id":"2502.19252","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":4,"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/graphbridge-towards-arbitrary-transfer#ran","syntology_url":"https://syntology.ai/paper/2502.19252","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19252"}},"official":{"repos":["jujulili888/graphbridge"],"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/can-rlhf-be-more-efficient-with-imperfect","slug":"can-rlhf-be-more-efficient-with-imperfect","title":"Can RLHF be More Efficient with Imperfect Reward Models? A Policy Coverage Perspective","date":"2025-02-26","arxiv_id":"2502.19255","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/can-rlhf-be-more-efficient-with-imperfect#ran","syntology_url":"https://syntology.ai/paper/2502.19255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19255"}},"official":{"repos":["jiaweihhuang/rlhf_rewardtransfer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community"]}}},{"url":"/paper/instance-dependent-early-stopping","slug":"instance-dependent-early-stopping","title":"Instance-dependent Early Stopping","date":"2025-02-11","arxiv_id":"2502.07547","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/instance-dependent-early-stopping#ran","syntology_url":"https://syntology.ai/paper/2502.07547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.07547"}},"official":{"repos":["tmllab/2025_ICLR_IES"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-theoretical-framework-for-data-efficient","slug":"a-theoretical-framework-for-data-efficient","title":"A Theoretical Framework for Data Efficient Multi-Source Transfer Learning Based on Cramér-Rao Bound","date":"2025-02-06","arxiv_id":"2502.04242","repositories_listed":0,"syntology":{"n":6,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"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) · 5 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/a-theoretical-framework-for-data-efficient#ran","syntology_url":"https://syntology.ai/paper/2502.04242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.04242"}},"official":null}},{"url":"/paper/lightspeed-geometric-dataset-distance-via","slug":"lightspeed-geometric-dataset-distance-via","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","date":"2025-01-31","arxiv_id":"2501.18901","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lightspeed-geometric-dataset-distance-via#ran","syntology_url":"https://syntology.ai/paper/2501.18901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.18901"}},"official":{"repos":["hainn2803/s-otdd"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/universal-image-restoration-pre-training-via","slug":"universal-image-restoration-pre-training-via","title":"Universal Image Restoration Pre-training via Degradation Classification","date":"2025-01-26","arxiv_id":"2501.15510","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":2,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"5 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/universal-image-restoration-pre-training-via#ran","syntology_url":"https://syntology.ai/paper/2501.15510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.15510"}},"official":{"repos":["milab-pku/dcpt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/uni-sign-toward-unified-sign-language","slug":"uni-sign-toward-unified-sign-language","title":"Uni-Sign: Toward Unified Sign Language Understanding at Scale","date":"2025-01-25","arxiv_id":"2501.15187","repositories_listed":1,"syntology":{"n":15,"n_ran":14,"n_constructed":8,"n_ran_checked":10,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":8,"n_pointer_only":15,"phrase":"14 ran (of which 8 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/uni-sign-toward-unified-sign-language#ran","syntology_url":"https://syntology.ai/paper/2501.15187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.15187"}},"official":{"repos":["zechengli19/uni-sign"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":8,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/how-well-do-supervised-3d-models-transfer-to","slug":"how-well-do-supervised-3d-models-transfer-to","title":"How Well Do Supervised 3D Models Transfer to Medical Imaging Tasks?","date":"2025-01-20","arxiv_id":"2501.11253","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-well-do-supervised-3d-models-transfer-to#ran","syntology_url":"https://syntology.ai/paper/2501.11253","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.11253"}},"official":{"repos":["mrgiovanni/suprem"],"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/densely-connected-parameter-efficient-tuning","slug":"densely-connected-parameter-efficient-tuning","title":"Densely Connected Parameter-Efficient Tuning for Referring Image Segmentation","date":"2025-01-15","arxiv_id":"2501.08580","repositories_listed":1,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":8,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"13 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; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/densely-connected-parameter-efficient-tuning#ran","syntology_url":"https://syntology.ai/paper/2501.08580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.08580"}},"official":{"repos":["jiaqihuang01/detris"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/super-class-guided-transformer-for-zero-shot","slug":"super-class-guided-transformer-for-zero-shot","title":"Super-class guided Transformer for Zero-Shot Attribute Classification","date":"2025-01-10","arxiv_id":"2501.05728","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/super-class-guided-transformer-for-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2501.05728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.05728"}},"official":{"repos":["mlvlab/SugaFormer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["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-wander-through-the-multimodal-landscape","slug":"a-wander-through-the-multimodal-landscape","title":"A Wander Through the Multimodal Landscape: Efficient Transfer Learning via Low-rank Sequence Multimodal Adapter","date":"2024-12-12","arxiv_id":"2412.08979","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-wander-through-the-multimodal-landscape#ran","syntology_url":"https://syntology.ai/paper/2412.08979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.08979"}},"official":{"repos":["zrguo/Wander"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/monte-carlo-tree-search-based-space-transfer","slug":"monte-carlo-tree-search-based-space-transfer","title":"Monte Carlo Tree Search based Space Transfer for Black-box Optimization","date":"2024-12-10","arxiv_id":"2412.07186","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":5,"n_instrument":8,"n_unverified":3,"n_honours":3,"n_violates":1,"n_no_contract":1,"n_pointer_only":16,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 1 violated, 1 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/monte-carlo-tree-search-based-space-transfer#ran","syntology_url":"https://syntology.ai/paper/2412.07186","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.07186"}},"official":{"repos":["lamda-bbo/mcts-transfer"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/t-time-test-time-information-maximization","slug":"t-time-test-time-information-maximization","title":"T-TIME: Test-Time Information Maximization Ensemble for Plug-and-Play BCIs","date":"2024-12-10","arxiv_id":"2412.07228","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":3,"n_no_contract":0,"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, 3 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/t-time-test-time-information-maximization#ran","syntology_url":"https://syntology.ai/paper/2412.07228","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.07228"}},"official":{"repos":["sylyoung/DeepTransferEEG"],"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/textit-revelio-interpreting-and-leveraging","slug":"textit-revelio-interpreting-and-leveraging","title":"$\\textit{Revelio}$: Interpreting and leveraging semantic information in diffusion models","date":"2024-11-23","arxiv_id":"2411.16725","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":1,"n_no_contract":3,"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, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/textit-revelio-interpreting-and-leveraging#ran","syntology_url":"https://syntology.ai/paper/2411.16725","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.16725"}},"official":{"repos":["revelio-diffusion/revelio"],"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","unlocated"]}}},{"url":"/paper/llm-neo-parameter-efficient-knowledge","slug":"llm-neo-parameter-efficient-knowledge","title":"LLM-Neo: Parameter Efficient Knowledge Distillation for Large Language Models","date":"2024-11-11","arxiv_id":"2411.06839","repositories_listed":2,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"12 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/llm-neo-parameter-efficient-knowledge#ran","syntology_url":"https://syntology.ai/paper/2411.06839","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.06839"}},"official":null}},{"url":"/paper/mutaplm-protein-language-modeling-for","slug":"mutaplm-protein-language-modeling-for","title":"MutaPLM: Protein Language Modeling for Mutation Explanation and Engineering","date":"2024-10-30","arxiv_id":"2410.22949","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":7,"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) · 3 unverified","sample_list":"/paper/mutaplm-protein-language-modeling-for#ran","syntology_url":"https://syntology.ai/paper/2410.22949","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22949"}},"official":{"repos":["pharmolix/mutaplm"],"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":["listed","official"]}}},{"url":"/paper/st-moe-bert-a-spatial-temporal-mixture-of","slug":"st-moe-bert-a-spatial-temporal-mixture-of","title":"ST-MoE-BERT: A Spatial-Temporal Mixture-of-Experts Framework for Long-Term Cross-City Mobility Prediction","date":"2024-10-18","arxiv_id":"2410.14099","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/st-moe-bert-a-spatial-temporal-mixture-of#ran","syntology_url":"https://syntology.ai/paper/2410.14099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.14099"}},"official":{"repos":["he-h/HuMob"],"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/transagent-transfer-vision-language","slug":"transagent-transfer-vision-language","title":"TransAgent: Transfer Vision-Language Foundation Models with Heterogeneous Agent Collaboration","date":"2024-10-16","arxiv_id":"2410.12183","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"6 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/transagent-transfer-vision-language#ran","syntology_url":"https://syntology.ai/paper/2410.12183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.12183"}},"official":{"repos":["markywg/transagent"],"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/mote-reconciling-generalization-with","slug":"mote-reconciling-generalization-with","title":"MoTE: Reconciling Generalization with Specialization for Visual-Language to Video Knowledge Transfer","date":"2024-10-14","arxiv_id":"2410.10589","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":1,"n_ran_checked":4,"n_instrument":4,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"8 ran (of which 1 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) · 4 unverified","sample_list":"/paper/mote-reconciling-generalization-with#ran","syntology_url":"https://syntology.ai/paper/2410.10589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10589"}},"official":{"repos":["zmhh-h/mote"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/more-experts-than-galaxies-conditionally","slug":"more-experts-than-galaxies-conditionally","title":"More Experts Than Galaxies: Conditionally-overlapping Experts With Biologically-Inspired Fixed Routing","date":"2024-10-10","arxiv_id":"2410.08003","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/more-experts-than-galaxies-conditionally#ran","syntology_url":"https://syntology.ai/paper/2410.08003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.08003"}},"official":{"repos":["shaier/comet"],"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/seg2act-global-context-aware-action","slug":"seg2act-global-context-aware-action","title":"Seg2Act: Global Context-aware Action Generation for Document Logical Structuring","date":"2024-10-09","arxiv_id":"2410.06802","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":2,"n_ran_checked":2,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"7 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/seg2act-global-context-aware-action#ran","syntology_url":"https://syntology.ai/paper/2410.06802","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06802"}},"official":{"repos":["cascip/seg2act"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-interpretable-hierarchical-dynamical","slug":"learning-interpretable-hierarchical-dynamical","title":"Learning Interpretable Hierarchical Dynamical Systems Models from Time Series Data","date":"2024-10-07","arxiv_id":"2410.04814","repositories_listed":0,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 1 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/learning-interpretable-hierarchical-dynamical#ran","syntology_url":"https://syntology.ai/paper/2410.04814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04814"}},"official":null}},{"url":"/paper/maskllm-learnable-semi-structured-sparsity","slug":"maskllm-learnable-semi-structured-sparsity","title":"MaskLLM: Learnable Semi-Structured Sparsity for Large Language Models","date":"2024-09-26","arxiv_id":"2409.17481","repositories_listed":1,"syntology":{"n":16,"n_ran":5,"n_constructed":1,"n_ran_checked":5,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":16,"phrase":"5 ran (of which 1 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) · 11 unverified","sample_list":"/paper/maskllm-learnable-semi-structured-sparsity#ran","syntology_url":"https://syntology.ai/paper/2409.17481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17481"}},"official":{"repos":["nvlabs/maskllm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":5,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/graphlora-structure-aware-contrastive-low","slug":"graphlora-structure-aware-contrastive-low","title":"GraphLoRA: Structure-Aware Contrastive Low-Rank Adaptation for Cross-Graph Transfer Learning","date":"2024-09-25","arxiv_id":"2409.16670","repositories_listed":1,"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":4,"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/graphlora-structure-aware-contrastive-low#ran","syntology_url":"https://syntology.ai/paper/2409.16670","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.16670"}},"official":{"repos":["allminerlab/graphlora"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mapper-multimodal-prior-guided-parameter","slug":"mapper-multimodal-prior-guided-parameter","title":"MaPPER: Multimodal Prior-guided Parameter Efficient Tuning for Referring Expression Comprehension","date":"2024-09-20","arxiv_id":"2409.13609","repositories_listed":1,"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":9,"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/mapper-multimodal-prior-guided-parameter#ran","syntology_url":"https://syntology.ai/paper/2409.13609","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.13609"}},"official":{"repos":["liuting20/mapper"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/omnigen-unified-image-generation","slug":"omnigen-unified-image-generation","title":"OmniGen: Unified Image Generation","date":"2024-09-17","arxiv_id":"2409.11340","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/omnigen-unified-image-generation#ran","syntology_url":"https://syntology.ai/paper/2409.11340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.11340"}},"official":{"repos":["vectorspacelab/omnigen"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-t05-system-for-the-voicemos-challenge","slug":"the-t05-system-for-the-voicemos-challenge","title":"The T05 System for The VoiceMOS Challenge 2024: Transfer Learning from Deep Image Classifier to Naturalness MOS Prediction of High-Quality Synthetic Speech","date":"2024-09-14","arxiv_id":"2409.09305","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/the-t05-system-for-the-voicemos-challenge#ran","syntology_url":"https://syntology.ai/paper/2409.09305","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.09305"}},"official":{"repos":["sarulab-speech/utmosv2"],"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/data-efficient-child-adult-speaker","slug":"data-efficient-child-adult-speaker","title":"Data Efficient Child-Adult Speaker Diarization with Simulated Conversations","date":"2024-09-13","arxiv_id":"2409.08881","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/data-efficient-child-adult-speaker#ran","syntology_url":"https://syntology.ai/paper/2409.08881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.08881"}},"official":{"repos":["usc-sail/child-adult-diarization"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-learning-with-synthetic-positives","slug":"contrastive-learning-with-synthetic-positives","title":"Contrastive Learning with Synthetic Positives","date":"2024-08-30","arxiv_id":"2408.16965","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/contrastive-learning-with-synthetic-positives#ran","syntology_url":"https://syntology.ai/paper/2408.16965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.16965"}},"official":{"repos":["dewenzeng/clsp"],"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":["unlocated"]}}},{"url":"/paper/theoretical-insights-into-overparameterized","slug":"theoretical-insights-into-overparameterized","title":"Theoretical Insights into Overparameterized Models in Multi-Task and Replay-Based Continual Learning","date":"2024-08-29","arxiv_id":"2408.16939","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/theoretical-insights-into-overparameterized#ran","syntology_url":"https://syntology.ai/paper/2408.16939","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.16939"}},"official":{"repos":["aminbana/MTL-Theory"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/llava-mod-making-llava-tiny-via-moe-knowledge","slug":"llava-mod-making-llava-tiny-via-moe-knowledge","title":"LLaVA-MoD: Making LLaVA Tiny via MoE Knowledge Distillation","date":"2024-08-28","arxiv_id":"2408.15881","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/llava-mod-making-llava-tiny-via-moe-knowledge#ran","syntology_url":"https://syntology.ai/paper/2408.15881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.15881"}},"official":{"repos":["shufangxun/llava-mod"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/advancing-adversarial-suffix-transfer","slug":"advancing-adversarial-suffix-transfer","title":"Advancing Adversarial Suffix Transfer Learning on Aligned Large Language Models","date":"2024-08-27","arxiv_id":"2408.14866","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":3,"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/advancing-adversarial-suffix-transfer#ran","syntology_url":"https://syntology.ai/paper/2408.14866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.14866"}},"official":{"repos":["Waffle-Liu/DeGCG"],"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/tasl-continual-dialog-state-tracking-via-task","slug":"tasl-continual-dialog-state-tracking-via-task","title":"TaSL: Continual Dialog State Tracking via Task Skill Localization and Consolidation","date":"2024-08-19","arxiv_id":"2408.09857","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/tasl-continual-dialog-state-tracking-via-task#ran","syntology_url":"https://syntology.ai/paper/2408.09857","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.09857"}},"official":{"repos":["WoodScene/TaSL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-transfer-learning-via","slug":"unsupervised-transfer-learning-via","title":"Unsupervised Transfer Learning via Adversarial Contrastive Training","date":"2024-08-16","arxiv_id":"2408.08533","repositories_listed":0,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/unsupervised-transfer-learning-via#ran","syntology_url":"https://syntology.ai/paper/2408.08533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.08533"}},"official":null}},{"url":"/paper/slca-unleash-the-power-of-sequential-fine","slug":"slca-unleash-the-power-of-sequential-fine","title":"SLCA++: Unleash the Power of Sequential Fine-tuning for Continual Learning with Pre-training","date":"2024-08-15","arxiv_id":"2408.08295","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/slca-unleash-the-power-of-sequential-fine#ran","syntology_url":"https://syntology.ai/paper/2408.08295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.08295"}},"official":{"repos":["gengdavid/slca"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/badmerging-backdoor-attacks-against-model","slug":"badmerging-backdoor-attacks-against-model","title":"BadMerging: Backdoor Attacks Against Model Merging","date":"2024-08-14","arxiv_id":"2408.07362","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/badmerging-backdoor-attacks-against-model#ran","syntology_url":"https://syntology.ai/paper/2408.07362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07362"}},"official":{"repos":["jzhang538/badmerging"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ecg-fm-an-open-electrocardiogram-foundation","slug":"ecg-fm-an-open-electrocardiogram-foundation","title":"ECG-FM: An Open Electrocardiogram Foundation Model","date":"2024-08-09","arxiv_id":"2408.05178","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ecg-fm-an-open-electrocardiogram-foundation#ran","syntology_url":"https://syntology.ai/paper/2408.05178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.05178"}},"official":{"repos":["bowang-lab/ecg-fm","jwoo5/fairseq-signals"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/model-based-transfer-learning-for-contextual","slug":"model-based-transfer-learning-for-contextual","title":"Model-Based Transfer Learning for Contextual Reinforcement Learning","date":"2024-08-08","arxiv_id":"2408.04498","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/model-based-transfer-learning-for-contextual#ran","syntology_url":"https://syntology.ai/paper/2408.04498","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.04498"}},"official":{"repos":["jhoon-cho/mbtl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/scaling-backwards-minimal-synthetic-pre","slug":"scaling-backwards-minimal-synthetic-pre","title":"Scaling Backwards: Minimal Synthetic Pre-training?","date":"2024-08-01","arxiv_id":"2408.00677","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/scaling-backwards-minimal-synthetic-pre#ran","syntology_url":"https://syntology.ai/paper/2408.00677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.00677"}},"official":{"repos":["super-tadory/1p-frac"],"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/detached-and-interactive-multimodal-learning","slug":"detached-and-interactive-multimodal-learning","title":"Detached and Interactive Multimodal Learning","date":"2024-07-28","arxiv_id":"2407.19514","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":10,"phrase":"6 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/detached-and-interactive-multimodal-learning#ran","syntology_url":"https://syntology.ai/paper/2407.19514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.19514"}},"official":{"repos":["fanyunfeng-bit/di-mml"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/learn-from-the-learnt-source-free-active","slug":"learn-from-the-learnt-source-free-active","title":"Learn from the Learnt: Source-Free Active Domain Adaptation via Contrastive Sampling and Visual Persistence","date":"2024-07-26","arxiv_id":"2407.18899","repositories_listed":0,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":2,"n_honours":0,"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; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learn-from-the-learnt-source-free-active#ran","syntology_url":"https://syntology.ai/paper/2407.18899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.18899"}},"official":null}},{"url":"/paper/abdomenatlas-a-large-scale-detailed-annotated","slug":"abdomenatlas-a-large-scale-detailed-annotated","title":"AbdomenAtlas: A Large-Scale, Detailed-Annotated, & Multi-Center Dataset for Efficient Transfer Learning and Open Algorithmic Benchmarking","date":"2024-07-23","arxiv_id":"2407.16697","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/abdomenatlas-a-large-scale-detailed-annotated#ran","syntology_url":"https://syntology.ai/paper/2407.16697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.16697"}},"official":{"repos":["mrgiovanni/abdomenatlas","mrgiovanni/suprem"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/encapsulating-knowledge-in-one-prompt","slug":"encapsulating-knowledge-in-one-prompt","title":"Encapsulating Knowledge in One Prompt","date":"2024-07-16","arxiv_id":"2407.11902","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":11,"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) · 3 unverified","sample_list":"/paper/encapsulating-knowledge-in-one-prompt#ran","syntology_url":"https://syntology.ai/paper/2407.11902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.11902"}},"official":{"repos":["liqiiiii/encapsulating-knowledge-in-one-prompt"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/accessing-vision-foundation-models-at","slug":"accessing-vision-foundation-models-at","title":"Accessing Vision Foundation Models at ImageNet-level Costs","date":"2024-07-15","arxiv_id":"2407.10366","repositories_listed":1,"syntology":{"n":10,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/accessing-vision-foundation-models-at#ran","syntology_url":"https://syntology.ai/paper/2407.10366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10366"}},"official":{"repos":["bespontaneous/proteus-pytorch"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/reprogramming-distillation-for-medical","slug":"reprogramming-distillation-for-medical","title":"Reprogramming Distillation for Medical Foundation Models","date":"2024-07-09","arxiv_id":"2407.06504","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":2,"n_honours":0,"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; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/reprogramming-distillation-for-medical#ran","syntology_url":"https://syntology.ai/paper/2407.06504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.06504"}},"official":{"repos":["MediaBrain-SJTU/RD"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-composition-using-task-vectors-with","slug":"knowledge-composition-using-task-vectors-with","title":"Knowledge Composition using Task Vectors with Learned Anisotropic Scaling","date":"2024-07-03","arxiv_id":"2407.02880","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/knowledge-composition-using-task-vectors-with#ran","syntology_url":"https://syntology.ai/paper/2407.02880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02880"}},"official":{"repos":["fredzzhang/atlas"],"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/learning-from-memory-non-parametric-memory","slug":"learning-from-memory-non-parametric-memory","title":"Learning from Memory: Non-Parametric Memory Augmented Self-Supervised Learning of Visual Features","date":"2024-07-03","arxiv_id":"2407.17486","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-from-memory-non-parametric-memory#ran","syntology_url":"https://syntology.ai/paper/2407.17486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.17486"}},"official":{"repos":["sthalles/massl"],"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/t-free-tokenizer-free-generative-llms-via","slug":"t-free-tokenizer-free-generative-llms-via","title":"T-FREE: Subword Tokenizer-Free Generative LLMs via Sparse Representations for Memory-Efficient Embeddings","date":"2024-06-27","arxiv_id":"2406.19223","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"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) · 2 unverified","sample_list":"/paper/t-free-tokenizer-free-generative-llms-via#ran","syntology_url":"https://syntology.ai/paper/2406.19223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.19223"}},"official":{"repos":["aleph-alpha/trigrams"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/routellm-learning-to-route-llms-with","slug":"routellm-learning-to-route-llms-with","title":"RouteLLM: Learning to Route LLMs with Preference Data","date":"2024-06-26","arxiv_id":"2406.18665","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/routellm-learning-to-route-llms-with#ran","syntology_url":"https://syntology.ai/paper/2406.18665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18665"}},"official":{"repos":["lm-sys/routellm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/goal-a-generalist-combinatorial-optimization","slug":"goal-a-generalist-combinatorial-optimization","title":"GOAL: A Generalist Combinatorial Optimization Agent Learning","date":"2024-06-21","arxiv_id":"2406.15079","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":7,"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/goal-a-generalist-combinatorial-optimization#ran","syntology_url":"https://syntology.ai/paper/2406.15079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15079"}},"official":{"repos":["naver/goal-co"],"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/flat-posterior-does-matter-for-bayesian","slug":"flat-posterior-does-matter-for-bayesian","title":"Flat Posterior Does Matter For Bayesian Model Averaging","date":"2024-06-21","arxiv_id":"2406.15664","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/flat-posterior-does-matter-for-bayesian#ran","syntology_url":"https://syntology.ai/paper/2406.15664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15664"}},"official":{"repos":["mlai-yonsei/sa-bma"],"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/llm4cp-adapting-large-language-models-for","slug":"llm4cp-adapting-large-language-models-for","title":"LLM4CP: Adapting Large Language Models for Channel Prediction","date":"2024-06-20","arxiv_id":"2406.14440","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":8,"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/llm4cp-adapting-large-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2406.14440","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14440"}},"official":{"repos":["liuboxun/LLM4CP"],"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/do-multimodal-foundation-models-understand","slug":"do-multimodal-foundation-models-understand","title":"WONDERBREAD: A Benchmark for Evaluating Multimodal Foundation Models on Business Process Management Tasks","date":"2024-06-19","arxiv_id":"2406.13264","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":12,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/do-multimodal-foundation-models-understand#ran","syntology_url":"https://syntology.ai/paper/2406.13264","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.13264"}},"official":{"repos":["hazyresearch/wonderbread"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neuro-symbolic-training-for-reasoning-over","slug":"neuro-symbolic-training-for-reasoning-over","title":"Neuro-symbolic Training for Reasoning over Spatial Language","date":"2024-06-19","arxiv_id":"2406.13828","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":0,"n_no_contract":7,"n_pointer_only":9,"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) · 2 unverified","sample_list":"/paper/neuro-symbolic-training-for-reasoning-over#ran","syntology_url":"https://syntology.ai/paper/2406.13828","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.13828"}},"official":{"repos":["premsrit/SPARTUNQChain"],"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/bioscan-5m-a-multimodal-dataset-for-insect","slug":"bioscan-5m-a-multimodal-dataset-for-insect","title":"BIOSCAN-5M: A Multimodal Dataset for Insect Biodiversity","date":"2024-06-18","arxiv_id":"2406.12723","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bioscan-5m-a-multimodal-dataset-for-insect#ran","syntology_url":"https://syntology.ai/paper/2406.12723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12723"}},"official":{"repos":["bioscan-ml/dataset"],"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":["named_in_paper","official"]}}},{"url":"/paper/large-scale-transfer-learning-for-tabular","slug":"large-scale-transfer-learning-for-tabular","title":"Large Scale Transfer Learning for Tabular Data via Language Modeling","date":"2024-06-17","arxiv_id":"2406.12031","repositories_listed":2,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/large-scale-transfer-learning-for-tabular#ran","syntology_url":"https://syntology.ai/paper/2406.12031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12031"}},"official":{"repos":["mlfoundations/rtfm","mlfoundations/tabliblib"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/uniglm-training-one-unified-language-model","slug":"uniglm-training-one-unified-language-model","title":"UniGLM: Training One Unified Language Model for Text-Attributed Graph Embedding","date":"2024-06-17","arxiv_id":"2406.12052","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/uniglm-training-one-unified-language-model#ran","syntology_url":"https://syntology.ai/paper/2406.12052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12052"}},"official":{"repos":["nyushcs/uniglm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/sharelora-parameter-efficient-and-robust","slug":"sharelora-parameter-efficient-and-robust","title":"ShareLoRA: Parameter Efficient and Robust Large Language Model Fine-tuning via Shared Low-Rank Adaptation","date":"2024-06-16","arxiv_id":"2406.10785","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sharelora-parameter-efficient-and-robust#ran","syntology_url":"https://syntology.ai/paper/2406.10785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10785"}},"official":{"repos":["Rain9876/ShareLoRA"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-effectiveness-of-supervision-in","slug":"on-the-effectiveness-of-supervision-in","title":"On the Effectiveness of Supervision in Asymmetric Non-Contrastive Learning","date":"2024-06-16","arxiv_id":"2406.10815","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":1,"n_ran_checked":1,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"6 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; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/on-the-effectiveness-of-supervision-in#ran","syntology_url":"https://syntology.ai/paper/2406.10815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10815"}},"official":{"repos":["jh-oh-23/sup-ancl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/strategies-for-pretraining-neural-operators","slug":"strategies-for-pretraining-neural-operators","title":"Strategies for Pretraining Neural Operators","date":"2024-06-12","arxiv_id":"2406.08473","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/strategies-for-pretraining-neural-operators#ran","syntology_url":"https://syntology.ai/paper/2406.08473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08473"}},"official":{"repos":["anthonyzhou-1/pretraining_pdes"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/bertaqa-how-much-do-language-models-know","slug":"bertaqa-how-much-do-language-models-know","title":"BertaQA: How Much Do Language Models Know About Local Culture?","date":"2024-06-11","arxiv_id":"2406.07302","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"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) · 4 unverified","sample_list":"/paper/bertaqa-how-much-do-language-models-know#ran","syntology_url":"https://syntology.ai/paper/2406.07302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07302"}},"official":{"repos":["juletx/bertaqa"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/msagpt-neural-prompting-protein-structure","slug":"msagpt-neural-prompting-protein-structure","title":"MSAGPT: Neural Prompting Protein Structure Prediction via MSA Generative Pre-Training","date":"2024-06-08","arxiv_id":"2406.05347","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/msagpt-neural-prompting-protein-structure#ran","syntology_url":"https://syntology.ai/paper/2406.05347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05347"}},"official":{"repos":["thudm/msagpt"],"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/leveraging-predicate-and-triplet-learning-for","slug":"leveraging-predicate-and-triplet-learning-for","title":"Leveraging Predicate and Triplet Learning for Scene Graph Generation","date":"2024-06-04","arxiv_id":"2406.02038","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/leveraging-predicate-and-triplet-learning-for#ran","syntology_url":"https://syntology.ai/paper/2406.02038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02038"}},"official":{"repos":["jkli1998/drm"],"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/randomized-geometric-algebra-methods-for","slug":"randomized-geometric-algebra-methods-for","title":"Randomized Geometric Algebra Methods for Convex Neural Networks","date":"2024-06-04","arxiv_id":"2406.02806","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/randomized-geometric-algebra-methods-for#ran","syntology_url":"https://syntology.ai/paper/2406.02806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02806"}},"official":{"repos":["pilancilab/Randomized-Geometric-Algebra-Methods-for-Convex-Neural-Networks"],"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/disentangling-and-mitigating-the-impact-of","slug":"disentangling-and-mitigating-the-impact-of","title":"Disentangling and Mitigating the Impact of Task Similarity for Continual Learning","date":"2024-05-30","arxiv_id":"2405.20236","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"4 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/disentangling-and-mitigating-the-impact-of#ran","syntology_url":"https://syntology.ai/paper/2405.20236","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20236"}},"official":{"repos":["nhiratani/transfer_retention_model"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-zero-shot-facial-expression","slug":"enhancing-zero-shot-facial-expression","title":"Enhancing Zero-Shot Facial Expression Recognition by LLM Knowledge Transfer","date":"2024-05-29","arxiv_id":"2405.19100","repositories_listed":1,"syntology":{"n":10,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/enhancing-zero-shot-facial-expression#ran","syntology_url":"https://syntology.ai/paper/2405.19100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19100"}},"official":{"repos":["zengqunzhao/exp-clip"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/flashst-a-simple-and-universal-prompt-tuning","slug":"flashst-a-simple-and-universal-prompt-tuning","title":"FlashST: A Simple and Universal Prompt-Tuning Framework for Traffic Prediction","date":"2024-05-28","arxiv_id":"2405.17898","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 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; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/flashst-a-simple-and-universal-prompt-tuning#ran","syntology_url":"https://syntology.ai/paper/2405.17898","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17898"}},"official":{"repos":["hkuds/flashst"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-context-backdoor-attacks-against-graph","slug":"cross-context-backdoor-attacks-against-graph","title":"Cross-Context Backdoor Attacks against Graph Prompt Learning","date":"2024-05-28","arxiv_id":"2405.17984","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"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) · 5 unverified","sample_list":"/paper/cross-context-backdoor-attacks-against-graph#ran","syntology_url":"https://syntology.ai/paper/2405.17984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17984"}},"official":{"repos":["xtLyu/CrossBA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/logah-predicting-774-million-parameter","slug":"logah-predicting-774-million-parameter","title":"LoGAH: Predicting 774-Million-Parameter Transformers using Graph HyperNetworks with 1/100 Parameters","date":"2024-05-25","arxiv_id":"2405.16287","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/logah-predicting-774-million-parameter#ran","syntology_url":"https://syntology.ai/paper/2405.16287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16287"}},"official":{"repos":["blackzxy/logah"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fine-grained-image-to-lidar-contrastive","slug":"fine-grained-image-to-lidar-contrastive","title":"Fine-grained Image-to-LiDAR Contrastive Distillation with Visual Foundation Models","date":"2024-05-23","arxiv_id":"2405.14271","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/fine-grained-image-to-lidar-contrastive#ran","syntology_url":"https://syntology.ai/paper/2405.14271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14271"}},"official":{"repos":["eaphan/olivine"],"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/implicit-in-context-learning","slug":"implicit-in-context-learning","title":"Implicit In-context Learning","date":"2024-05-23","arxiv_id":"2405.14660","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"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; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/implicit-in-context-learning#ran","syntology_url":"https://syntology.ai/paper/2405.14660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14660"}},"official":{"repos":["lzvv123456/i2cl"],"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/overcoming-data-and-model-heterogeneities-in","slug":"overcoming-data-and-model-heterogeneities-in","title":"Overcoming Data and Model Heterogeneities in Decentralized Federated Learning via Synthetic Anchors","date":"2024-05-19","arxiv_id":"2405.11525","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/overcoming-data-and-model-heterogeneities-in#ran","syntology_url":"https://syntology.ai/paper/2405.11525","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.11525"}},"official":null}},{"url":"/paper/novel-class-discovery-for-ultra-fine-grained","slug":"novel-class-discovery-for-ultra-fine-grained","title":"Novel Class Discovery for Ultra-Fine-Grained Visual Categorization","date":"2024-05-10","arxiv_id":"2405.06283","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":9,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":13,"phrase":"12 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/novel-class-discovery-for-ultra-fine-grained#ran","syntology_url":"https://syntology.ai/paper/2405.06283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.06283"}},"official":{"repos":["ssdut-caiyq/ufg-ncd"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-models-for-cyber-security-a","slug":"large-language-models-for-cyber-security-a","title":"Large Language Models for Cyber Security: A Systematic Literature Review","date":"2024-05-08","arxiv_id":"2405.04760","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":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-language-models-for-cyber-security-a#ran","syntology_url":"https://syntology.ai/paper/2405.04760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04760"}},"official":{"repos":["hiyouga/llama-efficient-tuning"],"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/causality-pursuit-from-heterogeneous","slug":"causality-pursuit-from-heterogeneous","title":"Causality Pursuit from Heterogeneous Environments via Neural Adversarial Invariance Learning","date":"2024-05-07","arxiv_id":"2405.04715","repositories_listed":1,"syntology":{"n":23,"n_ran":19,"n_constructed":0,"n_ran_checked":18,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":18,"n_pointer_only":23,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 0 violated, 18 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/causality-pursuit-from-heterogeneous#ran","syntology_url":"https://syntology.ai/paper/2405.04715","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04715"}},"official":{"repos":["wmyw96/fair"],"state":"official (archive's flag): 19 ran","n_ran":19,"n_constructed":0,"n_ran_no_instrument_failure":18,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/cromss-cross-modal-pre-training-with-noisy","slug":"cromss-cross-modal-pre-training-with-noisy","title":"CromSS: Cross-modal pre-training with noisy labels for remote sensing image segmentation","date":"2024-05-02","arxiv_id":"2405.01217","repositories_listed":0,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"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; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cromss-cross-modal-pre-training-with-noisy#ran","syntology_url":"https://syntology.ai/paper/2405.01217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.01217"}},"official":null}},{"url":"/paper/efficient-remote-sensing-with-harmonized","slug":"efficient-remote-sensing-with-harmonized","title":"Efficient Remote Sensing with Harmonized Transfer Learning and Modality Alignment","date":"2024-04-28","arxiv_id":"2404.18253","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/efficient-remote-sensing-with-harmonized#ran","syntology_url":"https://syntology.ai/paper/2404.18253","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.18253"}},"official":{"repos":["seekerhuang/harma"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/opendlign-enhancing-open-world-3d-learning","slug":"opendlign-enhancing-open-world-3d-learning","title":"OpenDlign: Open-World Point Cloud Understanding with Depth-Aligned Images","date":"2024-04-25","arxiv_id":"2404.16538","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/opendlign-enhancing-open-world-3d-learning#ran","syntology_url":"https://syntology.ai/paper/2404.16538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.16538"}},"official":{"repos":["Yebulabula/OpenDlign"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/where-to-mask-structure-guided-masking-for","slug":"where-to-mask-structure-guided-masking-for","title":"Where to Mask: Structure-Guided Masking for Graph Masked Autoencoders","date":"2024-04-24","arxiv_id":"2404.15806","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":12,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/where-to-mask-structure-guided-masking-for#ran","syntology_url":"https://syntology.ai/paper/2404.15806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15806"}},"official":{"repos":["liuchuang0059/structmae"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/unified-unsupervised-salient-object-detection","slug":"unified-unsupervised-salient-object-detection","title":"Unified Unsupervised Salient Object Detection via Knowledge Transfer","date":"2024-04-23","arxiv_id":"2404.14759","repositories_listed":2,"syntology":{"n":19,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/unified-unsupervised-salient-object-detection#ran","syntology_url":"https://syntology.ai/paper/2404.14759","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.14759"}},"official":{"repos":["I2-Multimedia-Lab/A2S-v3"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/constructing-and-exploring-intermediate","slug":"constructing-and-exploring-intermediate","title":"Constructing and Exploring Intermediate Domains in Mixed Domain Semi-supervised Medical Image Segmentation","date":"2024-04-13","arxiv_id":"2404.08951","repositories_listed":1,"syntology":{"n":18,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":15,"n_pointer_only":7,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 2 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/constructing-and-exploring-intermediate#ran","syntology_url":"https://syntology.ai/paper/2404.08951","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08951"}},"official":{"repos":["mqinghe/midss"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pinnacle-pinn-adaptive-collocation-and","slug":"pinnacle-pinn-adaptive-collocation-and","title":"PINNACLE: PINN Adaptive ColLocation and Experimental points selection","date":"2024-04-11","arxiv_id":"2404.07662","repositories_listed":2,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"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) · 7 unverified","sample_list":"/paper/pinnacle-pinn-adaptive-collocation-and#ran","syntology_url":"https://syntology.ai/paper/2404.07662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.07662"}},"official":{"repos":["apivich-h/pinnacle"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/adapting-llama-decoder-to-vision-transformer","slug":"adapting-llama-decoder-to-vision-transformer","title":"Adapting LLaMA Decoder to Vision Transformer","date":"2024-04-10","arxiv_id":"2404.06773","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":8,"n_pointer_only":13,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 2 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adapting-llama-decoder-to-vision-transformer#ran","syntology_url":"https://syntology.ai/paper/2404.06773","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.06773"}},"official":{"repos":["techmonsterwang/illama"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multiflow-shifting-towards-task-agnostic","slug":"multiflow-shifting-towards-task-agnostic","title":"MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruning","date":"2024-04-08","arxiv_id":"2404.05621","repositories_listed":1,"syntology":{"n":27,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":19,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":27,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 19 unverified","sample_list":"/paper/multiflow-shifting-towards-task-agnostic#ran","syntology_url":"https://syntology.ai/paper/2404.05621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.05621"}},"official":{"repos":["farinamatteo/multiflow"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":19,"ran_from_kinds":["official"]}}},{"url":"/paper/teaching-llama-a-new-language-through-cross","slug":"teaching-llama-a-new-language-through-cross","title":"Teaching Llama a New Language Through Cross-Lingual Knowledge Transfer","date":"2024-04-05","arxiv_id":"2404.04042","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/teaching-llama-a-new-language-through-cross#ran","syntology_url":"https://syntology.ai/paper/2404.04042","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.04042"}},"official":{"repos":["tartunlp/llammas"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/disentangled-pre-training-for-human-object","slug":"disentangled-pre-training-for-human-object","title":"Disentangled Pre-training for Human-Object Interaction Detection","date":"2024-04-02","arxiv_id":"2404.01725","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/disentangled-pre-training-for-human-object#ran","syntology_url":"https://syntology.ai/paper/2404.01725","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.01725"}},"official":{"repos":["xingaoli/dp-hoi"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}}],"record_sha256":"5816996ac24b3f346dbde0e80029529f78669c79a1c017a6c976f30e27f53176","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}