{"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/model-selection/papers/ran/1","list_of":"/task/model-selection","task":"Model Selection","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":2,"rows_per_page":100,"rows":[1,100],"of":141,"counts":{"archive_papers_tagged":2050,"with_a_code_link":658,"where_syntology_ran_a_sample":141,"not_listed_spam_title":0,"listed":2050,"listed_where_code_ran":141,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":115,"every_run_a_failure_of_syntologys_instrument":26,"listed_with_a_run_with_no_instrument_failure":115,"listed_every_run_a_failure_of_syntologys_instrument":26,"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/model-selection/papers/ran/1","prev":null,"next":"/task/model-selection/papers/ran/2","papers":[{"url":"/paper/leveraging-predictive-equivalence-in-decision","slug":"leveraging-predictive-equivalence-in-decision","title":"Leveraging Predictive Equivalence in Decision Trees","date":"2025-06-17","arxiv_id":"2506.14143","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/leveraging-predictive-equivalence-in-decision#ran","syntology_url":"https://syntology.ai/paper/2506.14143","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.14143"}},"official":{"repos":["haydenmct/predictive-equivalence"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/router-r1-teaching-llms-multi-round-routing","slug":"router-r1-teaching-llms-multi-round-routing","title":"Router-R1: Teaching LLMs Multi-Round Routing and Aggregation via Reinforcement Learning","date":"2025-06-10","arxiv_id":"2506.09033","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/router-r1-teaching-llms-multi-round-routing#ran","syntology_url":"https://syntology.ai/paper/2506.09033","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.09033"}},"official":{"repos":["ulab-uiuc/router-r1"],"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/lensllm-unveiling-fine-tuning-dynamics-for","slug":"lensllm-unveiling-fine-tuning-dynamics-for","title":"LENSLLM: Unveiling Fine-Tuning Dynamics for LLM Selection","date":"2025-05-01","arxiv_id":"2505.03793","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":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lensllm-unveiling-fine-tuning-dynamics-for#ran","syntology_url":"https://syntology.ai/paper/2505.03793","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.03793"}},"official":{"repos":["susan571/lensllm"],"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/m-prometheus-a-suite-of-open-multilingual-llm","slug":"m-prometheus-a-suite-of-open-multilingual-llm","title":"M-Prometheus: A Suite of Open Multilingual LLM Judges","date":"2025-04-07","arxiv_id":"2504.04953","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":0,"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/m-prometheus-a-suite-of-open-multilingual-llm#ran","syntology_url":"https://syntology.ai/paper/2504.04953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.04953"}},"official":{"repos":["prometheus-eval/prometheus-eval"],"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/understanding-the-limits-of-deep-tabular","slug":"understanding-the-limits-of-deep-tabular","title":"Understanding the Limits of Deep Tabular Methods with Temporal Shift","date":"2025-02-27","arxiv_id":"2502.20260","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/understanding-the-limits-of-deep-tabular#ran","syntology_url":"https://syntology.ai/paper/2502.20260","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.20260"}},"official":null}},{"url":"/paper/extremely-greedy-equivalence-search","slug":"extremely-greedy-equivalence-search","title":"Extremely Greedy Equivalence Search","date":"2025-02-26","arxiv_id":"2502.19551","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/extremely-greedy-equivalence-search#ran","syntology_url":"https://syntology.ai/paper/2502.19551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19551"}},"official":{"repos":["anazaret/xges"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/optimizing-model-selection-for-compound-ai","slug":"optimizing-model-selection-for-compound-ai","title":"Optimizing Model Selection for Compound AI Systems","date":"2025-02-20","arxiv_id":"2502.14815","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/optimizing-model-selection-for-compound-ai#ran","syntology_url":"https://syntology.ai/paper/2502.14815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.14815"}},"official":{"repos":["LLMSELECTOR/LLMSELECTOR"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unveiling-environmental-impacts-of-large","slug":"unveiling-environmental-impacts-of-large","title":"Unveiling Environmental Impacts of Large Language Model Serving: A Functional Unit View","date":"2025-02-16","arxiv_id":"2502.11256","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/unveiling-environmental-impacts-of-large#ran","syntology_url":"https://syntology.ai/paper/2502.11256","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.11256"}},"official":{"repos":["jojacola/fuel"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-unsupervised-model-selection-for","slug":"towards-unsupervised-model-selection-for","title":"Towards Unsupervised Model Selection for Domain Adaptive Object Detection","date":"2024-12-23","arxiv_id":"2412.17284","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/towards-unsupervised-model-selection-for#ran","syntology_url":"https://syntology.ai/paper/2412.17284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.17284"}},"official":{"repos":["henryyu23/das"],"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/ad-llm-benchmarking-large-language-models-for","slug":"ad-llm-benchmarking-large-language-models-for","title":"AD-LLM: Benchmarking Large Language Models for Anomaly Detection","date":"2024-12-15","arxiv_id":"2412.11142","repositories_listed":2,"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/ad-llm-benchmarking-large-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2412.11142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.11142"}},"official":{"repos":["usc-fortis/ad-llm"],"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/foundational-large-language-models-for","slug":"foundational-large-language-models-for","title":"Foundational Large Language Models for Materials Research","date":"2024-12-12","arxiv_id":"2412.09560","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":1,"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; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/foundational-large-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2412.09560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09560"}},"official":{"repos":["M3RG-IITD/llamat"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pyod-2-a-python-library-for-outlier-detection","slug":"pyod-2-a-python-library-for-outlier-detection","title":"PyOD 2: A Python Library for Outlier Detection with LLM-powered Model Selection","date":"2024-12-11","arxiv_id":"2412.12154","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/pyod-2-a-python-library-for-outlier-detection#ran","syntology_url":"https://syntology.ai/paper/2412.12154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.12154"}},"official":{"repos":["yzhao062/pyod"],"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/evaluating-language-models-as-synthetic-data","slug":"evaluating-language-models-as-synthetic-data","title":"Evaluating Language Models as Synthetic Data Generators","date":"2024-12-04","arxiv_id":"2412.03679","repositories_listed":2,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/evaluating-language-models-as-synthetic-data#ran","syntology_url":"https://syntology.ai/paper/2412.03679","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.03679"}},"official":{"repos":["neulab/data-agora"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/optimized-conformal-selection-powerful","slug":"optimized-conformal-selection-powerful","title":"Optimized Conformal Selection: Powerful Selective Inference After Conformity Score Optimization","date":"2024-11-27","arxiv_id":"2411.17983","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/optimized-conformal-selection-powerful#ran","syntology_url":"https://syntology.ai/paper/2411.17983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.17983"}},"official":{"repos":["tian-bai/optcs"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/using-large-language-models-for-expert-prior","slug":"using-large-language-models-for-expert-prior","title":"AutoElicit: Using Large Language Models for Expert Prior Elicitation in Predictive Modelling","date":"2024-11-26","arxiv_id":"2411.17284","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/using-large-language-models-for-expert-prior#ran","syntology_url":"https://syntology.ai/paper/2411.17284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.17284"}},"official":{"repos":["alexcapstick/llm-elicited-priors"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/lhrs-bot-nova-improved-multimodal-large","slug":"lhrs-bot-nova-improved-multimodal-large","title":"LHRS-Bot-Nova: Improved Multimodal Large Language Model for Remote Sensing Vision-Language Interpretation","date":"2024-11-14","arxiv_id":"2411.09301","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lhrs-bot-nova-improved-multimodal-large#ran","syntology_url":"https://syntology.ai/paper/2411.09301","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.09301"}},"official":{"repos":["NJU-LHRS/LHRS-Bot"],"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/seppo-semi-policy-preference-optimization-for","slug":"seppo-semi-policy-preference-optimization-for","title":"SePPO: Semi-Policy Preference Optimization for Diffusion Alignment","date":"2024-10-07","arxiv_id":"2410.05255","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":13,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/seppo-semi-policy-preference-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2410.05255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.05255"}},"official":{"repos":["dwanzhang-ai/seppo"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/paraphrasus-a-comprehensive-benchmark-for","slug":"paraphrasus-a-comprehensive-benchmark-for","title":"PARAPHRASUS : A Comprehensive Benchmark for Evaluating Paraphrase Detection Models","date":"2024-09-18","arxiv_id":"2409.12060","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/paraphrasus-a-comprehensive-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2409.12060","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.12060"}},"official":{"repos":["impresso/paraphrasus"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multiple-testing-for-signal-agnostic-searches","slug":"multiple-testing-for-signal-agnostic-searches","title":"Multiple testing for signal-agnostic searches of new physics with machine learning","date":"2024-08-22","arxiv_id":"2408.12296","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/multiple-testing-for-signal-agnostic-searches#ran","syntology_url":"https://syntology.ai/paper/2408.12296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.12296"}},"official":{"repos":["mletizia/multiple-testing-nplm"],"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/is-larger-always-better-evaluating-and","slug":"is-larger-always-better-evaluating-and","title":"ClinicRealm: Re-evaluating Large Language Models with Conventional Machine Learning for Non-Generative Clinical Prediction Tasks","date":"2024-07-26","arxiv_id":"2407.18525","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/is-larger-always-better-evaluating-and#ran","syntology_url":"https://syntology.ai/paper/2407.18525","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.18525"}},"official":{"repos":["yhzhu99/ehr-llm-benchmark"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/subject-driven-text-to-image-generation-via-1","slug":"subject-driven-text-to-image-generation-via-1","title":"Subject-driven Text-to-Image Generation via Preference-based Reinforcement Learning","date":"2024-07-16","arxiv_id":"2407.12164","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/subject-driven-text-to-image-generation-via-1#ran","syntology_url":"https://syntology.ai/paper/2407.12164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.12164"}},"official":{"repos":["andrew-miao/RPO"],"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/team-up-gbdts-and-dnns-advancing-efficient","slug":"team-up-gbdts-and-dnns-advancing-efficient","title":"Team up GBDTs and DNNs: Advancing Efficient and Effective Tabular Prediction with Tree-hybrid MLPs","date":"2024-07-13","arxiv_id":"2407.09790","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/team-up-gbdts-and-dnns-advancing-efficient#ran","syntology_url":"https://syntology.ai/paper/2407.09790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.09790"}},"official":{"repos":["jyansir/tmlp"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/autobencher-creating-salient-novel-difficult","slug":"autobencher-creating-salient-novel-difficult","title":"AutoBencher: Creating Salient, Novel, Difficult Datasets for Language Models","date":"2024-07-11","arxiv_id":"2407.08351","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/autobencher-creating-salient-novel-difficult#ran","syntology_url":"https://syntology.ai/paper/2407.08351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.08351"}},"official":{"repos":["XiangLi1999/AutoBencher"],"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/a-data-centric-perspective-on-evaluating","slug":"a-data-centric-perspective-on-evaluating","title":"A Data-Centric Perspective on Evaluating Machine Learning Models for Tabular Data","date":"2024-07-02","arxiv_id":"2407.02112","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/a-data-centric-perspective-on-evaluating#ran","syntology_url":"https://syntology.ai/paper/2407.02112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02112"}},"official":{"repos":["atschalz/dc_tabeval"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/tabred-a-benchmark-of-tabular-machine","slug":"tabred-a-benchmark-of-tabular-machine","title":"TabReD: Analyzing Pitfalls and Filling the Gaps in Tabular Deep Learning Benchmarks","date":"2024-06-27","arxiv_id":"2406.19380","repositories_listed":2,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/tabred-a-benchmark-of-tabular-machine#ran","syntology_url":"https://syntology.ai/paper/2406.19380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.19380"}},"official":{"repos":["yandex-research/tabred"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/aeon-a-python-toolkit-for-learning-from-time","slug":"aeon-a-python-toolkit-for-learning-from-time","title":"aeon: a Python toolkit for learning from time series","date":"2024-06-20","arxiv_id":"2406.14231","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"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) · 3 unverified","sample_list":"/paper/aeon-a-python-toolkit-for-learning-from-time#ran","syntology_url":"https://syntology.ai/paper/2406.14231","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14231"}},"official":{"repos":["aeon-toolkit/aeon"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/exploring-design-choices-for-building","slug":"exploring-design-choices-for-building","title":"Exploring Design Choices for Building Language-Specific LLMs","date":"2024-06-20","arxiv_id":"2406.14670","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":1,"n_no_contract":4,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/exploring-design-choices-for-building#ran","syntology_url":"https://syntology.ai/paper/2406.14670","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14670"}},"official":{"repos":["atutej/token-language-adaptation"],"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/encoder-vs-decoder-comparative-analysis-of","slug":"encoder-vs-decoder-comparative-analysis-of","title":"Encoder vs Decoder: Comparative Analysis of Encoder and Decoder Language Models on Multilingual NLU Tasks","date":"2024-06-19","arxiv_id":"2406.13469","repositories_listed":3,"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/encoder-vs-decoder-comparative-analysis-of#ran","syntology_url":"https://syntology.ai/paper/2406.13469","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.13469"}},"official":null}},{"url":"/paper/statistical-uncertainty-in-word-embeddings","slug":"statistical-uncertainty-in-word-embeddings","title":"Statistical Uncertainty in Word Embeddings: GloVe-V","date":"2024-06-18","arxiv_id":"2406.12165","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/statistical-uncertainty-in-word-embeddings#ran","syntology_url":"https://syntology.ai/paper/2406.12165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12165"}},"official":{"repos":["reglab/glove-v"],"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/proxylm-predicting-language-model-performance","slug":"proxylm-predicting-language-model-performance","title":"ProxyLM: Predicting Language Model Performance on Multilingual Tasks via Proxy Models","date":"2024-06-13","arxiv_id":"2406.09334","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/proxylm-predicting-language-model-performance#ran","syntology_url":"https://syntology.ai/paper/2406.09334","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09334"}},"official":{"repos":["davidanugraha/proxylm"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/symmetric-linear-bandits-with-hidden-symmetry","slug":"symmetric-linear-bandits-with-hidden-symmetry","title":"Symmetric Linear Bandits with Hidden Symmetry","date":"2024-05-22","arxiv_id":"2405.13899","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/symmetric-linear-bandits-with-hidden-symmetry#ran","syntology_url":"https://syntology.ai/paper/2405.13899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.13899"}},"official":{"repos":["namtrankekl/symmetric-linear-bandit-with-hidden-symmetry"],"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/the-future-of-cosmological-likelihood-based","slug":"the-future-of-cosmological-likelihood-based","title":"The future of cosmological likelihood-based inference: accelerated high-dimensional parameter estimation and model comparison","date":"2024-05-21","arxiv_id":"2405.12965","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-future-of-cosmological-likelihood-based#ran","syntology_url":"https://syntology.ai/paper/2405.12965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.12965"}},"official":{"repos":["alessiospuriomancini/cosmopower","astro-informatics/harmonic","dpiras/cosmopower-jax"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/don-t-waste-your-time-early-stopping-cross","slug":"don-t-waste-your-time-early-stopping-cross","title":"Don't Waste Your Time: Early Stopping Cross-Validation","date":"2024-05-06","arxiv_id":"2405.03389","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/don-t-waste-your-time-early-stopping-cross#ran","syntology_url":"https://syntology.ai/paper/2405.03389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.03389"}},"official":{"repos":["automl/dontwasteyourtime-early-stopping"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/model-selection-with-model-zoo-via-graph","slug":"model-selection-with-model-zoo-via-graph","title":"Model Selection with Model Zoo via Graph Learning","date":"2024-04-05","arxiv_id":"2404.03988","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/model-selection-with-model-zoo-via-graph#ran","syntology_url":"https://syntology.ai/paper/2404.03988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03988"}},"official":{"repos":["transfergraph/transfergraph"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/defining-expertise-applications-to-treatment","slug":"defining-expertise-applications-to-treatment","title":"Defining Expertise: Applications to Treatment Effect Estimation","date":"2024-03-01","arxiv_id":"2403.00694","repositories_listed":2,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":13,"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) · 2 unverified","sample_list":"/paper/defining-expertise-applications-to-treatment#ran","syntology_url":"https://syntology.ai/paper/2403.00694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.00694"}},"official":{"repos":["qiyaowei/expertise","vanderschaarlab/expertise"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/unveiling-the-potential-of-robustness-in","slug":"unveiling-the-potential-of-robustness-in","title":"Unveiling the Potential of Robustness in Selecting Conditional Average Treatment Effect Estimators","date":"2024-02-28","arxiv_id":"2402.18392","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/unveiling-the-potential-of-robustness-in#ran","syntology_url":"https://syntology.ai/paper/2402.18392","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.18392"}},"official":{"repos":["yiyhuang3/cate_estimator_selection"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/benchmark-self-evolving-a-multi-agent","slug":"benchmark-self-evolving-a-multi-agent","title":"Benchmark Self-Evolving: A Multi-Agent Framework for Dynamic LLM Evaluation","date":"2024-02-18","arxiv_id":"2402.11443","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/benchmark-self-evolving-a-multi-agent#ran","syntology_url":"https://syntology.ai/paper/2402.11443","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11443"}},"official":{"repos":["nanshineloong/self-evolving-benchmark"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lota-bench-benchmarking-language-oriented","slug":"lota-bench-benchmarking-language-oriented","title":"LoTa-Bench: Benchmarking Language-oriented Task Planners for Embodied Agents","date":"2024-02-13","arxiv_id":"2402.08178","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":10,"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/lota-bench-benchmarking-language-oriented#ran","syntology_url":"https://syntology.ai/paper/2402.08178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.08178"}},"official":{"repos":["lbaa2022/llmtaskplanning"],"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/a-bias-variance-decomposition-for-ensembles","slug":"a-bias-variance-decomposition-for-ensembles","title":"A Bias-Variance Decomposition for Ensembles over Multiple Synthetic Datasets","date":"2024-02-06","arxiv_id":"2402.03985","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":6,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-bias-variance-decomposition-for-ensembles#ran","syntology_url":"https://syntology.ai/paper/2402.03985","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.03985"}},"official":{"repos":["dpbayes/generative-ensemble-bias-variance-decomposition"],"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/discovering-more-effective-tensor-network","slug":"discovering-more-effective-tensor-network","title":"tnGPS: Discovering Unknown Tensor Network Structure Search Algorithms via Large Language Models (LLMs)","date":"2024-02-04","arxiv_id":"2402.02456","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/discovering-more-effective-tensor-network#ran","syntology_url":"https://syntology.ai/paper/2402.02456","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02456"}},"official":{"repos":["chaoliatriken/tngps"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/when-benchmarks-are-targets-revealing-the","slug":"when-benchmarks-are-targets-revealing-the","title":"When Benchmarks are Targets: Revealing the Sensitivity of Large Language Model Leaderboards","date":"2024-02-01","arxiv_id":"2402.01781","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 0 unverified","sample_list":"/paper/when-benchmarks-are-targets-revealing-the#ran","syntology_url":"https://syntology.ai/paper/2402.01781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01781"}},"official":{"repos":["national-center-for-ai-saudi-arabia/lm-evaluation-harness"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/inters-unlocking-the-power-of-large-language","slug":"inters-unlocking-the-power-of-large-language","title":"INTERS: Unlocking the Power of Large Language Models in Search with Instruction Tuning","date":"2024-01-12","arxiv_id":"2401.06532","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/inters-unlocking-the-power-of-large-language#ran","syntology_url":"https://syntology.ai/paper/2401.06532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06532"}},"official":{"repos":["daod/inters"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-measuring-representational-similarity","slug":"towards-measuring-representational-similarity","title":"Towards Measuring Representational Similarity of Large Language Models","date":"2023-12-05","arxiv_id":"2312.02730","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-measuring-representational-similarity#ran","syntology_url":"https://syntology.ai/paper/2312.02730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02730"}},"official":{"repos":["mklabunde/llm_repsim"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bivdiff-a-training-free-framework-for-general","slug":"bivdiff-a-training-free-framework-for-general","title":"BIVDiff: A Training-Free Framework for General-Purpose Video Synthesis via Bridging Image and Video Diffusion Models","date":"2023-12-05","arxiv_id":"2312.02813","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bivdiff-a-training-free-framework-for-general#ran","syntology_url":"https://syntology.ai/paper/2312.02813","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02813"}},"official":{"repos":["mcg-nju/bivdiff"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/barcodebert-transformers-for-biodiversity","slug":"barcodebert-transformers-for-biodiversity","title":"BarcodeBERT: Transformers for Biodiversity Analysis","date":"2023-11-04","arxiv_id":"2311.02401","repositories_listed":4,"syntology":{"n":16,"n_ran":12,"n_constructed":1,"n_ran_checked":11,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"12 ran (of which 1 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/barcodebert-transformers-for-biodiversity#ran","syntology_url":"https://syntology.ai/paper/2311.02401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02401"}},"official":{"repos":["bioscan-ml/barcodebert","kari-genomics-lab/barcodebert"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":1,"n_ran_no_instrument_failure":11,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/reimagining-synthetic-tabular-data-generation-1","slug":"reimagining-synthetic-tabular-data-generation-1","title":"Reimagining Synthetic Tabular Data Generation through Data-Centric AI: A Comprehensive Benchmark","date":"2023-10-25","arxiv_id":"2310.16981","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reimagining-synthetic-tabular-data-generation-1#ran","syntology_url":"https://syntology.ai/paper/2310.16981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.16981"}},"official":{"repos":["hlasse/data-centric-synthetic-data","vanderschaarlab/data-centric-synthetic-data"],"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/towards-robust-multi-modal-reasoning-via","slug":"towards-robust-multi-modal-reasoning-via","title":"Towards Robust Multi-Modal Reasoning via Model Selection","date":"2023-10-12","arxiv_id":"2310.08446","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/towards-robust-multi-modal-reasoning-via#ran","syntology_url":"https://syntology.ai/paper/2310.08446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.08446"}},"official":{"repos":["LINs-lab/M3"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/the-topology-and-geometry-of-neural","slug":"the-topology-and-geometry-of-neural","title":"The Topology and Geometry of Neural Representations","date":"2023-09-20","arxiv_id":"2309.11028","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/the-topology-and-geometry-of-neural#ran","syntology_url":"https://syntology.ai/paper/2309.11028","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.11028"}},"official":{"repos":["doerlbh/topologicalrsa"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-model-transferability-through-the","slug":"exploring-model-transferability-through-the","title":"Exploring Model Transferability through the Lens of Potential Energy","date":"2023-08-29","arxiv_id":"2308.15074","repositories_listed":1,"syntology":{"n":24,"n_ran":19,"n_constructed":0,"n_ran_checked":11,"n_instrument":8,"n_unverified":5,"n_honours":1,"n_violates":2,"n_no_contract":8,"n_pointer_only":24,"phrase":"19 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; 8 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/exploring-model-transferability-through-the#ran","syntology_url":"https://syntology.ai/paper/2308.15074","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.15074"}},"official":{"repos":["lixiaotong97/ped"],"state":"official (archive's flag): 19 ran","n_ran":19,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/which-transformer-to-favor-a-comparative","slug":"which-transformer-to-favor-a-comparative","title":"Which Transformer to Favor: A Comparative Analysis of Efficiency in Vision Transformers","date":"2023-08-18","arxiv_id":"2308.09372","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/which-transformer-to-favor-a-comparative#ran","syntology_url":"https://syntology.ai/paper/2308.09372","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09372"}},"official":{"repos":["tobna/whattransformertofavor"],"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/foundation-model-is-efficient-multimodal-1","slug":"foundation-model-is-efficient-multimodal-1","title":"Foundation Model is Efficient Multimodal Multitask Model Selector","date":"2023-08-11","arxiv_id":"2308.06262","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/foundation-model-is-efficient-multimodal-1#ran","syntology_url":"https://syntology.ai/paper/2308.06262","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.06262"}},"official":{"repos":["opengvlab/multitask-model-selector"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/cal-sfda-source-free-domain-adaptive-semantic","slug":"cal-sfda-source-free-domain-adaptive-semantic","title":"Cal-SFDA: Source-Free Domain-adaptive Semantic Segmentation with Differentiable Expected Calibration Error","date":"2023-08-06","arxiv_id":"2308.03003","repositories_listed":1,"syntology":{"n":19,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/cal-sfda-source-free-domain-adaptive-semantic#ran","syntology_url":"https://syntology.ai/paper/2308.03003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.03003"}},"official":{"repos":["jo-wang/cal-sfda"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-unsupervised-deep-outlier-model","slug":"fast-unsupervised-deep-outlier-model","title":"Fast Unsupervised Deep Outlier Model Selection with Hypernetworks","date":"2023-07-20","arxiv_id":"2307.10529","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-unsupervised-deep-outlier-model#ran","syntology_url":"https://syntology.ai/paper/2307.10529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.10529"}},"official":{"repos":["xyvivian/hyper"],"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/self-compatibility-evaluating-causal","slug":"self-compatibility-evaluating-causal","title":"Self-Compatibility: Evaluating Causal Discovery without Ground Truth","date":"2023-07-18","arxiv_id":"2307.09552","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-compatibility-evaluating-causal#ran","syntology_url":"https://syntology.ai/paper/2307.09552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09552"}},"official":{"repos":["amazon-science/causal-self-compatibility"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-empirical-investigation-of-pre-trained-1","slug":"an-empirical-investigation-of-pre-trained-1","title":"An Empirical Study of Pre-trained Model Selection for Out-of-Distribution Generalization and Calibration","date":"2023-07-17","arxiv_id":"2307.08187","repositories_listed":1,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/an-empirical-investigation-of-pre-trained-1#ran","syntology_url":"https://syntology.ai/paper/2307.08187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08187"}},"official":{"repos":["hiroki11x/timm_ood_calibration"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-learning-for-dynamic-graphs-models-and","slug":"deep-learning-for-dynamic-graphs-models-and","title":"Deep learning for dynamic graphs: models and benchmarks","date":"2023-07-12","arxiv_id":"2307.06104","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/deep-learning-for-dynamic-graphs-models-and#ran","syntology_url":"https://syntology.ai/paper/2307.06104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.06104"}},"official":{"repos":["gravins/dynamic_graph_benchmark"],"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/learning-lie-group-symmetry-transformations","slug":"learning-lie-group-symmetry-transformations","title":"Learning Lie Group Symmetry Transformations with Neural Networks","date":"2023-07-04","arxiv_id":"2307.01583","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":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) · 1 unverified","sample_list":"/paper/learning-lie-group-symmetry-transformations#ran","syntology_url":"https://syntology.ai/paper/2307.01583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.01583"}},"official":{"repos":["victoria-klein/learning-lie-group-symmetries"],"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/probvlm-probabilistic-adapter-for-frozen","slug":"probvlm-probabilistic-adapter-for-frozen","title":"ProbVLM: Probabilistic Adapter for Frozen Vision-Language Models","date":"2023-07-01","arxiv_id":"2307.00398","repositories_listed":1,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"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) · 7 unverified","sample_list":"/paper/probvlm-probabilistic-adapter-for-frozen#ran","syntology_url":"https://syntology.ai/paper/2307.00398","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00398"}},"official":{"repos":["explainableml/probvlm"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/conditional-matrix-flows-for-gaussian-1","slug":"conditional-matrix-flows-for-gaussian-1","title":"Conditional Matrix Flows for Gaussian Graphical Models","date":"2023-06-12","arxiv_id":"2306.07255","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/conditional-matrix-flows-for-gaussian-1#ran","syntology_url":"https://syntology.ai/paper/2306.07255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07255"}},"official":{"repos":["fabricioarendtorres/flowconductor","marcello-negri/cmf"],"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/stochastic-marginal-likelihood-gradients","slug":"stochastic-marginal-likelihood-gradients","title":"Stochastic Marginal Likelihood Gradients using Neural Tangent Kernels","date":"2023-06-06","arxiv_id":"2306.03968","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 1 unverified","sample_list":"/paper/stochastic-marginal-likelihood-gradients#ran","syntology_url":"https://syntology.ai/paper/2306.03968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03968"}},"official":{"repos":["aleximmer/ntk-marglik"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/automatic-model-selection-with-large-language","slug":"automatic-model-selection-with-large-language","title":"Automatic Model Selection with Large Language Models for Reasoning","date":"2023-05-23","arxiv_id":"2305.14333","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/automatic-model-selection-with-large-language#ran","syntology_url":"https://syntology.ai/paper/2305.14333","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14333"}},"official":{"repos":["xuzhao0/model-selection-reasoning"],"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/efficient-deep-reinforcement-learning","slug":"efficient-deep-reinforcement-learning","title":"Efficient Deep Reinforcement Learning Requires Regulating Overfitting","date":"2023-04-20","arxiv_id":"2304.10466","repositories_listed":0,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/efficient-deep-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/2304.10466","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.10466"}},"official":null}},{"url":"/paper/hugginggpt-solving-ai-tasks-with-chatgpt-and","slug":"hugginggpt-solving-ai-tasks-with-chatgpt-and","title":"HuggingGPT: Solving AI Tasks with ChatGPT and its Friends in Hugging Face","date":"2023-03-30","arxiv_id":"2303.17580","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/hugginggpt-solving-ai-tasks-with-chatgpt-and#ran","syntology_url":"https://syntology.ai/paper/2303.17580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.17580"}},"official":{"repos":["microsoft/JARVIS"],"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/quantifying-modeling-multimodal-interactions-1","slug":"quantifying-modeling-multimodal-interactions-1","title":"Quantifying & Modeling Multimodal Interactions: An Information Decomposition Framework","date":"2023-02-23","arxiv_id":"2302.12247","repositories_listed":1,"syntology":{"n":16,"n_ran":15,"n_constructed":0,"n_ran_checked":1,"n_instrument":14,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"15 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; 14 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/quantifying-modeling-multimodal-interactions-1#ran","syntology_url":"https://syntology.ai/paper/2302.12247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12247"}},"official":{"repos":["pliang279/pid"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/change-is-hard-a-closer-look-at-subpopulation","slug":"change-is-hard-a-closer-look-at-subpopulation","title":"Change is Hard: A Closer Look at Subpopulation Shift","date":"2023-02-23","arxiv_id":"2302.12254","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/change-is-hard-a-closer-look-at-subpopulation#ran","syntology_url":"https://syntology.ai/paper/2302.12254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12254"}},"official":{"repos":["yyzharry/subpopbench"],"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":["listed","official"]}}},{"url":"/paper/pseudo-labeling-for-kernel-ridge-regression","slug":"pseudo-labeling-for-kernel-ridge-regression","title":"Pseudo-Labeling for Kernel Ridge Regression under Covariate Shift","date":"2023-02-20","arxiv_id":"2302.10160","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/pseudo-labeling-for-kernel-ridge-regression#ran","syntology_url":"https://syntology.ai/paper/2302.10160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.10160"}},"official":{"repos":["kw2934/krr"],"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/infinite-action-contextual-bandits-with","slug":"infinite-action-contextual-bandits-with","title":"Infinite Action Contextual Bandits with Reusable Data Exhaust","date":"2023-02-16","arxiv_id":"2302.08551","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/infinite-action-contextual-bandits-with#ran","syntology_url":"https://syntology.ai/paper/2302.08551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08551"}},"official":{"repos":["mrucker/onoff_experiments"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/best-arm-identification-for-stochastic-rising","slug":"best-arm-identification-for-stochastic-rising","title":"Best Arm Identification for Stochastic Rising Bandits","date":"2023-02-15","arxiv_id":"2302.07510","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/best-arm-identification-for-stochastic-rising#ran","syntology_url":"https://syntology.ai/paper/2302.07510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.07510"}},"official":{"repos":["montenegroalessandro/bestarmidsrb"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/specializing-smaller-language-models-towards","slug":"specializing-smaller-language-models-towards","title":"Specializing Smaller Language Models towards Multi-Step Reasoning","date":"2023-01-30","arxiv_id":"2301.12726","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/specializing-smaller-language-models-towards#ran","syntology_url":"https://syntology.ai/paper/2301.12726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12726"}},"official":{"repos":["FranxYao/FlanT5-CoT-Specialization"],"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/excelformer-a-neural-network-surpassing-gbdts","slug":"excelformer-a-neural-network-surpassing-gbdts","title":"ExcelFormer: A neural network surpassing GBDTs on tabular data","date":"2023-01-07","arxiv_id":"2301.02819","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/excelformer-a-neural-network-surpassing-gbdts#ran","syntology_url":"https://syntology.ai/paper/2301.02819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.02819"}},"official":{"repos":["whatashot/excelformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-rising-bandits","slug":"stochastic-rising-bandits","title":"Stochastic Rising Bandits","date":"2022-12-07","arxiv_id":"2212.03798","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/stochastic-rising-bandits#ran","syntology_url":"https://syntology.ai/paper/2212.03798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.03798"}},"official":{"repos":["albertometelli/stochastic-rising-bandits"],"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/execution-based-evaluation-for-data-science","slug":"execution-based-evaluation-for-data-science","title":"Execution-based Evaluation for Data Science Code Generation Models","date":"2022-11-17","arxiv_id":"2211.09374","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/execution-based-evaluation-for-data-science#ran","syntology_url":"https://syntology.ai/paper/2211.09374","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09374"}},"official":{"repos":["jun-jie-huang/exeds"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/data-models-for-dataset-drift-controls-in","slug":"data-models-for-dataset-drift-controls-in","title":"Data Models for Dataset Drift Controls in Machine Learning With Optical Images","date":"2022-11-04","arxiv_id":"2211.02578","repositories_listed":1,"syntology":{"n":18,"n_ran":17,"n_constructed":0,"n_ran_checked":16,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 2 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/data-models-for-dataset-drift-controls-in#ran","syntology_url":"https://syntology.ai/paper/2211.02578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02578"}},"official":{"repos":["aiaudit-org/raw2logit"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/toward-unsupervised-outlier-model-selection","slug":"toward-unsupervised-outlier-model-selection","title":"Toward Unsupervised Outlier Model Selection","date":"2022-11-03","arxiv_id":"2211.01834","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/toward-unsupervised-outlier-model-selection#ran","syntology_url":"https://syntology.ai/paper/2211.01834","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.01834"}},"official":{"repos":["yzhao062/elect"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-model-selection-of-lithium-ion","slug":"bayesian-model-selection-of-lithium-ion","title":"Bayesian Model Selection of Lithium-Ion Battery Models via Bayesian Quadrature","date":"2022-10-28","arxiv_id":"2210.17299","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":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) · 3 unverified","sample_list":"/paper/bayesian-model-selection-of-lithium-ion#ran","syntology_url":"https://syntology.ai/paper/2210.17299","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.17299"}},"official":{"repos":["Battery-Intelligence-Lab/BayesianModelSelection"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/uniasm-binary-code-similarity-detection","slug":"uniasm-binary-code-similarity-detection","title":"UniASM: Binary Code Similarity Detection without Fine-tuning","date":"2022-10-28","arxiv_id":"2211.01144","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/uniasm-binary-code-similarity-detection#ran","syntology_url":"https://syntology.ai/paper/2211.01144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.01144"}},"official":{"repos":["clm07/uniasm"],"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/360-mlc-multi-view-layout-consistency-for","slug":"360-mlc-multi-view-layout-consistency-for","title":"360-MLC: Multi-view Layout Consistency for Self-training and Hyper-parameter Tuning","date":"2022-10-24","arxiv_id":"2210.12935","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/360-mlc-multi-view-layout-consistency-for#ran","syntology_url":"https://syntology.ai/paper/2210.12935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12935"}},"official":{"repos":["EnriqueSolarte/360-mlc"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/data-iq-characterizing-subgroups-with","slug":"data-iq-characterizing-subgroups-with","title":"Data-IQ: Characterizing subgroups with heterogeneous outcomes in tabular data","date":"2022-10-24","arxiv_id":"2210.13043","repositories_listed":2,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/data-iq-characterizing-subgroups-with#ran","syntology_url":"https://syntology.ai/paper/2210.13043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13043"}},"official":{"repos":["seedatnabeel/data-iq","vanderschaarlab/data-iq"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-anomaly-detection-with-unsupervised","slug":"graph-anomaly-detection-with-unsupervised","title":"Graph Anomaly Detection with Unsupervised GNNs","date":"2022-10-18","arxiv_id":"2210.09535","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/graph-anomaly-detection-with-unsupervised#ran","syntology_url":"https://syntology.ai/paper/2210.09535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09535"}},"official":{"repos":["lingxiaoshawn/glam"],"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/unsupervised-model-selection-for-time-series","slug":"unsupervised-model-selection-for-time-series","title":"Unsupervised Model Selection for Time-series Anomaly Detection","date":"2022-10-03","arxiv_id":"2210.01078","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/unsupervised-model-selection-for-time-series#ran","syntology_url":"https://syntology.ai/paper/2210.01078","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.01078"}},"official":{"repos":["mononitogoswami/tsad-model-selection"],"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/secretgen-privacy-recovery-on-pre-trained","slug":"secretgen-privacy-recovery-on-pre-trained","title":"SecretGen: Privacy Recovery on Pre-Trained Models via Distribution Discrimination","date":"2022-07-25","arxiv_id":"2207.12263","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":4,"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/secretgen-privacy-recovery-on-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2207.12263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.12263"}},"official":{"repos":["ai-secure/secretgen"],"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/autogml-fast-automatic-model-selection-for","slug":"autogml-fast-automatic-model-selection-for","title":"MetaGL: Evaluation-Free Selection of Graph Learning Models via Meta-Learning","date":"2022-06-18","arxiv_id":"2206.09280","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/autogml-fast-automatic-model-selection-for#ran","syntology_url":"https://syntology.ai/paper/2206.09280","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09280"}},"official":{"repos":["namyongpark/metagl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hyperimpute-generalized-iterative-imputation","slug":"hyperimpute-generalized-iterative-imputation","title":"HyperImpute: Generalized Iterative Imputation with Automatic Model Selection","date":"2022-06-15","arxiv_id":"2206.07769","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hyperimpute-generalized-iterative-imputation#ran","syntology_url":"https://syntology.ai/paper/2206.07769","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07769"}},"official":{"repos":["vanderschaarlab/hyperimpute"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/minimizing-the-expected-posterior-entropy","slug":"minimizing-the-expected-posterior-entropy","title":"Unifying Summary Statistic Selection for Approximate Bayesian Computation","date":"2022-06-06","arxiv_id":"2206.02340","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/minimizing-the-expected-posterior-entropy#ran","syntology_url":"https://syntology.ai/paper/2206.02340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02340"}},"official":{"repos":["tillahoffmann/summaries"],"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/understanding-new-tasks-through-the-lens-of","slug":"understanding-new-tasks-through-the-lens-of","title":"Understanding new tasks through the lens of training data via exponential tilting","date":"2022-05-26","arxiv_id":"2205.13577","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/understanding-new-tasks-through-the-lens-of#ran","syntology_url":"https://syntology.ai/paper/2205.13577","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13577"}},"official":{"repos":["smaityumich/exponential-tilting"],"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/fast-instrument-learning-with-faster-rates","slug":"fast-instrument-learning-with-faster-rates","title":"Fast Instrument Learning with Faster Rates","date":"2022-05-22","arxiv_id":"2205.10772","repositories_listed":1,"syntology":{"n":18,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"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) · 7 unverified","sample_list":"/paper/fast-instrument-learning-with-faster-rates#ran","syntology_url":"https://syntology.ai/paper/2205.10772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10772"}},"official":{"repos":["meta-inf/fil"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/chaos-is-a-ladder-a-new-theoretical","slug":"chaos-is-a-ladder-a-new-theoretical","title":"Chaos is a Ladder: A New Theoretical Understanding of Contrastive Learning via Augmentation Overlap","date":"2022-03-25","arxiv_id":"2203.13457","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/chaos-is-a-ladder-a-new-theoretical#ran","syntology_url":"https://syntology.ai/paper/2203.13457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.13457"}},"official":{"repos":["zhangq327/arc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rich-feature-construction-for-the","slug":"rich-feature-construction-for-the","title":"Rich Feature Construction for the Optimization-Generalization Dilemma","date":"2022-03-24","arxiv_id":"2203.15516","repositories_listed":2,"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/rich-feature-construction-for-the#ran","syntology_url":"https://syntology.ai/paper/2203.15516","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15516"}},"official":{"repos":["tjujianyu/rfc"],"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":["listed","unlocated"]}}},{"url":"/paper/data-domain-aware-and-task-aware-pre-training","slug":"data-domain-aware-and-task-aware-pre-training","title":"DATA: Domain-Aware and Task-Aware Self-supervised Learning","date":"2022-03-17","arxiv_id":"2203.09041","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/data-domain-aware-and-task-aware-pre-training#ran","syntology_url":"https://syntology.ai/paper/2203.09041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.09041"}},"official":{"repos":["gaia-vision/gaia-ssl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pactran-pac-bayesian-metrics-for-estimating","slug":"pactran-pac-bayesian-metrics-for-estimating","title":"PACTran: PAC-Bayesian Metrics for Estimating the Transferability of Pretrained Models to Classification Tasks","date":"2022-03-10","arxiv_id":"2203.05126","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/pactran-pac-bayesian-metrics-for-estimating#ran","syntology_url":"https://syntology.ai/paper/2203.05126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05126"}},"official":{"repos":["google-research/pactran_metrics"],"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/bayesian-model-selection-the-marginal","slug":"bayesian-model-selection-the-marginal","title":"Bayesian Model Selection, the Marginal Likelihood, and Generalization","date":"2022-02-23","arxiv_id":"2202.11678","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bayesian-model-selection-the-marginal#ran","syntology_url":"https://syntology.ai/paper/2202.11678","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11678"}},"official":{"repos":["sanaelotfi/bayesian_model_comparison"],"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/fast-and-informative-model-selection-using","slug":"fast-and-informative-model-selection-using","title":"Fast and Informative Model Selection using Learning Curve Cross-Validation","date":"2021-11-27","arxiv_id":"2111.13914","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/fast-and-informative-model-selection-using#ran","syntology_url":"https://syntology.ai/paper/2111.13914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.13914"}},"official":{"repos":["fmohr/lccv"],"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-diverse-model-selection-for","slug":"scalable-diverse-model-selection-for","title":"Scalable Diverse Model Selection for Accessible Transfer Learning","date":"2021-11-12","arxiv_id":"2111.06977","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/scalable-diverse-model-selection-for#ran","syntology_url":"https://syntology.ai/paper/2111.06977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06977"}},"official":{"repos":["dbolya/parc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ensemble-of-averages-improving-model","slug":"ensemble-of-averages-improving-model","title":"Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalization","date":"2021-10-21","arxiv_id":"2110.10832","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/ensemble-of-averages-improving-model#ran","syntology_url":"https://syntology.ai/paper/2110.10832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.10832"}},"official":{"repos":["salesforce/ensemble-of-averages"],"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/riesznet-and-forestriesz-automatic-debiased","slug":"riesznet-and-forestriesz-automatic-debiased","title":"RieszNet and ForestRiesz: Automatic Debiased Machine Learning with Neural Nets and Random Forests","date":"2021-10-06","arxiv_id":"2110.03031","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/riesznet-and-forestriesz-automatic-debiased#ran","syntology_url":"https://syntology.ai/paper/2110.03031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.03031"}},"official":{"repos":["victor5as/rieszlearning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/volcanoml-speeding-up-end-to-end-automl-via","slug":"volcanoml-speeding-up-end-to-end-automl-via","title":"VolcanoML: Speeding up End-to-End AutoML via Scalable Search Space Decomposition","date":"2021-07-19","arxiv_id":"2107.08861","repositories_listed":3,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/volcanoml-speeding-up-end-to-end-automl-via#ran","syntology_url":"https://syntology.ai/paper/2107.08861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08861"}},"official":{"repos":["PKU-DAIR/mindware"],"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":["listed","official"]}}},{"url":"/paper/laplace-redux-effortless-bayesian-deep","slug":"laplace-redux-effortless-bayesian-deep","title":"Laplace Redux -- Effortless Bayesian Deep Learning","date":"2021-06-28","arxiv_id":"2106.14806","repositories_listed":6,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/laplace-redux-effortless-bayesian-deep#ran","syntology_url":"https://syntology.ai/paper/2106.14806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.14806"}},"official":{"repos":["AlexImmer/Laplace","runame/laplace-redux"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/model-selection-for-bayesian-autoencoders","slug":"model-selection-for-bayesian-autoencoders","title":"Model Selection for Bayesian Autoencoders","date":"2021-06-11","arxiv_id":"2106.06245","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/model-selection-for-bayesian-autoencoders#ran","syntology_url":"https://syntology.ai/paper/2106.06245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06245"}},"official":{"repos":["tranbahien/bae-prior"],"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/an-information-theoretic-approach-to-5","slug":"an-information-theoretic-approach-to-5","title":"An Information-theoretic Approach to Distribution Shifts","date":"2021-06-07","arxiv_id":"2106.03783","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-information-theoretic-approach-to-5#ran","syntology_url":"https://syntology.ai/paper/2106.03783","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03783"}},"official":{"repos":["mfederici/dsit"],"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/where-and-what-examining-interpretable","slug":"where-and-what-examining-interpretable","title":"Where and What? Examining Interpretable Disentangled Representations","date":"2021-04-07","arxiv_id":"2104.05622","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/where-and-what-examining-interpretable#ran","syntology_url":"https://syntology.ai/paper/2104.05622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.05622"}},"official":{"repos":["zhuxinqimac/PS-SC"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}}],"record_sha256":"fbf82b4dd6c12f8ba43463f03b07e51e1590e7ce968dabc8be1c066e3add4f13","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}