{"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/4","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":4,"pages_in_order":177,"rows_per_page":100,"rows":[301,400],"of":17610,"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","prev":"/task/language-modelling/papers/3","next":"/task/language-modelling/papers/5","papers":[{"url":"/paper/deep-gradient-compression-reduce-the","slug":"deep-gradient-compression-reduce-the","title":"Deep Gradient Compression Reduce the Communication Bandwidth For distributed Traning","date":"2017-12-05","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/state-of-the-art-speech-recognition-with","slug":"state-of-the-art-speech-recognition-with","title":"State-of-the-art Speech Recognition With Sequence-to-Sequence Models","date":"2017-12-05","arxiv_id":"1712.01769","repositories_listed":4,"syntology":null},{"url":"/paper/bayesian-recurrent-neural-networks","slug":"bayesian-recurrent-neural-networks","title":"Bayesian Recurrent Neural Networks","date":"2017-04-10","arxiv_id":"1704.02798","repositories_listed":4,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/bayesian-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1704.02798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.02798"}},"official":null}},{"url":"/paper/evolving-deep-neural-networks","slug":"evolving-deep-neural-networks","title":"Evolving Deep Neural Networks","date":"2017-03-01","arxiv_id":"1703.00548","repositories_listed":4,"syntology":null},{"url":"/paper/outrageously-large-neural-networks-the","slug":"outrageously-large-neural-networks-the","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","date":"2017-01-23","arxiv_id":"1701.06538","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"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 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/outrageously-large-neural-networks-the#ran","syntology_url":"https://syntology.ai/paper/1701.06538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.06538"}},"official":null}},{"url":"/paper/low-rank-passthrough-neural-networks","slug":"low-rank-passthrough-neural-networks","title":"Low-rank passthrough neural networks","date":"2016-03-10","arxiv_id":"1603.03116","repositories_listed":4,"syntology":null},{"url":"/paper/author-identification-using-multi-headed","slug":"author-identification-using-multi-headed","title":"Author Identification using Multi-headed Recurrent Neural Networks","date":"2015-06-16","arxiv_id":"1506.04891","repositories_listed":4,"syntology":null},{"url":"/paper/highway-networks","slug":"highway-networks","title":"Highway Networks","date":"2015-05-03","arxiv_id":"1505.00387","repositories_listed":4,"syntology":null},{"url":"/paper/sequence-to-sequence-video-to-text","slug":"sequence-to-sequence-video-to-text","title":"Sequence to Sequence -- Video to Text","date":"2015-05-03","arxiv_id":"1505.00487","repositories_listed":4,"syntology":null},{"url":"/paper/rwkv-7-goose-with-expressive-dynamic-state","slug":"rwkv-7-goose-with-expressive-dynamic-state","title":"RWKV-7 \"Goose\" with Expressive Dynamic State Evolution","date":"2025-03-18","arxiv_id":"2503.14456","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/rwkv-7-goose-with-expressive-dynamic-state#ran","syntology_url":"https://syntology.ai/paper/2503.14456","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.14456"}},"official":{"repos":["fla-org/flash-linear-attention","rwkv/rwkv-lm"],"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/induced-model-matching-restricted-models-help","slug":"induced-model-matching-restricted-models-help","title":"Induced Model Matching: Restricted Models Help Train Full-Featured Models","date":"2025-01-15","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/mutaplm-protein-language-modeling-for","slug":"mutaplm-protein-language-modeling-for","title":"MutaPLM: Protein Language Modeling for Mutation Explanation and Engineering","date":"2024-10-30","arxiv_id":"2410.22949","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":7,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mutaplm-protein-language-modeling-for#ran","syntology_url":"https://syntology.ai/paper/2410.22949","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22949"}},"official":{"repos":["pharmolix/mutaplm"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/m-rewardbench-evaluating-reward-models-in","slug":"m-rewardbench-evaluating-reward-models-in","title":"M-RewardBench: Evaluating Reward Models in Multilingual Settings","date":"2024-10-20","arxiv_id":"2410.15522","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/m-rewardbench-evaluating-reward-models-in#ran","syntology_url":"https://syntology.ai/paper/2410.15522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.15522"}},"official":{"repos":["for-ai/m-rewardbench"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/scrambled-text-training-language-models-to","slug":"scrambled-text-training-language-models-to","title":"Scrambled text: training Language Models to correct OCR errors using synthetic data","date":"2024-09-29","arxiv_id":"2409.19735","repositories_listed":3,"syntology":null},{"url":"/paper/moshi-a-speech-text-foundation-model-for-real","slug":"moshi-a-speech-text-foundation-model-for-real","title":"Moshi: a speech-text foundation model for real-time dialogue","date":"2024-09-17","arxiv_id":"2410.00037","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/moshi-a-speech-text-foundation-model-for-real#ran","syntology_url":"https://syntology.ai/paper/2410.00037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.00037"}},"official":{"repos":["kyutai-labs/moshi"],"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/task-level-distributionally-robust","slug":"task-level-distributionally-robust","title":"Task-level Distributionally Robust Optimization for Large Language Model-based Dense Retrieval","date":"2024-08-20","arxiv_id":"2408.10613","repositories_listed":3,"syntology":null},{"url":"/paper/transfusion-predict-the-next-token-and","slug":"transfusion-predict-the-next-token-and","title":"Transfusion: Predict the Next Token and Diffuse Images with One Multi-Modal Model","date":"2024-08-20","arxiv_id":"2408.11039","repositories_listed":3,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":3,"n_no_contract":5,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 3 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transfusion-predict-the-next-token-and#ran","syntology_url":"https://syntology.ai/paper/2408.11039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.11039"}},"official":null}},{"url":"/paper/mavis-mathematical-visual-instruction-tuning","slug":"mavis-mathematical-visual-instruction-tuning","title":"MAVIS: Mathematical Visual Instruction Tuning with an Automatic Data Engine","date":"2024-07-11","arxiv_id":"2407.08739","repositories_listed":3,"syntology":null},{"url":"/paper/ratescore-a-metric-for-radiology-report","slug":"ratescore-a-metric-for-radiology-report","title":"RaTEScore: A Metric for Radiology Report Generation","date":"2024-06-24","arxiv_id":"2406.16845","repositories_listed":3,"syntology":null},{"url":"/paper/encoder-vs-decoder-comparative-analysis-of","slug":"encoder-vs-decoder-comparative-analysis-of","title":"Encoder vs Decoder: Comparative Analysis of Encoder and Decoder Language Models on Multilingual NLU Tasks","date":"2024-06-19","arxiv_id":"2406.13469","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/encoder-vs-decoder-comparative-analysis-of#ran","syntology_url":"https://syntology.ai/paper/2406.13469","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.13469"}},"official":null}},{"url":"/paper/datacomp-lm-in-search-of-the-next-generation","slug":"datacomp-lm-in-search-of-the-next-generation","title":"DataComp-LM: In search of the next generation of training sets for language models","date":"2024-06-17","arxiv_id":"2406.11794","repositories_listed":3,"syntology":{"n":22,"n_ran":22,"n_constructed":0,"n_ran_checked":20,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":20,"n_pointer_only":1,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 0 honoured, 0 violated, 20 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/datacomp-lm-in-search-of-the-next-generation#ran","syntology_url":"https://syntology.ai/paper/2406.11794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11794"}},"official":null}},{"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/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/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/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/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/xmodel-lm-technical-report","slug":"xmodel-lm-technical-report","title":"Xmodel-LM Technical Report","date":"2024-06-05","arxiv_id":"2406.02856","repositories_listed":3,"syntology":null},{"url":"/paper/slab-efficient-transformers-with-simplified","slug":"slab-efficient-transformers-with-simplified","title":"SLAB: Efficient Transformers with Simplified Linear Attention and Progressive Re-parameterized Batch Normalization","date":"2024-05-19","arxiv_id":"2405.11582","repositories_listed":3,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":8,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":7,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/slab-efficient-transformers-with-simplified#ran","syntology_url":"https://syntology.ai/paper/2405.11582","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.11582"}},"official":{"repos":["xinghaochen/slab","mindspore-lab/models"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/4d-panoptic-scene-graph-generation-1","slug":"4d-panoptic-scene-graph-generation-1","title":"4D Panoptic Scene Graph Generation","date":"2024-05-16","arxiv_id":"2405.10305","repositories_listed":3,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":10,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/4d-panoptic-scene-graph-generation-1#ran","syntology_url":"https://syntology.ai/paper/2405.10305","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.10305"}},"official":{"repos":["jingkang50/psg4d","Jingkang50/OpenPSG","jingkang50/openpvsg"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rlhf-workflow-from-reward-modeling-to-online","slug":"rlhf-workflow-from-reward-modeling-to-online","title":"RLHF Workflow: From Reward Modeling to Online RLHF","date":"2024-05-13","arxiv_id":"2405.07863","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/rlhf-workflow-from-reward-modeling-to-online#ran","syntology_url":"https://syntology.ai/paper/2405.07863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.07863"}},"official":{"repos":["RLHFlow/RLHF-Reward-Modeling","rlhflow/online-rlhf"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/rebel-reinforcement-learning-via-regressing","slug":"rebel-reinforcement-learning-via-regressing","title":"REBEL: Reinforcement Learning via Regressing Relative Rewards","date":"2024-04-25","arxiv_id":"2404.16767","repositories_listed":3,"syntology":{"n":20,"n_ran":16,"n_constructed":0,"n_ran_checked":12,"n_instrument":4,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":6,"phrase":"16 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; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/rebel-reinforcement-learning-via-regressing#ran","syntology_url":"https://syntology.ai/paper/2404.16767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.16767"}},"official":{"repos":["Owen-Oertell/rlcm","zhaolingao/rebel"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/culturebank-an-online-community-driven","slug":"culturebank-an-online-community-driven","title":"CultureBank: An Online Community-Driven Knowledge Base Towards Culturally Aware Language Technologies","date":"2024-04-23","arxiv_id":"2404.15238","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/culturebank-an-online-community-driven#ran","syntology_url":"https://syntology.ai/paper/2404.15238","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15238"}},"official":{"repos":["salt-nlp/culturebank"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/rho-1-not-all-tokens-are-what-you-need","slug":"rho-1-not-all-tokens-are-what-you-need","title":"Rho-1: Not All Tokens Are What You Need","date":"2024-04-11","arxiv_id":"2404.07965","repositories_listed":3,"syntology":null},{"url":"/paper/sailor-open-language-models-for-south-east","slug":"sailor-open-language-models-for-south-east","title":"Sailor: Open Language Models for South-East Asia","date":"2024-04-04","arxiv_id":"2404.03608","repositories_listed":3,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/sailor-open-language-models-for-south-east#ran","syntology_url":"https://syntology.ai/paper/2404.03608","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03608"}},"official":{"repos":["epfllm/megatron-llm","sail-sg/sailor-llm"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/visual-autoregressive-modeling-scalable-image","slug":"visual-autoregressive-modeling-scalable-image","title":"Visual Autoregressive Modeling: Scalable Image Generation via Next-Scale Prediction","date":"2024-04-03","arxiv_id":"2404.02905","repositories_listed":3,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"7 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; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/visual-autoregressive-modeling-scalable-image#ran","syntology_url":"https://syntology.ai/paper/2404.02905","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.02905"}},"official":{"repos":["FoundationVision/VAR"],"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/jamba-a-hybrid-transformer-mamba-language","slug":"jamba-a-hybrid-transformer-mamba-language","title":"Jamba: A Hybrid Transformer-Mamba Language Model","date":"2024-03-28","arxiv_id":"2403.19887","repositories_listed":3,"syntology":null},{"url":"/paper/have-faith-in-faithfulness-going-beyond","slug":"have-faith-in-faithfulness-going-beyond","title":"Have Faith in Faithfulness: Going Beyond Circuit Overlap When Finding Model Mechanisms","date":"2024-03-26","arxiv_id":"2403.17806","repositories_listed":3,"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/have-faith-in-faithfulness-going-beyond#ran","syntology_url":"https://syntology.ai/paper/2403.17806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.17806"}},"official":{"repos":["hannamw/eap-ig","hannamw/eap-ig-faithfulness"],"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/rethinking-llm-language-adaptation-a-case","slug":"rethinking-llm-language-adaptation-a-case","title":"Rethinking LLM Language Adaptation: A Case Study on Chinese Mixtral","date":"2024-03-04","arxiv_id":"2403.01851","repositories_listed":3,"syntology":null},{"url":"/paper/guardt2i-defending-text-to-image-models-from","slug":"guardt2i-defending-text-to-image-models-from","title":"GuardT2I: Defending Text-to-Image Models from Adversarial Prompts","date":"2024-03-03","arxiv_id":"2403.01446","repositories_listed":3,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":4,"n_pointer_only":12,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/guardt2i-defending-text-to-image-models-from#ran","syntology_url":"https://syntology.ai/paper/2403.01446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01446"}},"official":{"repos":["cure-lab/guardt2i"],"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":["listed","official"]}}},{"url":"/paper/simple-linear-attention-language-models","slug":"simple-linear-attention-language-models","title":"Simple linear attention language models balance the recall-throughput tradeoff","date":"2024-02-28","arxiv_id":"2402.18668","repositories_listed":3,"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":1,"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/simple-linear-attention-language-models#ran","syntology_url":"https://syntology.ai/paper/2402.18668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.18668"}},"official":{"repos":["hazyresearch/based","hazyresearch/zoology"],"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/shapellm-universal-3d-object-understanding","slug":"shapellm-universal-3d-object-understanding","title":"ShapeLLM: Universal 3D Object Understanding for Embodied Interaction","date":"2024-02-27","arxiv_id":"2402.17766","repositories_listed":3,"syntology":{"n":17,"n_ran":14,"n_constructed":0,"n_ran_checked":10,"n_instrument":4,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":8,"n_pointer_only":8,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/shapellm-universal-3d-object-understanding#ran","syntology_url":"https://syntology.ai/paper/2402.17766","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17766"}},"official":{"repos":["qizekun/ShapeLLM"],"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":["listed","official"]}}},{"url":"/paper/induced-model-matching-how-restricted-models","slug":"induced-model-matching-how-restricted-models","title":"Induced Model Matching: How Restricted Models Can Help Larger Ones","date":"2024-02-19","arxiv_id":"2402.12513","repositories_listed":3,"syntology":null},{"url":"/paper/switch-ema-a-free-lunch-for-better-flatness","slug":"switch-ema-a-free-lunch-for-better-flatness","title":"Switch EMA: A Free Lunch for Better Flatness and Sharpness","date":"2024-02-14","arxiv_id":"2402.09240","repositories_listed":3,"syntology":null},{"url":"/paper/noise-contrastive-alignment-of-language","slug":"noise-contrastive-alignment-of-language","title":"Noise Contrastive Alignment of Language Models with Explicit Rewards","date":"2024-02-08","arxiv_id":"2402.05369","repositories_listed":3,"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/noise-contrastive-alignment-of-language#ran","syntology_url":"https://syntology.ai/paper/2402.05369","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05369"}},"official":{"repos":["thu-ml/noise-contrastive-alignment"],"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/image-fusion-via-vision-language-model","slug":"image-fusion-via-vision-language-model","title":"Image Fusion via Vision-Language Model","date":"2024-02-03","arxiv_id":"2402.02235","repositories_listed":3,"syntology":null},{"url":"/paper/natural-language-guidance-of-high-fidelity","slug":"natural-language-guidance-of-high-fidelity","title":"Natural language guidance of high-fidelity text-to-speech with synthetic annotations","date":"2024-02-02","arxiv_id":"2402.01912","repositories_listed":3,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/natural-language-guidance-of-high-fidelity#ran","syntology_url":"https://syntology.ai/paper/2402.01912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01912"}},"official":null}},{"url":"/paper/olmo-accelerating-the-science-of-language","slug":"olmo-accelerating-the-science-of-language","title":"OLMo: Accelerating the Science of Language Models","date":"2024-02-01","arxiv_id":"2402.00838","repositories_listed":3,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/olmo-accelerating-the-science-of-language#ran","syntology_url":"https://syntology.ai/paper/2402.00838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.00838"}},"official":{"repos":["allenai/olmo"],"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/yolo-world-real-time-open-vocabulary-object","slug":"yolo-world-real-time-open-vocabulary-object","title":"YOLO-World: Real-Time Open-Vocabulary Object Detection","date":"2024-01-30","arxiv_id":"2401.17270","repositories_listed":3,"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/yolo-world-real-time-open-vocabulary-object#ran","syntology_url":"https://syntology.ai/paper/2401.17270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.17270"}},"official":{"repos":["ailab-cvc/yolo-world"],"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/self-rewarding-language-models","slug":"self-rewarding-language-models","title":"Self-Rewarding Language Models","date":"2024-01-18","arxiv_id":"2401.10020","repositories_listed":3,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":2,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 2 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/self-rewarding-language-models#ran","syntology_url":"https://syntology.ai/paper/2401.10020","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.10020"}},"official":null}},{"url":"/paper/spatial-temporal-large-language-model-for","slug":"spatial-temporal-large-language-model-for","title":"Spatial-Temporal Large Language Model for Traffic Prediction","date":"2024-01-18","arxiv_id":"2401.10134","repositories_listed":3,"syntology":null},{"url":"/paper/know-your-needs-better-towards-structured","slug":"know-your-needs-better-towards-structured","title":"Know Your Needs Better: Towards Structured Understanding of Marketer Demands with Analogical Reasoning Augmented LLMs","date":"2024-01-09","arxiv_id":"2401.04319","repositories_listed":3,"syntology":null},{"url":"/paper/domain-specific-code-language-models","slug":"domain-specific-code-language-models","title":"MonoCoder: Domain-Specific Code Language Model for HPC Codes and Tasks","date":"2023-12-20","arxiv_id":"2312.13322","repositories_listed":3,"syntology":null},{"url":"/paper/g-llava-solving-geometric-problem-with-multi","slug":"g-llava-solving-geometric-problem-with-multi","title":"G-LLaVA: Solving Geometric Problem with Multi-Modal Large Language Model","date":"2023-12-18","arxiv_id":"2312.11370","repositories_listed":3,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/g-llava-solving-geometric-problem-with-multi#ran","syntology_url":"https://syntology.ai/paper/2312.11370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.11370"}},"official":{"repos":["pipilurj/g-llava"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gibbs-sampling-from-human-feedback-a-provable","slug":"gibbs-sampling-from-human-feedback-a-provable","title":"Iterative Preference Learning from Human Feedback: Bridging Theory and Practice for RLHF under KL-Constraint","date":"2023-12-18","arxiv_id":"2312.11456","repositories_listed":3,"syntology":null},{"url":"/paper/cogagent-a-visual-language-model-for-gui","slug":"cogagent-a-visual-language-model-for-gui","title":"CogAgent: A Visual Language Model for GUI Agents","date":"2023-12-14","arxiv_id":"2312.08914","repositories_listed":3,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"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) · 6 unverified","sample_list":"/paper/cogagent-a-visual-language-model-for-gui#ran","syntology_url":"https://syntology.ai/paper/2312.08914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.08914"}},"official":{"repos":["THUDM/CogAgent","thudm/cogvlm"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/vila-on-pre-training-for-visual-language","slug":"vila-on-pre-training-for-visual-language","title":"VILA: On Pre-training for Visual Language Models","date":"2023-12-12","arxiv_id":"2312.07533","repositories_listed":3,"syntology":null},{"url":"/paper/a-survey-of-graph-meets-large-language-model","slug":"a-survey-of-graph-meets-large-language-model","title":"A Survey of Graph Meets Large Language Model: Progress and Future Directions","date":"2023-11-21","arxiv_id":"2311.12399","repositories_listed":3,"syntology":null},{"url":"/paper/exponentially-faster-language-modelling","slug":"exponentially-faster-language-modelling","title":"Exponentially Faster Language Modelling","date":"2023-11-15","arxiv_id":"2311.10770","repositories_listed":3,"syntology":null},{"url":"/paper/gateloop-fully-data-controlled-linear","slug":"gateloop-fully-data-controlled-linear","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","date":"2023-11-03","arxiv_id":"2311.01927","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gateloop-fully-data-controlled-linear#ran","syntology_url":"https://syntology.ai/paper/2311.01927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.01927"}},"official":{"repos":["tobiaskatsch/GateLoop"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/tabula-harnessing-language-models-for-tabular","slug":"tabula-harnessing-language-models-for-tabular","title":"TabuLa: Harnessing Language Models for Tabular Data Synthesis","date":"2023-10-19","arxiv_id":"2310.12746","repositories_listed":3,"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/tabula-harnessing-language-models-for-tabular#ran","syntology_url":"https://syntology.ai/paper/2310.12746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12746"}},"official":{"repos":["zhao-zilong/tabula"],"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/prometheus-inducing-fine-grained-evaluation","slug":"prometheus-inducing-fine-grained-evaluation","title":"Prometheus: Inducing Fine-grained Evaluation Capability in Language Models","date":"2023-10-12","arxiv_id":"2310.08491","repositories_listed":3,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"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) · 5 unverified","sample_list":"/paper/prometheus-inducing-fine-grained-evaluation#ran","syntology_url":"https://syntology.ai/paper/2310.08491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.08491"}},"official":{"repos":["kaistAI/Prometheus"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/language-model-beats-diffusion-tokenizer-is","slug":"language-model-beats-diffusion-tokenizer-is","title":"Language Model Beats Diffusion -- Tokenizer is Key to Visual Generation","date":"2023-10-09","arxiv_id":"2310.05737","repositories_listed":3,"syntology":{"n":20,"n_ran":19,"n_constructed":0,"n_ran_checked":17,"n_instrument":2,"n_unverified":1,"n_honours":2,"n_violates":4,"n_no_contract":11,"n_pointer_only":5,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 2 honoured, 4 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/language-model-beats-diffusion-tokenizer-is#ran","syntology_url":"https://syntology.ai/paper/2310.05737","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05737"}},"official":null}},{"url":"/paper/dspy-compiling-declarative-language-model","slug":"dspy-compiling-declarative-language-model","title":"DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelines","date":"2023-10-05","arxiv_id":"2310.03714","repositories_listed":3,"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/dspy-compiling-declarative-language-model#ran","syntology_url":"https://syntology.ai/paper/2310.03714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.03714"}},"official":{"repos":["stanfordnlp/dspy"],"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/pixart-a-fast-training-of-diffusion","slug":"pixart-a-fast-training-of-diffusion","title":"PixArt-$α$: Fast Training of Diffusion Transformer for Photorealistic Text-to-Image Synthesis","date":"2023-09-30","arxiv_id":"2310.00426","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pixart-a-fast-training-of-diffusion#ran","syntology_url":"https://syntology.ai/paper/2310.00426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00426"}},"official":{"repos":["PixArt-alpha/PixArt-alpha"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/data-filtering-networks","slug":"data-filtering-networks","title":"Data Filtering Networks","date":"2023-09-29","arxiv_id":"2309.17425","repositories_listed":3,"syntology":null},{"url":"/paper/speaker-anonymization-using-neural-audio","slug":"speaker-anonymization-using-neural-audio","title":"Speaker anonymization using neural audio codec language models","date":"2023-09-25","arxiv_id":"2309.14129","repositories_listed":3,"syntology":null},{"url":"/paper/structchart-perception-structuring-reasoning","slug":"structchart-perception-structuring-reasoning","title":"StructChart: On the Schema, Metric, and Augmentation for Visual Chart Understanding","date":"2023-09-20","arxiv_id":"2309.11268","repositories_listed":3,"syntology":null},{"url":"/paper/sparse-autoencoders-find-highly-interpretable","slug":"sparse-autoencoders-find-highly-interpretable","title":"Sparse Autoencoders Find Highly Interpretable Features in Language Models","date":"2023-09-15","arxiv_id":"2309.08600","repositories_listed":3,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sparse-autoencoders-find-highly-interpretable#ran","syntology_url":"https://syntology.ai/paper/2309.08600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.08600"}},"official":{"repos":["hoagyc/sparse_coding"],"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":["listed","official"]}}},{"url":"/paper/speechtokenizer-unified-speech-tokenizer-for","slug":"speechtokenizer-unified-speech-tokenizer-for","title":"SpeechTokenizer: Unified Speech Tokenizer for Speech Large Language Models","date":"2023-08-31","arxiv_id":"2308.16692","repositories_listed":3,"syntology":{"n":26,"n_ran":24,"n_constructed":0,"n_ran_checked":21,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":4,"n_no_contract":16,"n_pointer_only":10,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 1 honoured, 4 violated, 16 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/speechtokenizer-unified-speech-tokenizer-for#ran","syntology_url":"https://syntology.ai/paper/2308.16692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16692"}},"official":{"repos":["0nutation/uslm","zhangxinfd/speechtokenizer","0nutation/slmtokbench"],"state":"official (archive's flag): 21 ran","n_ran":21,"n_constructed":0,"n_ran_no_instrument_failure":18,"n_unverified":2,"ran_from_kinds":["community","official","unlocated"]}}},{"url":"/paper/beam-retrieval-general-end-to-end-retrieval","slug":"beam-retrieval-general-end-to-end-retrieval","title":"End-to-End Beam Retrieval for Multi-Hop Question Answering","date":"2023-08-17","arxiv_id":"2308.08973","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"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) · 3 unverified","sample_list":"/paper/beam-retrieval-general-end-to-end-retrieval#ran","syntology_url":"https://syntology.ai/paper/2308.08973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08973"}},"official":{"repos":["Alab-NII/2wikimultihop","canghongjian/beam_retriever"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/detoxify-language-model-step-by-step","slug":"detoxify-language-model-step-by-step","title":"CMD: a framework for Context-aware Model self-Detoxification","date":"2023-08-16","arxiv_id":"2308.08295","repositories_listed":3,"syntology":null},{"url":"/paper/studying-large-language-model-generalization","slug":"studying-large-language-model-generalization","title":"Studying Large Language Model Generalization with Influence Functions","date":"2023-08-07","arxiv_id":"2308.03296","repositories_listed":3,"syntology":null},{"url":"/paper/think-on-graph-deep-and-responsible-reasoning","slug":"think-on-graph-deep-and-responsible-reasoning","title":"Think-on-Graph: Deep and Responsible Reasoning of Large Language Model on Knowledge Graph","date":"2023-07-15","arxiv_id":"2307.07697","repositories_listed":3,"syntology":{"n":16,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":1,"n_no_contract":8,"n_pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/think-on-graph-deep-and-responsible-reasoning#ran","syntology_url":"https://syntology.ai/paper/2307.07697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.07697"}},"official":{"repos":["gasolsun36/tog","idea-finai/tog"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["community","official"]}}},{"url":"/paper/gpt4roi-instruction-tuning-large-language","slug":"gpt4roi-instruction-tuning-large-language","title":"GPT4RoI: Instruction Tuning Large Language Model on Region-of-Interest","date":"2023-07-07","arxiv_id":"2307.03601","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gpt4roi-instruction-tuning-large-language#ran","syntology_url":"https://syntology.ai/paper/2307.03601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.03601"}},"official":{"repos":["jshilong/gpt4roi"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/motiongpt-human-motion-as-a-foreign-language","slug":"motiongpt-human-motion-as-a-foreign-language","title":"MotionGPT: Human Motion as a Foreign Language","date":"2023-06-26","arxiv_id":"2306.14795","repositories_listed":3,"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":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) · 3 unverified","sample_list":"/paper/motiongpt-human-motion-as-a-foreign-language#ran","syntology_url":"https://syntology.ai/paper/2306.14795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.14795"}},"official":{"repos":["openmotionlab/motiongpt"],"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/scaling-open-vocabulary-object-detection-1","slug":"scaling-open-vocabulary-object-detection-1","title":"Scaling Open-Vocabulary Object Detection","date":"2023-06-16","arxiv_id":"2306.09683","repositories_listed":3,"syntology":null},{"url":"/paper/blockwise-parallel-transformer-for-long","slug":"blockwise-parallel-transformer-for-long","title":"Blockwise Parallel Transformer for Large Context Models","date":"2023-05-30","arxiv_id":"2305.19370","repositories_listed":3,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/blockwise-parallel-transformer-for-long#ran","syntology_url":"https://syntology.ai/paper/2305.19370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19370"}},"official":{"repos":["lhao499/blockwise-parallel-transformer"],"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/multiscale-positive-unlabeled-detection-of-ai","slug":"multiscale-positive-unlabeled-detection-of-ai","title":"Multiscale Positive-Unlabeled Detection of AI-Generated Texts","date":"2023-05-29","arxiv_id":"2305.18149","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multiscale-positive-unlabeled-detection-of-ai#ran","syntology_url":"https://syntology.ai/paper/2305.18149","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18149"}},"official":{"repos":["yuchuantian/aigc_text_detector","huawei-noah/Efficient-Computing","mindspore-lab/mindone"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/kernel-ssl-kernel-kl-divergence-for-self","slug":"kernel-ssl-kernel-kl-divergence-for-self","title":"Matrix Information Theory for Self-Supervised Learning","date":"2023-05-27","arxiv_id":"2305.17326","repositories_listed":3,"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":5,"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/kernel-ssl-kernel-kl-divergence-for-self#ran","syntology_url":"https://syntology.ai/paper/2305.17326","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17326"}},"official":{"repos":["yifanzhang-pro/matrix-llm","yifanzhang-pro/matrix-ssl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/reasoning-with-language-model-is-planning","slug":"reasoning-with-language-model-is-planning","title":"Reasoning with Language Model is Planning with World Model","date":"2023-05-24","arxiv_id":"2305.14992","repositories_listed":3,"syntology":{"n":7,"n_ran":4,"n_constructed":2,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/reasoning-with-language-model-is-planning#ran","syntology_url":"https://syntology.ai/paper/2305.14992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14992"}},"official":null}},{"url":"/paper/hierarchical-prompting-assists-large-language","slug":"hierarchical-prompting-assists-large-language","title":"Hierarchical Prompting Assists Large Language Model on Web Navigation","date":"2023-05-23","arxiv_id":"2305.14257","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-prompting-assists-large-language#ran","syntology_url":"https://syntology.ai/paper/2305.14257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14257"}},"official":{"repos":["robert1003/ash-prompting"],"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/training-diffusion-models-with-reinforcement","slug":"training-diffusion-models-with-reinforcement","title":"Training Diffusion Models with Reinforcement Learning","date":"2023-05-22","arxiv_id":"2305.13301","repositories_listed":3,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/training-diffusion-models-with-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2305.13301","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13301"}},"official":{"repos":["kvablack/ddpo-pytorch"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/specinfer-accelerating-generative-llm-serving","slug":"specinfer-accelerating-generative-llm-serving","title":"SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification","date":"2023-05-16","arxiv_id":"2305.09781","repositories_listed":3,"syntology":null},{"url":"/paper/how-does-gpt-2-compute-greater-than-1","slug":"how-does-gpt-2-compute-greater-than-1","title":"How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language model","date":"2023-04-30","arxiv_id":"2305.00586","repositories_listed":3,"syntology":null},{"url":"/paper/scaling-transformer-to-1m-tokens-and-beyond","slug":"scaling-transformer-to-1m-tokens-and-beyond","title":"Scaling Transformer to 1M tokens and beyond with RMT","date":"2023-04-19","arxiv_id":"2304.11062","repositories_listed":3,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/scaling-transformer-to-1m-tokens-and-beyond#ran","syntology_url":"https://syntology.ai/paper/2304.11062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.11062"}},"official":{"repos":["booydar/t5-experiments"],"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/neural-comprehension-language-models-with","slug":"neural-comprehension-language-models-with","title":"Mastering Symbolic Operations: Augmenting Language Models with Compiled Neural Networks","date":"2023-04-04","arxiv_id":"2304.01665","repositories_listed":3,"syntology":{"n":11,"n_ran":5,"n_constructed":2,"n_ran_checked":4,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/neural-comprehension-language-models-with#ran","syntology_url":"https://syntology.ai/paper/2304.01665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.01665"}},"official":{"repos":["wengsyx/neural-comprehension"],"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":["listed","official"]}}},{"url":"/paper/assessing-language-model-deployment-with-risk","slug":"assessing-language-model-deployment-with-risk","title":"Assessing Language Model Deployment with Risk Cards","date":"2023-03-31","arxiv_id":"2303.18190","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/assessing-language-model-deployment-with-risk#ran","syntology_url":"https://syntology.ai/paper/2303.18190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.18190"}},"official":{"repos":["leondz/lm_risk_cards"],"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/camel-communicative-agents-for-mind","slug":"camel-communicative-agents-for-mind","title":"CAMEL: Communicative Agents for \"Mind\" Exploration of Large Language Model Society","date":"2023-03-31","arxiv_id":"2303.17760","repositories_listed":3,"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/camel-communicative-agents-for-mind#ran","syntology_url":"https://syntology.ai/paper/2303.17760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.17760"}},"official":{"repos":["camel-ai/camel"],"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/wavcaps-a-chatgpt-assisted-weakly-labelled","slug":"wavcaps-a-chatgpt-assisted-weakly-labelled","title":"WavCaps: A ChatGPT-Assisted Weakly-Labelled Audio Captioning Dataset for Audio-Language Multimodal Research","date":"2023-03-30","arxiv_id":"2303.17395","repositories_listed":3,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/wavcaps-a-chatgpt-assisted-weakly-labelled#ran","syntology_url":"https://syntology.ai/paper/2303.17395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.17395"}},"official":{"repos":["xinhaomei/wavcaps"],"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/cost-effective-hyperparameter-optimization","slug":"cost-effective-hyperparameter-optimization","title":"Cost-Effective Hyperparameter Optimization for Large Language Model Generation Inference","date":"2023-03-08","arxiv_id":"2303.04673","repositories_listed":3,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"6 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/cost-effective-hyperparameter-optimization#ran","syntology_url":"https://syntology.ai/paper/2303.04673","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.04673"}},"official":{"repos":["microsoft/FLAML"],"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/openicl-an-open-source-framework-for-in","slug":"openicl-an-open-source-framework-for-in","title":"OpenICL: An Open-Source Framework for In-context Learning","date":"2023-03-06","arxiv_id":"2303.02913","repositories_listed":3,"syntology":null},{"url":"/paper/vid2seq-large-scale-pretraining-of-a-visual","slug":"vid2seq-large-scale-pretraining-of-a-visual","title":"Vid2Seq: Large-Scale Pretraining of a Visual Language Model for Dense Video Captioning","date":"2023-02-27","arxiv_id":"2302.14115","repositories_listed":3,"syntology":null},{"url":"/paper/side-adapter-network-for-open-vocabulary","slug":"side-adapter-network-for-open-vocabulary","title":"Side Adapter Network for Open-Vocabulary Semantic Segmentation","date":"2023-02-23","arxiv_id":"2302.12242","repositories_listed":3,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/side-adapter-network-for-open-vocabulary#ran","syntology_url":"https://syntology.ai/paper/2302.12242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12242"}},"official":{"repos":["mendelxu/san"],"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":["listed","official"]}}},{"url":"/paper/multimodal-chain-of-thought-reasoning-in","slug":"multimodal-chain-of-thought-reasoning-in","title":"Multimodal Chain-of-Thought Reasoning in Language Models","date":"2023-02-02","arxiv_id":"2302.00923","repositories_listed":3,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"9 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multimodal-chain-of-thought-reasoning-in#ran","syntology_url":"https://syntology.ai/paper/2302.00923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.00923"}},"official":{"repos":["amazon-science/mm-cot"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/replug-retrieval-augmented-black-box-language","slug":"replug-retrieval-augmented-black-box-language","title":"REPLUG: Retrieval-Augmented Black-Box Language Models","date":"2023-01-30","arxiv_id":"2301.12652","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":13,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/replug-retrieval-augmented-black-box-language#ran","syntology_url":"https://syntology.ai/paper/2301.12652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12652"}},"official":null}},{"url":"/paper/xlm-v-overcoming-the-vocabulary-bottleneck-in","slug":"xlm-v-overcoming-the-vocabulary-bottleneck-in","title":"XLM-V: Overcoming the Vocabulary Bottleneck in Multilingual Masked Language Models","date":"2023-01-25","arxiv_id":"2301.10472","repositories_listed":3,"syntology":null},{"url":"/paper/hungry-hungry-hippos-towards-language","slug":"hungry-hungry-hippos-towards-language","title":"Hungry Hungry Hippos: Towards Language Modeling with State Space Models","date":"2022-12-28","arxiv_id":"2212.14052","repositories_listed":3,"syntology":{"n":15,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/hungry-hungry-hippos-towards-language#ran","syntology_url":"https://syntology.ai/paper/2212.14052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.14052"}},"official":{"repos":["hazyresearch/h3"],"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/precise-zero-shot-dense-retrieval-without","slug":"precise-zero-shot-dense-retrieval-without","title":"Precise Zero-Shot Dense Retrieval without Relevance Labels","date":"2022-12-20","arxiv_id":"2212.10496","repositories_listed":3,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/precise-zero-shot-dense-retrieval-without#ran","syntology_url":"https://syntology.ai/paper/2212.10496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10496"}},"official":{"repos":["texttron/hyde"],"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/discovering-language-model-behaviors-with","slug":"discovering-language-model-behaviors-with","title":"Discovering Language Model Behaviors with Model-Written Evaluations","date":"2022-12-19","arxiv_id":"2212.09251","repositories_listed":3,"syntology":null},{"url":"/paper/optimizing-prompts-for-text-to-image-1","slug":"optimizing-prompts-for-text-to-image-1","title":"Optimizing Prompts for Text-to-Image Generation","date":"2022-12-19","arxiv_id":"2212.09611","repositories_listed":3,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/optimizing-prompts-for-text-to-image-1#ran","syntology_url":"https://syntology.ai/paper/2212.09611","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09611"}},"official":{"repos":["microsoft/lmops"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]}}}],"record_sha256":"8460ef01a6ec0f365d3581e04c5ec31855d1b51e840c8e813ab4b50c2849fc34","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}