{"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/language-modelling/papers/ran/7","list_of":"/task/language-modelling","task":"Language Modelling","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":7,"pages_in_order":25,"rows_per_page":100,"rows":[601,700],"of":2428,"counts":{"archive_papers_tagged":17610,"with_a_code_link":7012,"where_syntology_ran_a_sample":2428,"not_listed_spam_title":0,"listed":17610,"listed_where_code_ran":2428,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2027,"every_run_a_failure_of_syntologys_instrument":401,"listed_with_a_run_with_no_instrument_failure":2027,"listed_every_run_a_failure_of_syntologys_instrument":401,"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/language-modelling/papers/ran/1","prev":"/task/language-modelling/papers/ran/6","next":"/task/language-modelling/papers/ran/8","papers":[{"url":"/paper/large-scale-transfer-learning-for-tabular","slug":"large-scale-transfer-learning-for-tabular","title":"Large Scale Transfer Learning for Tabular Data via Language Modeling","date":"2024-06-17","arxiv_id":"2406.12031","repositories_listed":2,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/large-scale-transfer-learning-for-tabular#ran","syntology_url":"https://syntology.ai/paper/2406.12031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12031"}},"official":{"repos":["mlfoundations/rtfm","mlfoundations/tabliblib"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/uniglm-training-one-unified-language-model","slug":"uniglm-training-one-unified-language-model","title":"UniGLM: Training One Unified Language Model for Text-Attributed Graph Embedding","date":"2024-06-17","arxiv_id":"2406.12052","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/uniglm-training-one-unified-language-model#ran","syntology_url":"https://syntology.ai/paper/2406.12052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12052"}},"official":{"repos":["nyushcs/uniglm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/csrt-evaluation-and-analysis-of-llms-using","slug":"csrt-evaluation-and-analysis-of-llms-using","title":"Code-Switching Red-Teaming: LLM Evaluation for Safety and Multilingual Understanding","date":"2024-06-17","arxiv_id":"2406.15481","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/csrt-evaluation-and-analysis-of-llms-using#ran","syntology_url":"https://syntology.ai/paper/2406.15481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15481"}},"official":{"repos":["haneul-yoo/csrt"],"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/roselora-row-and-column-wise-sparse-low-rank","slug":"roselora-row-and-column-wise-sparse-low-rank","title":"RoseLoRA: Row and Column-wise Sparse Low-rank Adaptation of Pre-trained Language Model for Knowledge Editing and Fine-tuning","date":"2024-06-16","arxiv_id":"2406.10777","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/roselora-row-and-column-wise-sparse-low-rank#ran","syntology_url":"https://syntology.ai/paper/2406.10777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10777"}},"official":{"repos":["lliutianc/roselora"],"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/sharelora-parameter-efficient-and-robust","slug":"sharelora-parameter-efficient-and-robust","title":"ShareLoRA: Parameter Efficient and Robust Large Language Model Fine-tuning via Shared Low-Rank Adaptation","date":"2024-06-16","arxiv_id":"2406.10785","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sharelora-parameter-efficient-and-robust#ran","syntology_url":"https://syntology.ai/paper/2406.10785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10785"}},"official":{"repos":["Rain9876/ShareLoRA"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/avoiding-copyright-infringement-via-machine","slug":"avoiding-copyright-infringement-via-machine","title":"Avoiding Copyright Infringement via Large Language Model Unlearning","date":"2024-06-16","arxiv_id":"2406.10952","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/avoiding-copyright-infringement-via-machine#ran","syntology_url":"https://syntology.ai/paper/2406.10952","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10952"}},"official":{"repos":["guangyaodou/SSU_Unlearn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/color-filter-conditional-loss-reduction","slug":"color-filter-conditional-loss-reduction","title":"CoLoR-Filter: Conditional Loss Reduction Filtering for Targeted Language Model Pre-training","date":"2024-06-15","arxiv_id":"2406.10670","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":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) · 1 unverified","sample_list":"/paper/color-filter-conditional-loss-reduction#ran","syntology_url":"https://syntology.ai/paper/2406.10670","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10670"}},"official":{"repos":["davidbrandfonbrener/color-filter-olmo"],"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/large-language-model-validity-via-enhanced","slug":"large-language-model-validity-via-enhanced","title":"Large language model validity via enhanced conformal prediction methods","date":"2024-06-14","arxiv_id":"2406.09714","repositories_listed":3,"syntology":{"n":32,"n_ran":23,"n_constructed":0,"n_ran_checked":22,"n_instrument":1,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":22,"n_pointer_only":12,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 0 honoured, 0 violated, 22 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/large-language-model-validity-via-enhanced#ran","syntology_url":"https://syntology.ai/paper/2406.09714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09714"}},"official":{"repos":["jjcherian/conformal-safety"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/regularizing-hidden-states-enables-learning","slug":"regularizing-hidden-states-enables-learning","title":"Regularizing Hidden States Enables Learning Generalizable Reward Model for LLMs","date":"2024-06-14","arxiv_id":"2406.10216","repositories_listed":2,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/regularizing-hidden-states-enables-learning#ran","syntology_url":"https://syntology.ai/paper/2406.10216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10216"}},"official":{"repos":["yangrui2015/generalizable-reward-model"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/beacon-benchmark-for-comprehensive-rna-tasks","slug":"beacon-benchmark-for-comprehensive-rna-tasks","title":"BEACON: Benchmark for Comprehensive RNA Tasks and Language Models","date":"2024-06-14","arxiv_id":"2406.10391","repositories_listed":1,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":11,"n_instrument":6,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":8,"n_pointer_only":2,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 1 violated, 8 with no contract checked; 6 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/beacon-benchmark-for-comprehensive-rna-tasks#ran","syntology_url":"https://syntology.ai/paper/2406.10391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10391"}},"official":{"repos":["terry-r123/RNABenchmark"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/streambench-towards-benchmarking-continuous","slug":"streambench-towards-benchmarking-continuous","title":"StreamBench: Towards Benchmarking Continuous Improvement of Language Agents","date":"2024-06-13","arxiv_id":"2406.08747","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/streambench-towards-benchmarking-continuous#ran","syntology_url":"https://syntology.ai/paper/2406.08747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08747"}},"official":{"repos":["stream-bench/stream-bench"],"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/on-softmax-direct-preference-optimization-for","slug":"on-softmax-direct-preference-optimization-for","title":"On Softmax Direct Preference Optimization for Recommendation","date":"2024-06-13","arxiv_id":"2406.09215","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-softmax-direct-preference-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2406.09215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09215"}},"official":{"repos":["chenyuxin1999/s-dpo"],"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/openvla-an-open-source-vision-language-action","slug":"openvla-an-open-source-vision-language-action","title":"OpenVLA: An Open-Source Vision-Language-Action Model","date":"2024-06-13","arxiv_id":"2406.09246","repositories_listed":3,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/openvla-an-open-source-vision-language-action#ran","syntology_url":"https://syntology.ai/paper/2406.09246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09246"}},"official":null}},{"url":"/paper/common-and-rare-fundus-diseases","slug":"common-and-rare-fundus-diseases","title":"Enhancing Diagnostic Accuracy in Rare and Common Fundus Diseases with a Knowledge-Rich Vision-Language Model","date":"2024-06-13","arxiv_id":"2406.09317","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/common-and-rare-fundus-diseases#ran","syntology_url":"https://syntology.ai/paper/2406.09317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09317"}},"official":{"repos":["LooKing9218/RetiZero"],"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/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/enhancing-domain-adaptation-through-prompt","slug":"enhancing-domain-adaptation-through-prompt","title":"Enhancing Domain Adaptation through Prompt Gradient Alignment","date":"2024-06-13","arxiv_id":"2406.09353","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":12,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/enhancing-domain-adaptation-through-prompt#ran","syntology_url":"https://syntology.ai/paper/2406.09353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09353"}},"official":{"repos":["viethoang1512/pga"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-model-unlearning-via-embedding","slug":"large-language-model-unlearning-via-embedding","title":"Large Language Model Unlearning via Embedding-Corrupted Prompts","date":"2024-06-12","arxiv_id":"2406.07933","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/large-language-model-unlearning-via-embedding#ran","syntology_url":"https://syntology.ai/paper/2406.07933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07933"}},"official":{"repos":["chrisliu298/llm-unlearn-eco"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/dataset-and-lessons-learned-from-the-2024","slug":"dataset-and-lessons-learned-from-the-2024","title":"Dataset and Lessons Learned from the 2024 SaTML LLM Capture-the-Flag Competition","date":"2024-06-12","arxiv_id":"2406.07954","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dataset-and-lessons-learned-from-the-2024#ran","syntology_url":"https://syntology.ai/paper/2406.07954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07954"}},"official":{"repos":["ethz-spylab/ctf-satml24-data-analysis"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multimodal-table-understanding","slug":"multimodal-table-understanding","title":"Multimodal Table Understanding","date":"2024-06-12","arxiv_id":"2406.08100","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multimodal-table-understanding#ran","syntology_url":"https://syntology.ai/paper/2406.08100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08100"}},"official":{"repos":["spursgozmy/table-llava"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/conme-rethinking-evaluation-of-compositional","slug":"conme-rethinking-evaluation-of-compositional","title":"ConMe: Rethinking Evaluation of Compositional Reasoning for Modern VLMs","date":"2024-06-12","arxiv_id":"2406.08164","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":12,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/conme-rethinking-evaluation-of-compositional#ran","syntology_url":"https://syntology.ai/paper/2406.08164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08164"}},"official":{"repos":["jmiemirza/conme"],"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-preference-optimization","slug":"discovering-preference-optimization","title":"Discovering Preference Optimization Algorithms with and for Large Language Models","date":"2024-06-12","arxiv_id":"2406.08414","repositories_listed":3,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/discovering-preference-optimization#ran","syntology_url":"https://syntology.ai/paper/2406.08414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08414"}},"official":{"repos":["luchris429/DiscoPOP","samholt/DiscoPOP","vanderschaarlab/discopop"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rs-agent-automating-remote-sensing-tasks","slug":"rs-agent-automating-remote-sensing-tasks","title":"RS-Agent: Automating Remote Sensing Tasks through Intelligent Agent","date":"2024-06-11","arxiv_id":"2406.07089","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/rs-agent-automating-remote-sensing-tasks#ran","syntology_url":"https://syntology.ai/paper/2406.07089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07089"}},"official":{"repos":["intellisensing/rs-agent"],"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/samba-simple-hybrid-state-space-models-for","slug":"samba-simple-hybrid-state-space-models-for","title":"Samba: Simple Hybrid State Space Models for Efficient Unlimited Context Language Modeling","date":"2024-06-11","arxiv_id":"2406.07522","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":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) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/samba-simple-hybrid-state-space-models-for#ran","syntology_url":"https://syntology.ai/paper/2406.07522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07522"}},"official":{"repos":["microsoft/Samba","sustcsonglin/flash-linear-attention"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/simple-and-effective-masked-diffusion","slug":"simple-and-effective-masked-diffusion","title":"Simple and Effective Masked Diffusion Language Models","date":"2024-06-11","arxiv_id":"2406.07524","repositories_listed":2,"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/simple-and-effective-masked-diffusion#ran","syntology_url":"https://syntology.ai/paper/2406.07524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07524"}},"official":{"repos":["kuleshov-group/mdlm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/mates-model-aware-data-selection-for","slug":"mates-model-aware-data-selection-for","title":"MATES: Model-Aware Data Selection for Efficient Pretraining with Data Influence Models","date":"2024-06-10","arxiv_id":"2406.06046","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":2,"n_no_contract":8,"n_pointer_only":4,"phrase":"11 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mates-model-aware-data-selection-for#ran","syntology_url":"https://syntology.ai/paper/2406.06046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06046"}},"official":{"repos":["cxcscmu/mates"],"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/powerinfer-2-fast-large-language-model","slug":"powerinfer-2-fast-large-language-model","title":"PowerInfer-2: Fast Large Language Model Inference on a Smartphone","date":"2024-06-10","arxiv_id":"2406.06282","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":2,"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/powerinfer-2-fast-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2406.06282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06282"}},"official":null}},{"url":"/paper/vcr-visual-caption-restoration","slug":"vcr-visual-caption-restoration","title":"VCR: A Task for Pixel-Level Complex Reasoning in Vision Language Models via Restoring Occluded Text","date":"2024-06-10","arxiv_id":"2406.06462","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vcr-visual-caption-restoration#ran","syntology_url":"https://syntology.ai/paper/2406.06462","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06462"}},"official":{"repos":["tianyu-z/vcr"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/parallelizing-linear-transformers-with-the","slug":"parallelizing-linear-transformers-with-the","title":"Parallelizing Linear Transformers with the Delta Rule over Sequence Length","date":"2024-06-10","arxiv_id":"2406.06484","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/parallelizing-linear-transformers-with-the#ran","syntology_url":"https://syntology.ai/paper/2406.06484","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06484"}},"official":{"repos":["fla-org/flash-linear-attention","sustcsonglin/flash-linear-attention"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-fine-tuning-dataset-and-benchmark-for-large","slug":"a-fine-tuning-dataset-and-benchmark-for-large","title":"A Fine-tuning Dataset and Benchmark for Large Language Models for Protein Understanding","date":"2024-06-08","arxiv_id":"2406.05540","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/a-fine-tuning-dataset-and-benchmark-for-large#ran","syntology_url":"https://syntology.ai/paper/2406.05540","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05540"}},"official":{"repos":["tsynbio/proteinlmdataset"],"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/helpful-or-harmful-data-fine-tuning-free","slug":"helpful-or-harmful-data-fine-tuning-free","title":"Helpful or Harmful Data? Fine-tuning-free Shapley Attribution for Explaining Language Model Predictions","date":"2024-06-07","arxiv_id":"2406.04606","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/helpful-or-harmful-data-fine-tuning-free#ran","syntology_url":"https://syntology.ai/paper/2406.04606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04606"}},"official":{"repos":["jtwang2000/freeshap"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/locllm-exploiting-generalizable-human","slug":"locllm-exploiting-generalizable-human","title":"LocLLM: Exploiting Generalizable Human Keypoint Localization via Large Language Model","date":"2024-06-07","arxiv_id":"2406.04659","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/locllm-exploiting-generalizable-human#ran","syntology_url":"https://syntology.ai/paper/2406.04659","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04659"}},"official":{"repos":["kennethwdk/LocLLM"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mixture-of-agents-enhances-large-language","slug":"mixture-of-agents-enhances-large-language","title":"Mixture-of-Agents Enhances Large Language Model Capabilities","date":"2024-06-07","arxiv_id":"2406.04692","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mixture-of-agents-enhances-large-language#ran","syntology_url":"https://syntology.ai/paper/2406.04692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04692"}},"official":null}},{"url":"/paper/crag-comprehensive-rag-benchmark","slug":"crag-comprehensive-rag-benchmark","title":"CRAG -- Comprehensive RAG Benchmark","date":"2024-06-07","arxiv_id":"2406.04744","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/crag-comprehensive-rag-benchmark#ran","syntology_url":"https://syntology.ai/paper/2406.04744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04744"}},"official":{"repos":["facebookresearch/crag"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/your-absorbing-discrete-diffusion-secretly","slug":"your-absorbing-discrete-diffusion-secretly","title":"Your Absorbing Discrete Diffusion Secretly Models the Conditional Distributions of Clean Data","date":"2024-06-06","arxiv_id":"2406.03736","repositories_listed":2,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/your-absorbing-discrete-diffusion-secretly#ran","syntology_url":"https://syntology.ai/paper/2406.03736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03736"}},"official":{"repos":["ml-gsai/radd"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tool-planner-dynamic-solution-tree-planning","slug":"tool-planner-dynamic-solution-tree-planning","title":"Tool-Planner: Task Planning with Clusters across Multiple Tools","date":"2024-06-06","arxiv_id":"2406.03807","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":1,"n_ran_checked":1,"n_instrument":6,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":9,"phrase":"7 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; 6 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tool-planner-dynamic-solution-tree-planning#ran","syntology_url":"https://syntology.ai/paper/2406.03807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03807"}},"official":{"repos":["OceannTwT/Tool-Planner"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/blsp-emo-towards-empathetic-large-speech","slug":"blsp-emo-towards-empathetic-large-speech","title":"BLSP-Emo: Towards Empathetic Large Speech-Language Models","date":"2024-06-06","arxiv_id":"2406.03872","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/blsp-emo-towards-empathetic-large-speech#ran","syntology_url":"https://syntology.ai/paper/2406.03872","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03872"}},"official":{"repos":["cwang621/blsp-emo"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/jailbreak-vision-language-models-via-bi-modal","slug":"jailbreak-vision-language-models-via-bi-modal","title":"Jailbreak Vision Language Models via Bi-Modal Adversarial Prompt","date":"2024-06-06","arxiv_id":"2406.04031","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"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; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/jailbreak-vision-language-models-via-bi-modal#ran","syntology_url":"https://syntology.ai/paper/2406.04031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04031"}},"official":{"repos":["NY1024/BAP-Jailbreak-Vision-Language-Models-via-Bi-Modal-Adversarial-Prompt"],"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/scaling-and-evaluating-sparse-autoencoders","slug":"scaling-and-evaluating-sparse-autoencoders","title":"Scaling and evaluating sparse autoencoders","date":"2024-06-06","arxiv_id":"2406.04093","repositories_listed":5,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/scaling-and-evaluating-sparse-autoencoders#ran","syntology_url":"https://syntology.ai/paper/2406.04093","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04093"}},"official":{"repos":["openai/sparse_autoencoder"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/compressible-dynamics-in-deep","slug":"compressible-dynamics-in-deep","title":"Compressible Dynamics in Deep Overparameterized Low-Rank Learning & Adaptation","date":"2024-06-06","arxiv_id":"2406.04112","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/compressible-dynamics-in-deep#ran","syntology_url":"https://syntology.ai/paper/2406.04112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04112"}},"official":{"repos":["cjyaras/deep-lora-transformers"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/simplified-and-generalized-masked-diffusion","slug":"simplified-and-generalized-masked-diffusion","title":"Simplified and Generalized Masked Diffusion for Discrete Data","date":"2024-06-06","arxiv_id":"2406.04329","repositories_listed":1,"syntology":{"n":21,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":15,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"6 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; 4 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/simplified-and-generalized-masked-diffusion#ran","syntology_url":"https://syntology.ai/paper/2406.04329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04329"}},"official":{"repos":["google-deepmind/md4"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":15,"ran_from_kinds":["official"]}}},{"url":"/paper/posterllava-constructing-a-unified-multi","slug":"posterllava-constructing-a-unified-multi","title":"PosterLLaVa: Constructing a Unified Multi-modal Layout Generator with LLM","date":"2024-06-05","arxiv_id":"2406.02884","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/posterllava-constructing-a-unified-multi#ran","syntology_url":"https://syntology.ai/paper/2406.02884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02884"}},"official":{"repos":["posterllava/posterllava"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/visual-text-cross-alignment-refining-the","slug":"visual-text-cross-alignment-refining-the","title":"Visual-Text Cross Alignment: Refining the Similarity Score in Vision-Language Models","date":"2024-06-05","arxiv_id":"2406.02915","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":0,"n_instrument":8,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"8 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; 8 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/visual-text-cross-alignment-refining-the#ran","syntology_url":"https://syntology.ai/paper/2406.02915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02915"}},"official":{"repos":["tmlr-group/wca"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/pruner-zero-evolving-symbolic-pruning-metric","slug":"pruner-zero-evolving-symbolic-pruning-metric","title":"Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models","date":"2024-06-05","arxiv_id":"2406.02924","repositories_listed":1,"syntology":{"n":17,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/pruner-zero-evolving-symbolic-pruning-metric#ran","syntology_url":"https://syntology.ai/paper/2406.02924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02924"}},"official":{"repos":["pprp/pruner-zero"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/pre-text-training-language-models-on-private","slug":"pre-text-training-language-models-on-private","title":"PrE-Text: Training Language Models on Private Federated Data in the Age of LLMs","date":"2024-06-05","arxiv_id":"2406.02958","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pre-text-training-language-models-on-private#ran","syntology_url":"https://syntology.ai/paper/2406.02958","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02958"}},"official":{"repos":["houcharlie/pre-text"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/drivlme-enhancing-llm-based-autonomous","slug":"drivlme-enhancing-llm-based-autonomous","title":"DriVLMe: Enhancing LLM-based Autonomous Driving Agents with Embodied and Social Experiences","date":"2024-06-05","arxiv_id":"2406.03008","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/drivlme-enhancing-llm-based-autonomous#ran","syntology_url":"https://syntology.ai/paper/2406.03008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03008"}},"official":{"repos":["sled-group/driVLMe"],"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/ranking-manipulation-for-conversational","slug":"ranking-manipulation-for-conversational","title":"Ranking Manipulation for Conversational Search Engines","date":"2024-06-05","arxiv_id":"2406.03589","repositories_listed":4,"syntology":{"n":20,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":20,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/ranking-manipulation-for-conversational#ran","syntology_url":"https://syntology.ai/paper/2406.03589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03589"}},"official":{"repos":["spfrommer/ragdoll-data-pipeline","spfrommer/ranking_manipulation","spfrommer/ranking_manipulation_data_pipeline","spfrommer/cse-ranking-manipulation"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/cr-utp-certified-robustness-against-universal","slug":"cr-utp-certified-robustness-against-universal","title":"CR-UTP: Certified Robustness against Universal Text Perturbations on Large Language Models","date":"2024-06-04","arxiv_id":"2406.01873","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cr-utp-certified-robustness-against-universal#ran","syntology_url":"https://syntology.ai/paper/2406.01873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01873"}},"official":{"repos":["UCF-ML-Research/CR-UTP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/audio-mamba-selective-state-spaces-for-self","slug":"audio-mamba-selective-state-spaces-for-self","title":"Audio Mamba: Selective State Spaces for Self-Supervised Audio Representations","date":"2024-06-04","arxiv_id":"2406.02178","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/audio-mamba-selective-state-spaces-for-self#ran","syntology_url":"https://syntology.ai/paper/2406.02178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02178"}},"official":{"repos":["SarthakYadav/audio-mamba-official"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-matmul-free-language-modeling","slug":"scalable-matmul-free-language-modeling","title":"Scalable MatMul-free Language Modeling","date":"2024-06-04","arxiv_id":"2406.02528","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":2,"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/scalable-matmul-free-language-modeling#ran","syntology_url":"https://syntology.ai/paper/2406.02528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02528"}},"official":{"repos":["ridgerchu/matmulfreellm"],"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/block-transformer-global-to-local-language","slug":"block-transformer-global-to-local-language","title":"Block Transformer: Global-to-Local Language Modeling for Fast Inference","date":"2024-06-04","arxiv_id":"2406.02657","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/block-transformer-global-to-local-language#ran","syntology_url":"https://syntology.ai/paper/2406.02657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02657"}},"official":{"repos":["itsnamgyu/block-transformer"],"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/randomized-geometric-algebra-methods-for","slug":"randomized-geometric-algebra-methods-for","title":"Randomized Geometric Algebra Methods for Convex Neural Networks","date":"2024-06-04","arxiv_id":"2406.02806","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/randomized-geometric-algebra-methods-for#ran","syntology_url":"https://syntology.ai/paper/2406.02806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02806"}},"official":{"repos":["pilancilab/Randomized-Geometric-Algebra-Methods-for-Convex-Neural-Networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/set-based-prompting-provably-solving-the","slug":"set-based-prompting-provably-solving-the","title":"Order-Independence Without Fine Tuning","date":"2024-06-04","arxiv_id":"2406.06581","repositories_listed":1,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":1,"n_instrument":7,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"8 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; 7 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/set-based-prompting-provably-solving-the#ran","syntology_url":"https://syntology.ai/paper/2406.06581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06581"}},"official":{"repos":["reidmcy/set-based-prompting"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/generative-pre-trained-speech-language-model","slug":"generative-pre-trained-speech-language-model","title":"Generative Pre-trained Speech Language Model with Efficient Hierarchical Transformer","date":"2024-06-03","arxiv_id":"2406.00976","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/generative-pre-trained-speech-language-model#ran","syntology_url":"https://syntology.ai/paper/2406.00976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00976"}},"official":{"repos":["youngsheen/gpst"],"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/dragonfly-multi-resolution-zoom-supercharges","slug":"dragonfly-multi-resolution-zoom-supercharges","title":"Dragonfly: Multi-Resolution Zoom-In Encoding Enhances Vision-Language Models","date":"2024-06-03","arxiv_id":"2406.00977","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/dragonfly-multi-resolution-zoom-supercharges#ran","syntology_url":"https://syntology.ai/paper/2406.00977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00977"}},"official":{"repos":["togethercomputer/dragonfly"],"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/multimax-sparse-and-multi-modal-attention","slug":"multimax-sparse-and-multi-modal-attention","title":"MultiMax: Sparse and Multi-Modal Attention Learning","date":"2024-06-03","arxiv_id":"2406.01189","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":2,"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/multimax-sparse-and-multi-modal-attention#ran","syntology_url":"https://syntology.ai/paper/2406.01189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01189"}},"official":{"repos":["zhouyuxuanyx/multimax"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/the-geometry-of-categorical-and-hierarchical","slug":"the-geometry-of-categorical-and-hierarchical","title":"The Geometry of Categorical and Hierarchical Concepts in Large Language Models","date":"2024-06-03","arxiv_id":"2406.01506","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":6,"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/the-geometry-of-categorical-and-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2406.01506","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01506"}},"official":{"repos":["kihopark/llm_categorical_hierarchical_representations"],"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/helix-distributed-serving-of-large-language","slug":"helix-distributed-serving-of-large-language","title":"Helix: Serving Large Language Models over Heterogeneous GPUs and Network via Max-Flow","date":"2024-06-03","arxiv_id":"2406.01566","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/helix-distributed-serving-of-large-language#ran","syntology_url":"https://syntology.ai/paper/2406.01566","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01566"}},"official":{"repos":["Thesys-lab/Helix-ASPLOS25"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/l-magic-language-model-assisted-generation-of","slug":"l-magic-language-model-assisted-generation-of","title":"L-MAGIC: Language Model Assisted Generation of Images with Coherence","date":"2024-06-03","arxiv_id":"2406.01843","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/l-magic-language-model-assisted-generation-of#ran","syntology_url":"https://syntology.ai/paper/2406.01843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01843"}},"official":{"repos":["intellabs/mmpano"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/skywork-moe-a-deep-dive-into-training","slug":"skywork-moe-a-deep-dive-into-training","title":"Skywork-MoE: A Deep Dive into Training Techniques for Mixture-of-Experts Language Models","date":"2024-06-03","arxiv_id":"2406.06563","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/skywork-moe-a-deep-dive-into-training#ran","syntology_url":"https://syntology.ai/paper/2406.06563","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06563"}},"official":null}},{"url":"/paper/inverse-constitutional-ai-compressing","slug":"inverse-constitutional-ai-compressing","title":"Inverse Constitutional AI: Compressing Preferences into Principles","date":"2024-06-02","arxiv_id":"2406.06560","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":3,"n_ran_checked":3,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/inverse-constitutional-ai-compressing#ran","syntology_url":"https://syntology.ai/paper/2406.06560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06560"}},"official":{"repos":["rdnfn/icai"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/the-best-of-both-worlds-toward-an-honest-and","slug":"the-best-of-both-worlds-toward-an-honest-and","title":"HonestLLM: Toward an Honest and Helpful Large Language Model","date":"2024-06-01","arxiv_id":"2406.00380","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":2,"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/the-best-of-both-worlds-toward-an-honest-and#ran","syntology_url":"https://syntology.ai/paper/2406.00380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00380"}},"official":{"repos":["Flossiee/HonestyLLM"],"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/interpretabnet-distilling-predictive-signals","slug":"interpretabnet-distilling-predictive-signals","title":"InterpreTabNet: Distilling Predictive Signals from Tabular Data by Salient Feature Interpretation","date":"2024-06-01","arxiv_id":"2406.00426","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":10,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 10 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified; every one of the 10 samples that ran constructed an object rather than computing a result","sample_list":"/paper/interpretabnet-distilling-predictive-signals#ran","syntology_url":"https://syntology.ai/paper/2406.00426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00426"}},"official":{"repos":["jacobyhsi/InterpreTabNet"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":10,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/meshxl-neural-coordinate-field-for-generative","slug":"meshxl-neural-coordinate-field-for-generative","title":"MeshXL: Neural Coordinate Field for Generative 3D Foundation Models","date":"2024-05-31","arxiv_id":"2405.20853","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meshxl-neural-coordinate-field-for-generative#ran","syntology_url":"https://syntology.ai/paper/2405.20853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20853"}},"official":{"repos":["openmeshlab/meshxl"],"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/transformers-are-ssms-generalized-models-and","slug":"transformers-are-ssms-generalized-models-and","title":"Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Duality","date":"2024-05-31","arxiv_id":"2405.21060","repositories_listed":5,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"9 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; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/transformers-are-ssms-generalized-models-and#ran","syntology_url":"https://syntology.ai/paper/2405.21060","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.21060"}},"official":{"repos":["state-spaces/mamba"],"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":["listed","official"]}}},{"url":"/paper/query2cad-generating-cad-models-using-natural","slug":"query2cad-generating-cad-models-using-natural","title":"Query2CAD: Generating CAD models using natural language queries","date":"2024-05-31","arxiv_id":"2406.00144","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/query2cad-generating-cad-models-using-natural#ran","syntology_url":"https://syntology.ai/paper/2406.00144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00144"}},"official":{"repos":["akshay140601/query2cad"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/x-instruction-aligning-language-model-in-low","slug":"x-instruction-aligning-language-model-in-low","title":"X-Instruction: Aligning Language Model in Low-resource Languages with Self-curated Cross-lingual Instructions","date":"2024-05-30","arxiv_id":"2405.19744","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/x-instruction-aligning-language-model-in-low#ran","syntology_url":"https://syntology.ai/paper/2405.19744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19744"}},"official":{"repos":["znlp/x-instruction"],"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/would-i-lie-to-you-inference-time-alignment","slug":"would-i-lie-to-you-inference-time-alignment","title":"Would I Lie To You? Inference Time Alignment of Language Models using Direct Preference Heads","date":"2024-05-30","arxiv_id":"2405.20053","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/would-i-lie-to-you-inference-time-alignment#ran","syntology_url":"https://syntology.ai/paper/2405.20053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20053"}},"official":{"repos":["Avelina9X/direct-preference-heads"],"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/llamea-a-large-language-model-evolutionary","slug":"llamea-a-large-language-model-evolutionary","title":"LLaMEA: A Large Language Model Evolutionary Algorithm for Automatically Generating Metaheuristics","date":"2024-05-30","arxiv_id":"2405.20132","repositories_listed":2,"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/llamea-a-large-language-model-evolutionary#ran","syntology_url":"https://syntology.ai/paper/2405.20132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20132"}},"official":{"repos":["nikivanstein/LLaMEA"],"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":["listed","official"]}}},{"url":"/paper/gnn-rag-graph-neural-retrieval-for-large","slug":"gnn-rag-graph-neural-retrieval-for-large","title":"GNN-RAG: Graph Neural Retrieval for Large Language Model Reasoning","date":"2024-05-30","arxiv_id":"2405.20139","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":7,"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/gnn-rag-graph-neural-retrieval-for-large#ran","syntology_url":"https://syntology.ai/paper/2405.20139","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20139"}},"official":{"repos":["cmavro/gnn-rag"],"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/evaluating-large-language-model-biases-in","slug":"evaluating-large-language-model-biases-in","title":"Evaluating Large Language Model Biases in Persona-Steered Generation","date":"2024-05-30","arxiv_id":"2405.20253","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/evaluating-large-language-model-biases-in#ran","syntology_url":"https://syntology.ai/paper/2405.20253","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20253"}},"official":{"repos":["andyjliu/persona-steered-generation-bias"],"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/sequence-augmented-se-3-flow-matching-for","slug":"sequence-augmented-se-3-flow-matching-for","title":"Sequence-Augmented SE(3)-Flow Matching For Conditional Protein Backbone Generation","date":"2024-05-30","arxiv_id":"2405.20313","repositories_listed":1,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":15,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":14,"n_pointer_only":20,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 0 violated, 14 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sequence-augmented-se-3-flow-matching-for#ran","syntology_url":"https://syntology.ai/paper/2405.20313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20313"}},"official":{"repos":["dreamfold/foldflow"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":3,"ran_from_kinds":["community","official"]}}},{"url":"/paper/language-generation-with-strictly-proper","slug":"language-generation-with-strictly-proper","title":"Language Generation with Strictly Proper Scoring Rules","date":"2024-05-29","arxiv_id":"2405.18906","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/language-generation-with-strictly-proper#ran","syntology_url":"https://syntology.ai/paper/2405.18906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18906"}},"official":{"repos":["shaochenze/scoringruleslm"],"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","unlocated"]}}},{"url":"/paper/robust-optimization-in-protein-fitness","slug":"robust-optimization-in-protein-fitness","title":"Robust Optimization in Protein Fitness Landscapes Using Reinforcement Learning in Latent Space","date":"2024-05-29","arxiv_id":"2405.18986","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/robust-optimization-in-protein-fitness#ran","syntology_url":"https://syntology.ai/paper/2405.18986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18986"}},"official":null}},{"url":"/paper/benchmarking-and-improving-detail-image","slug":"benchmarking-and-improving-detail-image","title":"Benchmarking and Improving Detail Image Caption","date":"2024-05-29","arxiv_id":"2405.19092","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/benchmarking-and-improving-detail-image#ran","syntology_url":"https://syntology.ai/paper/2405.19092","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19092"}},"official":{"repos":["foundation-multimodal-models/capture"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/weak-to-strong-search-align-large-language","slug":"weak-to-strong-search-align-large-language","title":"Weak-to-Strong Search: Align Large Language Models via Searching over Small Language Models","date":"2024-05-29","arxiv_id":"2405.19262","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/weak-to-strong-search-align-large-language#ran","syntology_url":"https://syntology.ai/paper/2405.19262","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19262"}},"official":{"repos":["zhziszz/weak-to-strong-search"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/matryoshka-query-transformer-for-large-vision","slug":"matryoshka-query-transformer-for-large-vision","title":"Matryoshka Query Transformer for Large Vision-Language Models","date":"2024-05-29","arxiv_id":"2405.19315","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/matryoshka-query-transformer-for-large-vision#ran","syntology_url":"https://syntology.ai/paper/2405.19315","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19315"}},"official":{"repos":["gordonhu608/mqt-llava"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/map-neo-highly-capable-and-transparent","slug":"map-neo-highly-capable-and-transparent","title":"MAP-Neo: Highly Capable and Transparent Bilingual Large Language Model Series","date":"2024-05-29","arxiv_id":"2405.19327","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":14,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/map-neo-highly-capable-and-transparent#ran","syntology_url":"https://syntology.ai/paper/2405.19327","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19327"}},"official":{"repos":["multimodal-art-projection/map-neo"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-in-conversation-team-building-for","slug":"adaptive-in-conversation-team-building-for","title":"Adaptive In-conversation Team Building for Language Model Agents","date":"2024-05-29","arxiv_id":"2405.19425","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/adaptive-in-conversation-team-building-for#ran","syntology_url":"https://syntology.ai/paper/2405.19425","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19425"}},"official":{"repos":["ag2ai/ag2"],"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/cliploss-and-norm-based-data-selection","slug":"cliploss-and-norm-based-data-selection","title":"CLIPLoss and Norm-Based Data Selection Methods for Multimodal Contrastive Learning","date":"2024-05-29","arxiv_id":"2405.19547","repositories_listed":2,"syntology":{"n":19,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":3,"n_no_contract":10,"n_pointer_only":19,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 3 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/cliploss-and-norm-based-data-selection#ran","syntology_url":"https://syntology.ai/paper/2405.19547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19547"}},"official":{"repos":["ypwang61/negcliploss_normsim","ypwang61/VAS"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/conveyor-efficient-tool-aware-llm-serving","slug":"conveyor-efficient-tool-aware-llm-serving","title":"Conveyor: Efficient Tool-aware LLM Serving with Tool Partial Execution","date":"2024-05-29","arxiv_id":"2406.00059","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/conveyor-efficient-tool-aware-llm-serving#ran","syntology_url":"https://syntology.ai/paper/2406.00059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00059"}},"official":{"repos":["conveyor-sys/conveyor"],"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/linguistic-collapse-neural-collapse-in-large","slug":"linguistic-collapse-neural-collapse-in-large","title":"Linguistic Collapse: Neural Collapse in (Large) Language Models","date":"2024-05-28","arxiv_id":"2405.17767","repositories_listed":2,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":9,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":11,"phrase":"12 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/linguistic-collapse-neural-collapse-in-large#ran","syntology_url":"https://syntology.ai/paper/2405.17767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17767"}},"official":{"repos":["rhubarbwu/linguistic-collapse","rhubarbwu/neural-collapse"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/aligning-to-thousands-of-preferences-via","slug":"aligning-to-thousands-of-preferences-via","title":"Aligning to Thousands of Preferences via System Message Generalization","date":"2024-05-28","arxiv_id":"2405.17977","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":0,"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/aligning-to-thousands-of-preferences-via#ran","syntology_url":"https://syntology.ai/paper/2405.17977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17977"}},"official":{"repos":["kaistAI/Janus"],"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":["community","official"]}}},{"url":"/paper/atm-adversarial-tuning-multi-agent-system","slug":"atm-adversarial-tuning-multi-agent-system","title":"ATM: Adversarial Tuning Multi-agent System Makes a Robust Retrieval-Augmented Generator","date":"2024-05-28","arxiv_id":"2405.18111","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/atm-adversarial-tuning-multi-agent-system#ran","syntology_url":"https://syntology.ai/paper/2405.18111","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18111"}},"official":{"repos":["chuhac/atm-rag"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/4-bit-shampoo-for-memory-efficient-network","slug":"4-bit-shampoo-for-memory-efficient-network","title":"4-bit Shampoo for Memory-Efficient Network Training","date":"2024-05-28","arxiv_id":"2405.18144","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":15,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/4-bit-shampoo-for-memory-efficient-network#ran","syntology_url":"https://syntology.ai/paper/2405.18144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18144"}},"official":{"repos":["sike-wang/low-bit-shampoo"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/superposed-decoding-multiple-generations-from","slug":"superposed-decoding-multiple-generations-from","title":"Superposed Decoding: Multiple Generations from a Single Autoregressive Inference Pass","date":"2024-05-28","arxiv_id":"2405.18400","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":1,"n_ran_checked":9,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":11,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/superposed-decoding-multiple-generations-from#ran","syntology_url":"https://syntology.ai/paper/2405.18400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18400"}},"official":{"repos":["raivnlab/superposeddecoding"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":1,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-diverse-attacks-on-large-language","slug":"learning-diverse-attacks-on-large-language","title":"Learning diverse attacks on large language models for robust red-teaming and safety tuning","date":"2024-05-28","arxiv_id":"2405.18540","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-diverse-attacks-on-large-language#ran","syntology_url":"https://syntology.ai/paper/2405.18540","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18540"}},"official":{"repos":["GFNOrg/red-teaming"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/motionllm-multimodal-motion-language-learning","slug":"motionllm-multimodal-motion-language-learning","title":"Motion-Agent: A Conversational Framework for Human Motion Generation with LLMs","date":"2024-05-27","arxiv_id":"2405.17013","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/motionllm-multimodal-motion-language-learning#ran","syntology_url":"https://syntology.ai/paper/2405.17013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17013"}},"official":{"repos":["szqwu/Motion-Agent"],"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/glauber-generative-model-discrete-diffusion","slug":"glauber-generative-model-discrete-diffusion","title":"Glauber Generative Model: Discrete Diffusion Models via Binary Classification","date":"2024-05-27","arxiv_id":"2405.17035","repositories_listed":0,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/glauber-generative-model-discrete-diffusion#ran","syntology_url":"https://syntology.ai/paper/2405.17035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17035"}},"official":null}},{"url":"/paper/various-lengths-constant-speed-efficient","slug":"various-lengths-constant-speed-efficient","title":"Various Lengths, Constant Speed: Efficient Language Modeling with Lightning Attention","date":"2024-05-27","arxiv_id":"2405.17381","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/various-lengths-constant-speed-efficient#ran","syntology_url":"https://syntology.ai/paper/2405.17381","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17381"}},"official":{"repos":["opennlplab/transnormerllm"],"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":["community","official"]}}},{"url":"/paper/the-expressive-capacity-of-state-space-models","slug":"the-expressive-capacity-of-state-space-models","title":"The Expressive Capacity of State Space Models: A Formal Language Perspective","date":"2024-05-27","arxiv_id":"2405.17394","repositories_listed":0,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"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, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-expressive-capacity-of-state-space-models#ran","syntology_url":"https://syntology.ai/paper/2405.17394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17394"}},"official":null}},{"url":"/paper/reason3d-searching-and-reasoning-3d","slug":"reason3d-searching-and-reasoning-3d","title":"Reason3D: Searching and Reasoning 3D Segmentation via Large Language Model","date":"2024-05-27","arxiv_id":"2405.17427","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/reason3d-searching-and-reasoning-3d#ran","syntology_url":"https://syntology.ai/paper/2405.17427","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17427"}},"official":{"repos":["kuanchihhuang/reason3d"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adafisher-adaptive-second-order-optimization","slug":"adafisher-adaptive-second-order-optimization","title":"AdaFisher: Adaptive Second Order Optimization via Fisher Information","date":"2024-05-26","arxiv_id":"2405.16397","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":1,"n_ran_checked":2,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":10,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adafisher-adaptive-second-order-optimization#ran","syntology_url":"https://syntology.ai/paper/2405.16397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16397"}},"official":{"repos":["AtlasAnalyticsLab/AdaFisher"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/intruding-with-words-towards-understanding","slug":"intruding-with-words-towards-understanding","title":"Intruding with Words: Towards Understanding Graph Injection Attacks at the Text Level","date":"2024-05-26","arxiv_id":"2405.16405","repositories_listed":1,"syntology":{"n":24,"n_ran":17,"n_constructed":0,"n_ran_checked":14,"n_instrument":3,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":13,"n_pointer_only":24,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 0 violated, 13 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/intruding-with-words-towards-understanding#ran","syntology_url":"https://syntology.ai/paper/2405.16405","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16405"}},"official":{"repos":["leirunlin/text-level-graph-attack"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/kg-fit-knowledge-graph-fine-tuning-upon-open","slug":"kg-fit-knowledge-graph-fine-tuning-upon-open","title":"KG-FIT: Knowledge Graph Fine-Tuning Upon Open-World Knowledge","date":"2024-05-26","arxiv_id":"2405.16412","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/kg-fit-knowledge-graph-fine-tuning-upon-open#ran","syntology_url":"https://syntology.ai/paper/2405.16412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16412"}},"official":{"repos":["pat-jj/KG-FIT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cacheblend-fast-large-language-model-serving","slug":"cacheblend-fast-large-language-model-serving","title":"CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion","date":"2024-05-26","arxiv_id":"2405.16444","repositories_listed":2,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":14,"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) · 4 unverified","sample_list":"/paper/cacheblend-fast-large-language-model-serving#ran","syntology_url":"https://syntology.ai/paper/2405.16444","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16444"}},"official":{"repos":["YaoJiayi/CacheBlend"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/loqt-low-rank-adapters-for-quantized-training","slug":"loqt-low-rank-adapters-for-quantized-training","title":"LoQT: Low-Rank Adapters for Quantized Pretraining","date":"2024-05-26","arxiv_id":"2405.16528","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/loqt-low-rank-adapters-for-quantized-training#ran","syntology_url":"https://syntology.ai/paper/2405.16528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16528"}},"official":{"repos":["sebulo/LoQT"],"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/gzip-predicts-data-dependent-scaling-laws","slug":"gzip-predicts-data-dependent-scaling-laws","title":"gzip Predicts Data-dependent Scaling Laws","date":"2024-05-26","arxiv_id":"2405.16684","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/gzip-predicts-data-dependent-scaling-laws#ran","syntology_url":"https://syntology.ai/paper/2405.16684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16684"}},"official":{"repos":["KhoomeiK/complexity-scaling"],"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/disentangling-and-integrating-relational-and","slug":"disentangling-and-integrating-relational-and","title":"Disentangling and Integrating Relational and Sensory Information in Transformer Architectures","date":"2024-05-26","arxiv_id":"2405.16727","repositories_listed":2,"syntology":{"n":21,"n_ran":14,"n_constructed":9,"n_ran_checked":10,"n_instrument":4,"n_unverified":7,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":0,"phrase":"14 ran (of which 9 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 4 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/disentangling-and-integrating-relational-and#ran","syntology_url":"https://syntology.ai/paper/2405.16727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16727"}},"official":{"repos":["awni00/dual-attention"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/moeut-mixture-of-experts-universal","slug":"moeut-mixture-of-experts-universal","title":"MoEUT: Mixture-of-Experts Universal Transformers","date":"2024-05-25","arxiv_id":"2405.16039","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/moeut-mixture-of-experts-universal#ran","syntology_url":"https://syntology.ai/paper/2405.16039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16039"}},"official":{"repos":["robertcsordas/moeut"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/m-3-gpt-an-advanced-multimodal-multitask","slug":"m-3-gpt-an-advanced-multimodal-multitask","title":"M$^3$GPT: An Advanced Multimodal, Multitask Framework for Motion Comprehension and Generation","date":"2024-05-25","arxiv_id":"2405.16273","repositories_listed":1,"syntology":{"n":25,"n_ran":17,"n_constructed":4,"n_ran_checked":15,"n_instrument":2,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":25,"phrase":"17 ran (of which 4 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/m-3-gpt-an-advanced-multimodal-multitask#ran","syntology_url":"https://syntology.ai/paper/2405.16273","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16273"}},"official":{"repos":["luomingshuang/m3gpt"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":4,"n_ran_no_instrument_failure":15,"n_unverified":8,"ran_from_kinds":["official"]}}}],"record_sha256":"eefdca595a1defcbb8218de8fa4dc3af522d801608a8bb46020973fc7445de06","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}