{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/model","name":"model","slug":"model","description_markdown":"algorithme utiliser","categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":5434,"papers_with_code":1733,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":55,"rows_per_page":100,"shown":100,"of":5434,"of_with_code":1733,"tagged_in_all":5434,"counts":{"archive_papers_tagged":5434,"with_a_code_link":1733,"where_syntology_ran_a_sample":517,"not_listed_spam_title":0,"listed":5434,"listed_where_code_ran":517,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":411,"every_run_a_failure_of_syntologys_instrument":106,"listed_with_a_run_with_no_instrument_failure":411,"listed_every_run_a_failure_of_syntologys_instrument":106,"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"},"items":[{"url":"/paper/efficientnet-rethinking-model-scaling-for","slug":"efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","arxiv_id":"1905.11946","repositories_listed":144,"syntology":{"n":302,"n_ran":198,"n_constructed":73,"n_ran_checked":157,"n_instrument":41,"n_unverified":104,"n_honours":26,"n_violates":2,"n_no_contract":129,"n_pointer_only":113,"phrase":"198 ran (of which 73 constructed an object rather than computing a result; 157 with no instrument failure: 26 honoured, 2 violated, 129 with no contract checked; 41 where Syntology's instrument failed) · 104 unverified","sample_list":"/paper/efficientnet-rethinking-model-scaling-for#ran","syntology_url":"https://syntology.ai/paper/1905.11946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11946"}},"official":{"repos":["tensorflow/tpu"],"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/wavenet-a-generative-model-for-raw-audio","slug":"wavenet-a-generative-model-for-raw-audio","title":"WaveNet: A Generative Model for Raw Audio","date":"2016-09-12","arxiv_id":"1609.03499","repositories_listed":62,"syntology":{"n":103,"n_ran":65,"n_constructed":23,"n_ran_checked":52,"n_instrument":13,"n_unverified":38,"n_honours":2,"n_violates":1,"n_no_contract":49,"n_pointer_only":25,"phrase":"65 ran (of which 23 constructed an object rather than computing a result; 52 with no instrument failure: 2 honoured, 1 violated, 49 with no contract checked; 13 where Syntology's instrument failed) · 38 unverified","sample_list":"/paper/wavenet-a-generative-model-for-raw-audio#ran","syntology_url":"https://syntology.ai/paper/1609.03499","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.03499"}},"official":null}},{"url":"/paper/direct-preference-optimization-your-language","slug":"direct-preference-optimization-your-language","title":"Direct Preference Optimization: Your Language Model is Secretly a Reward Model","date":"2023-05-29","arxiv_id":"2305.18290","repositories_listed":29,"syntology":{"n":31,"n_ran":25,"n_constructed":1,"n_ran_checked":21,"n_instrument":4,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":21,"n_pointer_only":2,"phrase":"25 ran (of which 1 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/direct-preference-optimization-your-language#ran","syntology_url":"https://syntology.ai/paper/2305.18290","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18290"}},"official":null}},{"url":"/paper/a-neural-conversational-model","slug":"a-neural-conversational-model","title":"A Neural Conversational Model","date":"2015-06-19","arxiv_id":"1506.05869","repositories_listed":18,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-neural-conversational-model#ran","syntology_url":"https://syntology.ai/paper/1506.05869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.05869"}},"official":null}},{"url":"/paper/cross-lingual-language-model-pretraining","slug":"cross-lingual-language-model-pretraining","title":"Cross-lingual Language Model Pretraining","date":"2019-01-22","arxiv_id":"1901.07291","repositories_listed":17,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cross-lingual-language-model-pretraining#ran","syntology_url":"https://syntology.ai/paper/1901.07291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07291"}},"official":null}},{"url":"/paper/a-unified-approach-to-interpreting-model","slug":"a-unified-approach-to-interpreting-model","title":"A Unified Approach to Interpreting Model Predictions","date":"2017-05-22","arxiv_id":"1705.07874","repositories_listed":17,"syntology":{"n":8,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":6,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/a-unified-approach-to-interpreting-model#ran","syntology_url":"https://syntology.ai/paper/1705.07874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07874"}},"official":null}},{"url":"/paper/shapenet-an-information-rich-3d-model","slug":"shapenet-an-information-rich-3d-model","title":"ShapeNet: An Information-Rich 3D Model Repository","date":"2015-12-09","arxiv_id":"1512.03012","repositories_listed":16,"syntology":null},{"url":"/paper/vmamba-visual-state-space-model","slug":"vmamba-visual-state-space-model","title":"VMamba: Visual State Space Model","date":"2024-01-18","arxiv_id":"2401.10166","repositories_listed":13,"syntology":{"n":46,"n_ran":32,"n_constructed":6,"n_ran_checked":22,"n_instrument":10,"n_unverified":14,"n_honours":6,"n_violates":1,"n_no_contract":15,"n_pointer_only":14,"phrase":"32 ran (of which 6 constructed an object rather than computing a result; 22 with no instrument failure: 6 honoured, 1 violated, 15 with no contract checked; 10 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/vmamba-visual-state-space-model#ran","syntology_url":"https://syntology.ai/paper/2401.10166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.10166"}},"official":{"repos":["mzeromiko/vmamba"],"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":["listed","official"]}}},{"url":"/paper/what-is-wrong-with-scene-text-recognition","slug":"what-is-wrong-with-scene-text-recognition","title":"What Is Wrong With Scene Text Recognition Model Comparisons? Dataset and Model Analysis","date":"2019-04-03","arxiv_id":"1904.01906","repositories_listed":13,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/what-is-wrong-with-scene-text-recognition#ran","syntology_url":"https://syntology.ai/paper/1904.01906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01906"}},"official":{"repos":["clovaai/deep-text-recognition-benchmark"],"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/jukebox-a-generative-model-for-music-1","slug":"jukebox-a-generative-model-for-music-1","title":"Jukebox: A Generative Model for Music","date":"2020-04-30","arxiv_id":"2005.00341","repositories_listed":12,"syntology":null},{"url":"/paper/model-cards-for-model-reporting","slug":"model-cards-for-model-reporting","title":"Model Cards for Model Reporting","date":"2018-10-05","arxiv_id":"1810.03993","repositories_listed":12,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/model-cards-for-model-reporting#ran","syntology_url":"https://syntology.ai/paper/1810.03993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.03993"}},"official":null}},{"url":"/paper/diffwave-a-versatile-diffusion-model-for","slug":"diffwave-a-versatile-diffusion-model-for","title":"DiffWave: A Versatile Diffusion Model for Audio Synthesis","date":"2020-09-21","arxiv_id":"2009.09761","repositories_listed":11,"syntology":{"n":33,"n_ran":20,"n_constructed":11,"n_ran_checked":13,"n_instrument":7,"n_unverified":13,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"20 ran (of which 11 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 7 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/diffwave-a-versatile-diffusion-model-for#ran","syntology_url":"https://syntology.ai/paper/2009.09761","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.09761"}},"official":null}},{"url":"/paper/when-to-trust-your-model-model-based-policy","slug":"when-to-trust-your-model-model-based-policy","title":"When to Trust Your Model: Model-Based Policy Optimization","date":"2019-06-19","arxiv_id":"1906.08253","repositories_listed":11,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/when-to-trust-your-model-model-based-policy#ran","syntology_url":"https://syntology.ai/paper/1906.08253","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08253"}},"official":{"repos":["JannerM/mbpo"],"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/an-empirical-model-of-large-batch-training","slug":"an-empirical-model-of-large-batch-training","title":"An Empirical Model of Large-Batch Training","date":"2018-12-14","arxiv_id":"1812.06162","repositories_listed":11,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/an-empirical-model-of-large-batch-training#ran","syntology_url":"https://syntology.ai/paper/1812.06162","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.06162"}},"official":null}},{"url":"/paper/rexnet-diminishing-representational","slug":"rexnet-diminishing-representational","title":"Rethinking Channel Dimensions for Efficient Model Design","date":"2020-07-02","arxiv_id":"2007.00992","repositories_listed":10,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rexnet-diminishing-representational#ran","syntology_url":"https://syntology.ai/paper/2007.00992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00992"}},"official":{"repos":["clovaai/rexnet"],"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/a-self-attentive-model-for-knowledge-tracing","slug":"a-self-attentive-model-for-knowledge-tracing","title":"A Self-Attentive model for Knowledge Tracing","date":"2019-07-16","arxiv_id":"1907.06837","repositories_listed":10,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":4,"n_honours":0,"n_violates":2,"n_no_contract":2,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 2 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-self-attentive-model-for-knowledge-tracing#ran","syntology_url":"https://syntology.ai/paper/1907.06837","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.06837"}},"official":null}},{"url":"/paper/a-deep-reinforced-model-for-abstractive","slug":"a-deep-reinforced-model-for-abstractive","title":"A Deep Reinforced Model for Abstractive Summarization","date":"2017-05-11","arxiv_id":"1705.04304","repositories_listed":10,"syntology":null},{"url":"/paper/a-decomposable-attention-model-for-natural","slug":"a-decomposable-attention-model-for-natural","title":"A Decomposable Attention Model for Natural Language Inference","date":"2016-06-06","arxiv_id":"1606.01933","repositories_listed":10,"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/a-decomposable-attention-model-for-natural#ran","syntology_url":"https://syntology.ai/paper/1606.01933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.01933"}},"official":null}},{"url":"/paper/glm-130b-an-open-bilingual-pre-trained-model","slug":"glm-130b-an-open-bilingual-pre-trained-model","title":"GLM-130B: An Open Bilingual Pre-trained Model","date":"2022-10-05","arxiv_id":"2210.02414","repositories_listed":9,"syntology":{"n":21,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/glm-130b-an-open-bilingual-pre-trained-model#ran","syntology_url":"https://syntology.ai/paper/2210.02414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02414"}},"official":{"repos":["thudm/glm-130b"],"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":["listed","official"]}}},{"url":"/paper/the-double-sphere-camera-model","slug":"the-double-sphere-camera-model","title":"The Double Sphere Camera Model","date":"2018-07-24","arxiv_id":"1807.08957","repositories_listed":9,"syntology":null},{"url":"/paper/neural-network-dynamics-for-model-based-deep","slug":"neural-network-dynamics-for-model-based-deep","title":"Neural Network Dynamics for Model-Based Deep Reinforcement Learning with Model-Free Fine-Tuning","date":"2017-08-08","arxiv_id":"1708.02596","repositories_listed":9,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-network-dynamics-for-model-based-deep#ran","syntology_url":"https://syntology.ai/paper/1708.02596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.02596"}},"official":null}},{"url":"/paper/camembert-a-tasty-french-language-model","slug":"camembert-a-tasty-french-language-model","title":"CamemBERT: a Tasty French Language Model","date":"2019-11-10","arxiv_id":"1911.03894","repositories_listed":8,"syntology":null},{"url":"/paper/a-neural-attention-model-for-speech-command","slug":"a-neural-attention-model-for-speech-command","title":"A neural attention model for speech command recognition","date":"2018-08-27","arxiv_id":"1808.08929","repositories_listed":8,"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/a-neural-attention-model-for-speech-command#ran","syntology_url":"https://syntology.ai/paper/1808.08929","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.08929"}},"official":{"repos":["douglas125/SpeechCmdRecognition"],"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/ghostfacenets-lightweight-face-recognition","slug":"ghostfacenets-lightweight-face-recognition","title":"GhostFaceNets: Lightweight Face Recognition Model From Cheap Operations","date":"2023-04-10","arxiv_id":null,"repositories_listed":7,"syntology":null},{"url":"/paper/flaubert-unsupervised-language-model-pre","slug":"flaubert-unsupervised-language-model-pre","title":"FlauBERT: Unsupervised Language Model Pre-training for French","date":"2019-12-11","arxiv_id":"1912.05372","repositories_listed":7,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/flaubert-unsupervised-language-model-pre#ran","syntology_url":"https://syntology.ai/paper/1912.05372","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.05372"}},"official":{"repos":["getalp/Flaubert"],"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/fedmd-heterogenous-federated-learning-via","slug":"fedmd-heterogenous-federated-learning-via","title":"FedMD: Heterogenous Federated Learning via Model Distillation","date":"2019-10-08","arxiv_id":"1910.03581","repositories_listed":7,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fedmd-heterogenous-federated-learning-via#ran","syntology_url":"https://syntology.ai/paper/1910.03581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03581"}},"official":null}},{"url":"/paper/flexivit-one-model-for-all-patch-sizes","slug":"flexivit-one-model-for-all-patch-sizes","title":"FlexiViT: One Model for All Patch Sizes","date":"2022-12-15","arxiv_id":"2212.08013","repositories_listed":6,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/flexivit-one-model-for-all-patch-sizes#ran","syntology_url":"https://syntology.ai/paper/2212.08013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.08013"}},"official":{"repos":["google-research/big_vision"],"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/model-contrastive-federated-learning","slug":"model-contrastive-federated-learning","title":"Model-Contrastive Federated Learning","date":"2021-03-30","arxiv_id":"2103.16257","repositories_listed":6,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/model-contrastive-federated-learning#ran","syntology_url":"https://syntology.ai/paper/2103.16257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16257"}},"official":{"repos":["adap/flower"],"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","named_in_paper"]}}},{"url":"/paper/fast-and-accurate-model-scaling","slug":"fast-and-accurate-model-scaling","title":"Fast and Accurate Model Scaling","date":"2021-03-11","arxiv_id":"2103.06877","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-and-accurate-model-scaling#ran","syntology_url":"https://syntology.ai/paper/2103.06877","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.06877"}},"official":{"repos":["facebookresearch/pycls"],"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/mopo-model-based-offline-policy-optimization","slug":"mopo-model-based-offline-policy-optimization","title":"MOPO: Model-based Offline Policy Optimization","date":"2020-05-27","arxiv_id":"2005.13239","repositories_listed":6,"syntology":{"n":8,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/mopo-model-based-offline-policy-optimization#ran","syntology_url":"https://syntology.ai/paper/2005.13239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.13239"}},"official":{"repos":["tianheyu927/mopo"],"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/octsqueeze-octree-structured-entropy-model","slug":"octsqueeze-octree-structured-entropy-model","title":"OctSqueeze: Octree-Structured Entropy Model for LiDAR Compression","date":"2020-05-14","arxiv_id":"2005.07178","repositories_listed":6,"syntology":null},{"url":"/paper/realm-retrieval-augmented-language-model-pre","slug":"realm-retrieval-augmented-language-model-pre","title":"REALM: Retrieval-Augmented Language Model Pre-Training","date":"2020-02-10","arxiv_id":"2002.08909","repositories_listed":6,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/realm-retrieval-augmented-language-model-pre#ran","syntology_url":"https://syntology.ai/paper/2002.08909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08909"}},"official":{"repos":["google-research/language"],"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/image-based-table-recognition-data-model-and","slug":"image-based-table-recognition-data-model-and","title":"Image-based table recognition: data, model, and evaluation","date":"2019-11-25","arxiv_id":"1911.10683","repositories_listed":6,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/image-based-table-recognition-data-model-and#ran","syntology_url":"https://syntology.ai/paper/1911.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.10683"}},"official":{"repos":["ibm-aur-nlp/PubTabNet"],"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/pseudolikelihood-reranking-with-masked","slug":"pseudolikelihood-reranking-with-masked","title":"Masked Language Model Scoring","date":"2019-10-31","arxiv_id":"1910.14659","repositories_listed":6,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pseudolikelihood-reranking-with-masked#ran","syntology_url":"https://syntology.ai/paper/1910.14659","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.14659"}},"official":{"repos":["awslabs/mlm-scoring"],"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/scibert-pretrained-contextualized-embeddings","slug":"scibert-pretrained-contextualized-embeddings","title":"SciBERT: A Pretrained Language Model for Scientific Text","date":"2019-03-26","arxiv_id":"1903.10676","repositories_listed":6,"syntology":null},{"url":"/paper/pixelsnail-an-improved-autoregressive","slug":"pixelsnail-an-improved-autoregressive","title":"PixelSNAIL: An Improved Autoregressive Generative Model","date":"2017-12-28","arxiv_id":"1712.09763","repositories_listed":6,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"6 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pixelsnail-an-improved-autoregressive#ran","syntology_url":"https://syntology.ai/paper/1712.09763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.09763"}},"official":{"repos":["neocxi/pixelsnail-public"],"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/kto-model-alignment-as-prospect-theoretic","slug":"kto-model-alignment-as-prospect-theoretic","title":"KTO: Model Alignment as Prospect Theoretic Optimization","date":"2024-02-02","arxiv_id":"2402.01306","repositories_listed":5,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"5 ran (of which 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) · 6 unverified","sample_list":"/paper/kto-model-alignment-as-prospect-theoretic#ran","syntology_url":"https://syntology.ai/paper/2402.01306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01306"}},"official":{"repos":["contextualai/halos"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/accelerating-large-language-model-decoding","slug":"accelerating-large-language-model-decoding","title":"Accelerating Large Language Model Decoding with Speculative Sampling","date":"2023-02-02","arxiv_id":"2302.01318","repositories_listed":5,"syntology":null},{"url":"/paper/patient-knowledge-distillation-for-bert-model","slug":"patient-knowledge-distillation-for-bert-model","title":"Patient Knowledge Distillation for BERT Model Compression","date":"2019-08-25","arxiv_id":"1908.09355","repositories_listed":5,"syntology":{"n":27,"n_ran":19,"n_constructed":0,"n_ran_checked":13,"n_instrument":6,"n_unverified":8,"n_honours":3,"n_violates":1,"n_no_contract":9,"n_pointer_only":27,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 1 violated, 9 with no contract checked; 6 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/patient-knowledge-distillation-for-bert-model#ran","syntology_url":"https://syntology.ai/paper/1908.09355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09355"}},"official":{"repos":["intersun/PKD-for-BERT-Model-Compression"],"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/ctcmodel-a-keras-model-for-connectionist","slug":"ctcmodel-a-keras-model-for-connectionist","title":"CTCModel: a Keras Model for Connectionist Temporal Classification","date":"2019-01-23","arxiv_id":"1901.07957","repositories_listed":5,"syntology":null},{"url":"/paper/sliced-wasserstein-autoencoder-an","slug":"sliced-wasserstein-autoencoder-an","title":"Sliced-Wasserstein Autoencoder: An Embarrassingly Simple Generative Model","date":"2018-04-05","arxiv_id":"1804.01947","repositories_listed":5,"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/sliced-wasserstein-autoencoder-an#ran","syntology_url":"https://syntology.ai/paper/1804.01947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.01947"}},"official":{"repos":["skolouri/swae"],"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/model-compression-via-distillation-and","slug":"model-compression-via-distillation-and","title":"Model compression via distillation and quantization","date":"2018-02-15","arxiv_id":"1802.05668","repositories_listed":5,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/model-compression-via-distillation-and#ran","syntology_url":"https://syntology.ai/paper/1802.05668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05668"}},"official":{"repos":["antspy/quantized_distillation"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deepbach-a-steerable-model-for-bach-chorales","slug":"deepbach-a-steerable-model-for-bach-chorales","title":"DeepBach: a Steerable Model for Bach Chorales Generation","date":"2016-12-03","arxiv_id":"1612.01010","repositories_listed":5,"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/deepbach-a-steerable-model-for-bach-chorales#ran","syntology_url":"https://syntology.ai/paper/1612.01010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.01010"}},"official":{"repos":["Ghadjeres/DeepBach"],"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/gated-word-character-recurrent-language-model","slug":"gated-word-character-recurrent-language-model","title":"Gated Word-Character Recurrent Language Model","date":"2016-06-06","arxiv_id":"1606.01700","repositories_listed":5,"syntology":null},{"url":"/paper/a-recurrent-latent-variable-model-for","slug":"a-recurrent-latent-variable-model-for","title":"A Recurrent Latent Variable Model for Sequential Data","date":"2015-06-07","arxiv_id":"1506.02216","repositories_listed":5,"syntology":null},{"url":"/paper/cosmos-world-foundation-model-platform-for","slug":"cosmos-world-foundation-model-platform-for","title":"Cosmos World Foundation Model Platform for Physical AI","date":"2025-01-07","arxiv_id":"2501.03575","repositories_listed":4,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cosmos-world-foundation-model-platform-for#ran","syntology_url":"https://syntology.ai/paper/2501.03575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.03575"}},"official":{"repos":["nvidia-cosmos/cosmos-predict1","nvidia/cosmos-tokenizer","nvlabs/tokenbench"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/weighted-reward-preference-optimization-for","slug":"weighted-reward-preference-optimization-for","title":"Weighted-Reward Preference Optimization for Implicit Model Fusion","date":"2024-12-04","arxiv_id":"2412.03187","repositories_listed":4,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":5,"n_honours":0,"n_violates":4,"n_no_contract":0,"n_pointer_only":14,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 4 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/weighted-reward-preference-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2412.03187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.03187"}},"official":{"repos":["SLIT-AI/WRPO"],"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/reference-free-monolithic-preference","slug":"reference-free-monolithic-preference","title":"ORPO: Monolithic Preference Optimization without Reference Model","date":"2024-03-12","arxiv_id":"2403.07691","repositories_listed":4,"syntology":{"n":14,"n_ran":11,"n_constructed":1,"n_ran_checked":9,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/reference-free-monolithic-preference#ran","syntology_url":"https://syntology.ai/paper/2403.07691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07691"}},"official":{"repos":["xfactlab/orpo"],"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":["listed","official"]}}},{"url":"/paper/repetition-improves-language-model-embeddings","slug":"repetition-improves-language-model-embeddings","title":"Repetition Improves Language Model Embeddings","date":"2024-02-23","arxiv_id":"2402.15449","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/repetition-improves-language-model-embeddings#ran","syntology_url":"https://syntology.ai/paper/2402.15449","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15449"}},"official":{"repos":["jakespringer/echo-embeddings"],"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":["listed","official"]}}},{"url":"/paper/algorithm-evolution-using-large-language","slug":"algorithm-evolution-using-large-language","title":"Algorithm Evolution Using Large Language Model","date":"2023-11-26","arxiv_id":"2311.15249","repositories_listed":4,"syntology":null},{"url":"/paper/llemma-an-open-language-model-for-mathematics","slug":"llemma-an-open-language-model-for-mathematics","title":"Llemma: An Open Language Model For Mathematics","date":"2023-10-16","arxiv_id":"2310.10631","repositories_listed":4,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/llemma-an-open-language-model-for-mathematics#ran","syntology_url":"https://syntology.ai/paper/2310.10631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10631"}},"official":{"repos":["EleutherAI/math-lm","eleutherai/gpt-neox","wellecks/llmstep"],"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":["listed","official"]}}},{"url":"/paper/few-shot-model-agnostic-federated-learning","slug":"few-shot-model-agnostic-federated-learning","title":"Few-Shot Model Agnostic Federated Learning","date":"2022-10-10","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/distilled-dual-encoder-model-for-vision","slug":"distilled-dual-encoder-model-for-vision","title":"Distilled Dual-Encoder Model for Vision-Language Understanding","date":"2021-12-16","arxiv_id":"2112.08723","repositories_listed":4,"syntology":null},{"url":"/paper/optimizing-dense-retrieval-model-training","slug":"optimizing-dense-retrieval-model-training","title":"Optimizing Dense Retrieval Model Training with Hard Negatives","date":"2021-04-16","arxiv_id":"2104.08051","repositories_listed":4,"syntology":null},{"url":"/paper/checkerboard-context-model-for-efficient","slug":"checkerboard-context-model-for-efficient","title":"Checkerboard Context Model for Efficient Learned Image Compression","date":"2021-03-29","arxiv_id":"2103.15306","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"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 1 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/checkerboard-context-model-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2103.15306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.15306"}},"official":null}},{"url":"/paper/combo-conservative-offline-model-based-policy","slug":"combo-conservative-offline-model-based-policy","title":"COMBO: Conservative Offline Model-Based Policy Optimization","date":"2021-02-16","arxiv_id":"2102.08363","repositories_listed":4,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/combo-conservative-offline-model-based-policy#ran","syntology_url":"https://syntology.ai/paper/2102.08363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.08363"}},"official":null}},{"url":"/paper/segfix-model-agnostic-boundary-refinement-for","slug":"segfix-model-agnostic-boundary-refinement-for","title":"SegFix: Model-Agnostic Boundary Refinement for Segmentation","date":"2020-07-08","arxiv_id":"2007.04269","repositories_listed":4,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/segfix-model-agnostic-boundary-refinement-for#ran","syntology_url":"https://syntology.ai/paper/2007.04269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04269"}},"official":{"repos":["openseg-group/openseg.pytorch"],"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/block-model-guided-unsupervised-feature","slug":"block-model-guided-unsupervised-feature","title":"Block Model Guided Unsupervised Feature Selection","date":"2020-07-05","arxiv_id":"2007.02376","repositories_listed":4,"syntology":null},{"url":"/paper/training-with-quantization-noise-for-extreme","slug":"training-with-quantization-noise-for-extreme","title":"Training with Quantization Noise for Extreme Model Compression","date":"2020-04-15","arxiv_id":"2004.07320","repositories_listed":4,"syntology":null},{"url":"/paper/arabert-transformer-based-model-for-arabic","slug":"arabert-transformer-based-model-for-arabic","title":"AraBERT: Transformer-based Model for Arabic Language Understanding","date":"2020-02-28","arxiv_id":"2003.00104","repositories_listed":4,"syntology":null},{"url":"/paper/multifit-efficient-multi-lingual-language","slug":"multifit-efficient-multi-lingual-language","title":"MultiFiT: Efficient Multi-lingual Language Model Fine-tuning","date":"2019-09-10","arxiv_id":"1909.04761","repositories_listed":4,"syntology":null},{"url":"/paper/an-unsupervised-autoregressive-model-for","slug":"an-unsupervised-autoregressive-model-for","title":"An Unsupervised Autoregressive Model for Speech Representation Learning","date":"2019-04-05","arxiv_id":"1904.03240","repositories_listed":4,"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":3,"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/an-unsupervised-autoregressive-model-for#ran","syntology_url":"https://syntology.ai/paper/1904.03240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.03240"}},"official":null}},{"url":"/paper/model-evaluation-model-selection-and","slug":"model-evaluation-model-selection-and","title":"Model Evaluation, Model Selection, and Algorithm Selection in Machine Learning","date":"2018-11-13","arxiv_id":"1811.12808","repositories_listed":4,"syntology":null},{"url":"/paper/did-the-model-understand-the-question","slug":"did-the-model-understand-the-question","title":"Did the Model Understand the Question?","date":"2018-05-14","arxiv_id":"1805.05492","repositories_listed":4,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/did-the-model-understand-the-question#ran","syntology_url":"https://syntology.ai/paper/1805.05492","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.05492"}},"official":{"repos":["pramodkaushik/acl18_results"],"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/personalized-language-model-for-query-auto","slug":"personalized-language-model-for-query-auto","title":"Personalized Language Model for Query Auto-Completion","date":"2018-04-25","arxiv_id":"1804.09661","repositories_listed":4,"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/personalized-language-model-for-query-auto#ran","syntology_url":"https://syntology.ai/paper/1804.09661","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.09661"}},"official":{"repos":["ajaech/query_completion"],"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/training-tips-for-the-transformer-model","slug":"training-tips-for-the-transformer-model","title":"Training Tips for the Transformer Model","date":"2018-04-01","arxiv_id":"1804.00247","repositories_listed":4,"syntology":null},{"url":"/paper/a-neural-attention-model-for-abstractive","slug":"a-neural-attention-model-for-abstractive","title":"A Neural Attention Model for Abstractive Sentence Summarization","date":"2015-09-02","arxiv_id":"1509.00685","repositories_listed":4,"syntology":null},{"url":"/paper/a-convolutional-click-prediction-model-1","slug":"a-convolutional-click-prediction-model-1","title":"A Convolutional Click Prediction Model","date":"2015-01-01","arxiv_id":null,"repositories_listed":4,"syntology":null},{"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":7,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 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; 1 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/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/generalized-predictive-model-for-autonomous","slug":"generalized-predictive-model-for-autonomous","title":"GenAD: Generalized Predictive Model for Autonomous Driving","date":"2024-03-14","arxiv_id":"2403.09630","repositories_listed":3,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generalized-predictive-model-for-autonomous#ran","syntology_url":"https://syntology.ai/paper/2403.09630","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09630"}},"official":{"repos":["opendrivelab/driveagi"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/representation-surgery-for-multi-task-model","slug":"representation-surgery-for-multi-task-model","title":"Representation Surgery for Multi-Task Model Merging","date":"2024-02-05","arxiv_id":"2402.02705","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/representation-surgery-for-multi-task-model#ran","syntology_url":"https://syntology.ai/paper/2402.02705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02705"}},"official":{"repos":["ennengyang/representationsurgery"],"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":["listed","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/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/context-aware-sequential-model-for-multi","slug":"context-aware-sequential-model-for-multi","title":"Context-Aware Sequential Model for Multi-Behaviour Recommendation","date":"2023-12-15","arxiv_id":"2312.09684","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":4,"n_instrument":8,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"12 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; 8 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":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"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/edgeface-efficient-face-recognition-model-for","slug":"edgeface-efficient-face-recognition-model-for","title":"EdgeFace: Efficient Face Recognition Model for Edge Devices","date":"2023-07-04","arxiv_id":"2307.01838","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/edgeface-efficient-face-recognition-model-for#ran","syntology_url":"https://syntology.ai/paper/2307.01838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.01838"}},"official":{"repos":["otroshi/edgeface"],"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/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/robust-classification-via-a-single-diffusion","slug":"robust-classification-via-a-single-diffusion","title":"Robust Classification via a Single Diffusion Model","date":"2023-05-24","arxiv_id":"2305.15241","repositories_listed":3,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/robust-classification-via-a-single-diffusion#ran","syntology_url":"https://syntology.ai/paper/2305.15241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15241"}},"official":{"repos":["huanranchen/diffusionclassifier","huanranchen/AdversarialAttacks"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/llama-adapter-v2-parameter-efficient-visual","slug":"llama-adapter-v2-parameter-efficient-visual","title":"LLaMA-Adapter V2: Parameter-Efficient Visual Instruction Model","date":"2023-04-28","arxiv_id":"2304.15010","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/llama-adapter-v2-parameter-efficient-visual#ran","syntology_url":"https://syntology.ai/paper/2304.15010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.15010"}},"official":{"repos":["zrrskywalker/llama-adapter"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"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/raf-holistic-compilation-for-deep-learning","slug":"raf-holistic-compilation-for-deep-learning","title":"RAF: Holistic Compilation for Deep Learning Model Training","date":"2023-03-08","arxiv_id":"2303.04759","repositories_listed":3,"syntology":null},{"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/fedrolex-model-heterogeneous-federated","slug":"fedrolex-model-heterogeneous-federated","title":"FedRolex: Model-Heterogeneous Federated Learning with Rolling Sub-Model Extraction","date":"2022-12-03","arxiv_id":"2212.01548","repositories_listed":3,"syntology":{"n":15,"n_ran":7,"n_constructed":2,"n_ran_checked":4,"n_instrument":3,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/fedrolex-model-heterogeneous-federated#ran","syntology_url":"https://syntology.ai/paper/2212.01548","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.01548"}},"official":{"repos":["aiot-mlsys-lab/fedrolex","msu-mlsys-lab/fedrolex"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/diffusiondet-diffusion-model-for-object","slug":"diffusiondet-diffusion-model-for-object","title":"DiffusionDet: Diffusion Model for Object Detection","date":"2022-11-17","arxiv_id":"2211.09788","repositories_listed":3,"syntology":null},{"url":"/paper/global-explanation-of-tree-ensembles-models","slug":"global-explanation-of-tree-ensembles-models","title":"Explanations Based on Item Response Theory (eXirt): A Model-Specific Method to Explain Tree-Ensemble Model in Trust Perspective","date":"2022-10-18","arxiv_id":"2210.09933","repositories_listed":3,"syntology":null},{"url":"/paper/improving-diffusion-model-efficiency-through","slug":"improving-diffusion-model-efficiency-through","title":"Improving Diffusion Model Efficiency Through Patching","date":"2022-07-09","arxiv_id":"2207.04316","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":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/improving-diffusion-model-efficiency-through#ran","syntology_url":"https://syntology.ai/paper/2207.04316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.04316"}},"official":{"repos":["ericl122333/patchdiffusion-pytorch","ericl122333/patchdiffusion-tf"],"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/parameter-efficient-fine-tuning-for-vision","slug":"parameter-efficient-fine-tuning-for-vision","title":"Parameter-efficient Model Adaptation for Vision Transformers","date":"2022-03-29","arxiv_id":"2203.16329","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":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/parameter-efficient-fine-tuning-for-vision#ran","syntology_url":"https://syntology.ai/paper/2203.16329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.16329"}},"official":{"repos":["eric-ai-lab/pevit"],"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/dag-card-is-the-new-model-card","slug":"dag-card-is-the-new-model-card","title":"DAG Card is the new Model Card","date":"2021-10-24","arxiv_id":"2110.13601","repositories_listed":3,"syntology":{"n":25,"n_ran":18,"n_constructed":0,"n_ran_checked":17,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/dag-card-is-the-new-model-card#ran","syntology_url":"https://syntology.ai/paper/2110.13601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13601"}},"official":{"repos":["jacopotagliabue/dag-card-is-the-new-model-card"],"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":["found_in_text","listed","official"]}}},{"url":"/paper/fast-model-editing-at-scale-1","slug":"fast-model-editing-at-scale-1","title":"Fast Model Editing at Scale","date":"2021-10-21","arxiv_id":"2110.11309","repositories_listed":3,"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/fast-model-editing-at-scale-1#ran","syntology_url":"https://syntology.ai/paper/2110.11309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.11309"}},"official":{"repos":["eric-mitchell/mend"],"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/a-temporal-variational-model-for-story","slug":"a-temporal-variational-model-for-story","title":"A Temporal Variational Model for Story Generation","date":"2021-09-14","arxiv_id":"2109.06807","repositories_listed":3,"syntology":null},{"url":"/paper/morocco-model-resource-comparison-framework","slug":"morocco-model-resource-comparison-framework","title":"MOROCCO: Model Resource Comparison Framework","date":"2021-04-29","arxiv_id":"2104.14314","repositories_listed":3,"syntology":null},{"url":"/paper/zero-offload-democratizing-billion-scale","slug":"zero-offload-democratizing-billion-scale","title":"ZeRO-Offload: Democratizing Billion-Scale Model Training","date":"2021-01-18","arxiv_id":"2101.06840","repositories_listed":3,"syntology":null},{"url":"/paper/personalized-federated-learning-with-first-1","slug":"personalized-federated-learning-with-first-1","title":"Personalized Federated Learning with First Order Model Optimization","date":"2020-12-15","arxiv_id":"2012.08565","repositories_listed":3,"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/personalized-federated-learning-with-first-1#ran","syntology_url":"https://syntology.ai/paper/2012.08565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.08565"}},"official":{"repos":["NVlabs/FedFomo"],"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/rewriting-a-deep-generative-model","slug":"rewriting-a-deep-generative-model","title":"Rewriting a Deep Generative Model","date":"2020-07-30","arxiv_id":"2007.15646","repositories_listed":3,"syntology":{"n":23,"n_ran":18,"n_constructed":0,"n_ran_checked":13,"n_instrument":5,"n_unverified":5,"n_honours":4,"n_violates":1,"n_no_contract":8,"n_pointer_only":5,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 4 honoured, 1 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/rewriting-a-deep-generative-model#ran","syntology_url":"https://syntology.ai/paper/2007.15646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15646"}},"official":{"repos":["davidbau/rewriting"],"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":["listed","official"]}}},{"url":"/paper/interpretable-meta-measure-for-model","slug":"interpretable-meta-measure-for-model","title":"Interpretable Meta-Measure for Model Performance","date":"2020-06-02","arxiv_id":"2006.02293","repositories_listed":3,"syntology":null},{"url":"/paper/parsbert-transformer-based-model-for-persian","slug":"parsbert-transformer-based-model-for-persian","title":"ParsBERT: Transformer-based Model for Persian Language Understanding","date":"2020-05-26","arxiv_id":"2005.12515","repositories_listed":3,"syntology":null},{"url":"/paper/am-mobilenet1d-a-portable-model-for-speaker","slug":"am-mobilenet1d-a-portable-model-for-speaker","title":"AM-MobileNet1D: A Portable Model for Speaker Recognition","date":"2020-03-31","arxiv_id":"2004.00132","repositories_listed":3,"syntology":null},{"url":"/paper/model-based-asynchronous-hyperparameter","slug":"model-based-asynchronous-hyperparameter","title":"Model-based Asynchronous Hyperparameter and Neural Architecture Search","date":"2020-03-24","arxiv_id":"2003.10865","repositories_listed":3,"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/model-based-asynchronous-hyperparameter#ran","syntology_url":"https://syntology.ai/paper/2003.10865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.10865"}},"official":{"repos":["awslabs/syne-tune"],"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"]}}}],"syntology_records":61,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":517,"papers_where_code_ran_first_page":"/task/model/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"archive","page":2,"of":55,"url":"/task/model/papers/2","json":"/task/model/papers/2.json","rows":100},{"order":"archive","page":3,"of":55,"url":"/task/model/papers/3","json":"/task/model/papers/3.json","rows":100},{"order":"archive","page":4,"of":55,"url":"/task/model/papers/4","json":"/task/model/papers/4.json","rows":100},{"order":"archive","page":5,"of":55,"url":"/task/model/papers/5","json":"/task/model/papers/5.json","rows":100},{"order":"archive","page":6,"of":55,"url":"/task/model/papers/6","json":"/task/model/papers/6.json","rows":100},{"order":"archive","page":7,"of":55,"url":"/task/model/papers/7","json":"/task/model/papers/7.json","rows":100},{"order":"archive","page":8,"of":55,"url":"/task/model/papers/8","json":"/task/model/papers/8.json","rows":100},{"order":"archive","page":9,"of":55,"url":"/task/model/papers/9","json":"/task/model/papers/9.json","rows":100},{"order":"archive","page":10,"of":55,"url":"/task/model/papers/10","json":"/task/model/papers/10.json","rows":100},{"order":"archive","page":11,"of":55,"url":"/task/model/papers/11","json":"/task/model/papers/11.json","rows":100},{"order":"archive","page":12,"of":55,"url":"/task/model/papers/12","json":"/task/model/papers/12.json","rows":100},{"order":"archive","page":13,"of":55,"url":"/task/model/papers/13","json":"/task/model/papers/13.json","rows":100},{"order":"archive","page":14,"of":55,"url":"/task/model/papers/14","json":"/task/model/papers/14.json","rows":100},{"order":"archive","page":15,"of":55,"url":"/task/model/papers/15","json":"/task/model/papers/15.json","rows":100},{"order":"archive","page":16,"of":55,"url":"/task/model/papers/16","json":"/task/model/papers/16.json","rows":100},{"order":"archive","page":17,"of":55,"url":"/task/model/papers/17","json":"/task/model/papers/17.json","rows":100},{"order":"archive","page":18,"of":55,"url":"/task/model/papers/18","json":"/task/model/papers/18.json","rows":100},{"order":"archive","page":19,"of":55,"url":"/task/model/papers/19","json":"/task/model/papers/19.json","rows":100},{"order":"archive","page":20,"of":55,"url":"/task/model/papers/20","json":"/task/model/papers/20.json","rows":100},{"order":"archive","page":21,"of":55,"url":"/task/model/papers/21","json":"/task/model/papers/21.json","rows":100},{"order":"archive","page":22,"of":55,"url":"/task/model/papers/22","json":"/task/model/papers/22.json","rows":100},{"order":"archive","page":23,"of":55,"url":"/task/model/papers/23","json":"/task/model/papers/23.json","rows":100},{"order":"archive","page":24,"of":55,"url":"/task/model/papers/24","json":"/task/model/papers/24.json","rows":100},{"order":"archive","page":25,"of":55,"url":"/task/model/papers/25","json":"/task/model/papers/25.json","rows":100},{"order":"archive","page":26,"of":55,"url":"/task/model/papers/26","json":"/task/model/papers/26.json","rows":100},{"order":"archive","page":27,"of":55,"url":"/task/model/papers/27","json":"/task/model/papers/27.json","rows":100},{"order":"archive","page":28,"of":55,"url":"/task/model/papers/28","json":"/task/model/papers/28.json","rows":100},{"order":"archive","page":29,"of":55,"url":"/task/model/papers/29","json":"/task/model/papers/29.json","rows":100},{"order":"archive","page":30,"of":55,"url":"/task/model/papers/30","json":"/task/model/papers/30.json","rows":100},{"order":"archive","page":31,"of":55,"url":"/task/model/papers/31","json":"/task/model/papers/31.json","rows":100},{"order":"archive","page":32,"of":55,"url":"/task/model/papers/32","json":"/task/model/papers/32.json","rows":100},{"order":"archive","page":33,"of":55,"url":"/task/model/papers/33","json":"/task/model/papers/33.json","rows":100},{"order":"archive","page":34,"of":55,"url":"/task/model/papers/34","json":"/task/model/papers/34.json","rows":100},{"order":"archive","page":35,"of":55,"url":"/task/model/papers/35","json":"/task/model/papers/35.json","rows":100},{"order":"archive","page":36,"of":55,"url":"/task/model/papers/36","json":"/task/model/papers/36.json","rows":100},{"order":"archive","page":37,"of":55,"url":"/task/model/papers/37","json":"/task/model/papers/37.json","rows":100},{"order":"archive","page":38,"of":55,"url":"/task/model/papers/38","json":"/task/model/papers/38.json","rows":100},{"order":"archive","page":39,"of":55,"url":"/task/model/papers/39","json":"/task/model/papers/39.json","rows":100},{"order":"archive","page":40,"of":55,"url":"/task/model/papers/40","json":"/task/model/papers/40.json","rows":100},{"order":"archive","page":41,"of":55,"url":"/task/model/papers/41","json":"/task/model/papers/41.json","rows":100},{"order":"archive","page":42,"of":55,"url":"/task/model/papers/42","json":"/task/model/papers/42.json","rows":100},{"order":"archive","page":43,"of":55,"url":"/task/model/papers/43","json":"/task/model/papers/43.json","rows":100},{"order":"archive","page":44,"of":55,"url":"/task/model/papers/44","json":"/task/model/papers/44.json","rows":100},{"order":"archive","page":45,"of":55,"url":"/task/model/papers/45","json":"/task/model/papers/45.json","rows":100},{"order":"archive","page":46,"of":55,"url":"/task/model/papers/46","json":"/task/model/papers/46.json","rows":100},{"order":"archive","page":47,"of":55,"url":"/task/model/papers/47","json":"/task/model/papers/47.json","rows":100},{"order":"archive","page":48,"of":55,"url":"/task/model/papers/48","json":"/task/model/papers/48.json","rows":100},{"order":"archive","page":49,"of":55,"url":"/task/model/papers/49","json":"/task/model/papers/49.json","rows":100},{"order":"archive","page":50,"of":55,"url":"/task/model/papers/50","json":"/task/model/papers/50.json","rows":100},{"order":"archive","page":51,"of":55,"url":"/task/model/papers/51","json":"/task/model/papers/51.json","rows":100},{"order":"archive","page":52,"of":55,"url":"/task/model/papers/52","json":"/task/model/papers/52.json","rows":100},{"order":"archive","page":53,"of":55,"url":"/task/model/papers/53","json":"/task/model/papers/53.json","rows":100},{"order":"archive","page":54,"of":55,"url":"/task/model/papers/54","json":"/task/model/papers/54.json","rows":100},{"order":"archive","page":55,"of":55,"url":"/task/model/papers/55","json":"/task/model/papers/55.json","rows":34},{"order":"ran","page":1,"of":6,"url":"/task/model/papers/ran/1","json":"/task/model/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":6,"url":"/task/model/papers/ran/2","json":"/task/model/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":6,"url":"/task/model/papers/ran/3","json":"/task/model/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":6,"url":"/task/model/papers/ran/4","json":"/task/model/papers/ran/4.json","rows":100},{"order":"ran","page":5,"of":6,"url":"/task/model/papers/ran/5","json":"/task/model/papers/ran/5.json","rows":100},{"order":"ran","page":6,"of":6,"url":"/task/model/papers/ran/6","json":"/task/model/papers/ran/6.json","rows":17}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"f23142e2d34238cd345a075ba1b4075a89e646af1b45d4a3c42b7c5c1eb6817a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}