{"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/computational-efficiency","name":"Computational Efficiency","slug":"computational-efficiency","description_markdown":"Methods and optimizations to reduce the computational resources (e.g., time, memory, or power) needed for training and inference in models. This involves techniques that streamline processing, optimize algorithms, or leverage hardware to enhance performance without compromising accuracy.","categories":[{"name":"Methodology","url":"/area/methodology"},{"name":"Miscellaneous","url":"/area/miscellaneous"},{"name":"Time Series","url":"/area/time-series"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":4891,"papers_with_code":1644,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":[{"leaderboard":"/sota/computational-efficiency-on-plant-village","slug":"computational-efficiency-on-plant-village","dataset":"Plant village","dataset_url":null,"rows_in_archive":1,"metrics":["Hamming Loss"],"first_row_in_archive_order":{"model":"ViTaL","paper_title":"ViTaL: An Advanced Framework for Automated Plant Disease Identification in Leaf Images Using Vision Transformers and Linear Projection For Feature Reduction","paper_url":"/paper/vital-an-advanced-framework-for-automated","paper_date":"2024-02-27","arxiv_id":"2402.17424","code_links":[{"title":"abby1712/ViTaL","url":"https://github.com/abby1712/ViTaL"}],"syntology":null}}],"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":49,"rows_per_page":100,"shown":100,"of":4891,"of_with_code":1644,"tagged_in_all":4891,"counts":{"archive_papers_tagged":4891,"with_a_code_link":1644,"where_syntology_ran_a_sample":369,"not_listed_spam_title":0,"listed":4891,"listed_where_code_ran":369,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":300,"every_run_a_failure_of_syntologys_instrument":69,"listed_with_a_run_with_no_instrument_failure":300,"listed_every_run_a_failure_of_syntologys_instrument":69,"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/rethinking-the-inception-architecture-for","slug":"rethinking-the-inception-architecture-for","title":"Rethinking the Inception Architecture for Computer Vision","date":"2015-12-02","arxiv_id":"1512.00567","repositories_listed":113,"syntology":{"n":26,"n_ran":20,"n_constructed":0,"n_ran_checked":19,"n_instrument":1,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":17,"n_pointer_only":5,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 2 honoured, 0 violated, 17 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/rethinking-the-inception-architecture-for#ran","syntology_url":"https://syntology.ai/paper/1512.00567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1512.00567"}},"official":null}},{"url":"/paper/attention-u-net-learning-where-to-look-for","slug":"attention-u-net-learning-where-to-look-for","title":"Attention U-Net: Learning Where to Look for the Pancreas","date":"2018-04-11","arxiv_id":"1804.03999","repositories_listed":37,"syntology":{"n":28,"n_ran":23,"n_constructed":0,"n_ran_checked":15,"n_instrument":8,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":7,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 8 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/attention-u-net-learning-where-to-look-for#ran","syntology_url":"https://syntology.ai/paper/1804.03999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.03999"}},"official":{"repos":["ozan-oktay/Attention-Gated-Networks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/mamba-linear-time-sequence-modeling-with","slug":"mamba-linear-time-sequence-modeling-with","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","date":"2023-12-01","arxiv_id":"2312.00752","repositories_listed":35,"syntology":{"n":62,"n_ran":28,"n_constructed":7,"n_ran_checked":20,"n_instrument":8,"n_unverified":34,"n_honours":0,"n_violates":0,"n_no_contract":20,"n_pointer_only":29,"phrase":"28 ran (of which 7 constructed an object rather than computing a result; 20 with no instrument failure: 0 honoured, 0 violated, 20 with no contract checked; 8 where Syntology's instrument failed) · 34 unverified","sample_list":"/paper/mamba-linear-time-sequence-modeling-with#ran","syntology_url":"https://syntology.ai/paper/2312.00752","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.00752"}},"official":{"repos":["state-spaces/mamba","radarFudan/mamba"],"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/efficientad-accurate-visual-anomaly-detection","slug":"efficientad-accurate-visual-anomaly-detection","title":"EfficientAD: Accurate Visual Anomaly Detection at Millisecond-Level Latencies","date":"2023-03-25","arxiv_id":"2303.14535","repositories_listed":33,"syntology":{"n":35,"n_ran":29,"n_constructed":0,"n_ran_checked":29,"n_instrument":0,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":28,"n_pointer_only":0,"phrase":"29 ran (of which 0 constructed an object rather than computing a result; 29 with no instrument failure: 1 honoured, 0 violated, 28 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/efficientad-accurate-visual-anomaly-detection#ran","syntology_url":"https://syntology.ai/paper/2303.14535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.14535"}},"official":null}},{"url":"/paper/simple-random-search-provides-a-competitive","slug":"simple-random-search-provides-a-competitive","title":"Simple random search provides a competitive approach to reinforcement learning","date":"2018-03-19","arxiv_id":"1803.07055","repositories_listed":26,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/simple-random-search-provides-a-competitive#ran","syntology_url":"https://syntology.ai/paper/1803.07055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.07055"}},"official":{"repos":["modestyachts/ARS"],"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/efficient-neural-network-robustness","slug":"efficient-neural-network-robustness","title":"Efficient Neural Network Robustness Certification with General Activation Functions","date":"2018-11-02","arxiv_id":"1811.00866","repositories_listed":16,"syntology":{"n":43,"n_ran":33,"n_constructed":0,"n_ran_checked":31,"n_instrument":2,"n_unverified":10,"n_honours":2,"n_violates":0,"n_no_contract":29,"n_pointer_only":3,"phrase":"33 ran (of which 0 constructed an object rather than computing a result; 31 with no instrument failure: 2 honoured, 0 violated, 29 with no contract checked; 2 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/efficient-neural-network-robustness#ran","syntology_url":"https://syntology.ai/paper/1811.00866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.00866"}},"official":{"repos":["huanzhang12/CROWN-Robustness-Certification"],"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/rwkv-reinventing-rnns-for-the-transformer-era","slug":"rwkv-reinventing-rnns-for-the-transformer-era","title":"RWKV: Reinventing RNNs for the Transformer Era","date":"2023-05-22","arxiv_id":"2305.13048","repositories_listed":14,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/rwkv-reinventing-rnns-for-the-transformer-era#ran","syntology_url":"https://syntology.ai/paper/2305.13048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13048"}},"official":{"repos":["BlinkDL/RWKV-LM","blinkdl/chatrwkv"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"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/kimera-an-open-source-library-for-real-time","slug":"kimera-an-open-source-library-for-real-time","title":"Kimera: an Open-Source Library for Real-Time Metric-Semantic Localization and Mapping","date":"2019-10-06","arxiv_id":"1910.02490","repositories_listed":12,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/kimera-an-open-source-library-for-real-time#ran","syntology_url":"https://syntology.ai/paper/1910.02490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02490"}},"official":{"repos":["MIT-SPARK/Kimera"],"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/resurrecting-recurrent-neural-networks-for","slug":"resurrecting-recurrent-neural-networks-for","title":"Resurrecting Recurrent Neural Networks for Long Sequences","date":"2023-03-11","arxiv_id":"2303.06349","repositories_listed":11,"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/resurrecting-recurrent-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2303.06349","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.06349"}},"official":null}},{"url":"/paper/pp-ocr-a-practical-ultra-lightweight-ocr","slug":"pp-ocr-a-practical-ultra-lightweight-ocr","title":"PP-OCR: A Practical Ultra Lightweight OCR System","date":"2020-09-21","arxiv_id":"2009.09941","repositories_listed":10,"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/pp-ocr-a-practical-ultra-lightweight-ocr#ran","syntology_url":"https://syntology.ai/paper/2009.09941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.09941"}},"official":{"repos":["PaddlePaddle/PaddleOCR"],"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/pointnetlk-robust-efficient-point-cloud","slug":"pointnetlk-robust-efficient-point-cloud","title":"PointNetLK: Robust & Efficient Point Cloud Registration using PointNet","date":"2019-03-13","arxiv_id":"1903.05711","repositories_listed":7,"syntology":{"n":24,"n_ran":20,"n_constructed":0,"n_ran_checked":18,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":18,"n_pointer_only":22,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 0 violated, 18 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/pointnetlk-robust-efficient-point-cloud#ran","syntology_url":"https://syntology.ai/paper/1903.05711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.05711"}},"official":{"repos":["hmgoforth/PointNetLK"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/scalable-bayesian-rule-lists","slug":"scalable-bayesian-rule-lists","title":"Scalable Bayesian Rule Lists","date":"2016-02-27","arxiv_id":"1602.08610","repositories_listed":7,"syntology":null},{"url":"/paper/dnabert-2-efficient-foundation-model-and","slug":"dnabert-2-efficient-foundation-model-and","title":"DNABERT-2: Efficient Foundation Model and Benchmark For Multi-Species Genome","date":"2023-06-26","arxiv_id":"2306.15006","repositories_listed":6,"syntology":{"n":23,"n_ran":13,"n_constructed":0,"n_ran_checked":9,"n_instrument":4,"n_unverified":10,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/dnabert-2-efficient-foundation-model-and#ran","syntology_url":"https://syntology.ai/paper/2306.15006","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.15006"}},"official":{"repos":["magics-lab/dnabert_2","zhihan1996/dnabert_2"],"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/simplified-state-space-layers-for-sequence","slug":"simplified-state-space-layers-for-sequence","title":"Simplified State Space Layers for Sequence Modeling","date":"2022-08-09","arxiv_id":"2208.04933","repositories_listed":6,"syntology":{"n":19,"n_ran":13,"n_constructed":0,"n_ran_checked":8,"n_instrument":5,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":6,"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) · 6 unverified","sample_list":"/paper/simplified-state-space-layers-for-sequence#ran","syntology_url":"https://syntology.ai/paper/2208.04933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.04933"}},"official":{"repos":["lindermanlab/S5"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-transformer-based-framework-for-1","slug":"a-transformer-based-framework-for-1","title":"A Transformer-based Framework for Multivariate Time Series Representation Learning","date":"2020-10-06","arxiv_id":"2010.02803","repositories_listed":6,"syntology":{"n":32,"n_ran":23,"n_constructed":0,"n_ran_checked":19,"n_instrument":4,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":19,"n_pointer_only":6,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 0 honoured, 0 violated, 19 with no contract checked; 4 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/a-transformer-based-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/2010.02803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02803"}},"official":{"repos":["gzerveas/mvts_transformer"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/cluster-gcn-an-efficient-algorithm-for","slug":"cluster-gcn-an-efficient-algorithm-for","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","date":"2019-05-20","arxiv_id":"1905.07953","repositories_listed":6,"syntology":null},{"url":"/paper/continual-learning-through-synaptic","slug":"continual-learning-through-synaptic","title":"Continual Learning Through Synaptic Intelligence","date":"2017-03-13","arxiv_id":"1703.04200","repositories_listed":6,"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/continual-learning-through-synaptic#ran","syntology_url":"https://syntology.ai/paper/1703.04200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04200"}},"official":{"repos":["ganguli-lab/pathint"],"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/reinforce-a-simple-and-efficient-approach-for","slug":"reinforce-a-simple-and-efficient-approach-for","title":"REINFORCE++: A Simple and Efficient Approach for Aligning Large Language Models","date":"2025-01-04","arxiv_id":"2501.03262","repositories_listed":5,"syntology":null},{"url":"/paper/convmae-masked-convolution-meets-masked","slug":"convmae-masked-convolution-meets-masked","title":"ConvMAE: Masked Convolution Meets Masked Autoencoders","date":"2022-05-08","arxiv_id":"2205.03892","repositories_listed":5,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":5,"n_pointer_only":4,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 2 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/convmae-masked-convolution-meets-masked#ran","syntology_url":"https://syntology.ai/paper/2205.03892","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.03892"}},"official":{"repos":["alpha-vl/convmae"],"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/multi-level-wavelet-cnn-for-image-restoration","slug":"multi-level-wavelet-cnn-for-image-restoration","title":"Multi-level Wavelet-CNN for Image Restoration","date":"2018-05-18","arxiv_id":"1805.07071","repositories_listed":5,"syntology":null},{"url":"/paper/graphgan-graph-representation-learning-with","slug":"graphgan-graph-representation-learning-with","title":"GraphGAN: Graph Representation Learning with Generative Adversarial Nets","date":"2017-11-22","arxiv_id":"1711.08267","repositories_listed":5,"syntology":null},{"url":"/paper/distribution-free-predictive-inference-for","slug":"distribution-free-predictive-inference-for","title":"Distribution-Free Predictive Inference For Regression","date":"2016-04-14","arxiv_id":"1604.04173","repositories_listed":5,"syntology":null},{"url":"/paper/towards-good-practices-for-very-deep-two","slug":"towards-good-practices-for-very-deep-two","title":"Towards Good Practices for Very Deep Two-Stream ConvNets","date":"2015-07-08","arxiv_id":"1507.02159","repositories_listed":5,"syntology":null},{"url":"/paper/high-performance-training-and-inference-for","slug":"high-performance-training-and-inference-for","title":"High-performance training and inference for deep equivariant interatomic potentials","date":"2025-04-22","arxiv_id":"2504.16068","repositories_listed":4,"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/high-performance-training-and-inference-for#ran","syntology_url":"https://syntology.ai/paper/2504.16068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.16068"}},"official":{"repos":["mir-group/allegro","mir-group/nequip"],"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/comet-fine-grained-computation-communication","slug":"comet-fine-grained-computation-communication","title":"Comet: Fine-grained Computation-communication Overlapping for Mixture-of-Experts","date":"2025-02-27","arxiv_id":"2502.19811","repositories_listed":4,"syntology":{"n":20,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 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; 1 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/comet-fine-grained-computation-communication#ran","syntology_url":"https://syntology.ai/paper/2502.19811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19811"}},"official":{"repos":["bytedance/flux"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":11,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/simba-simplicity-bias-for-scaling-up","slug":"simba-simplicity-bias-for-scaling-up","title":"SimBa: Simplicity Bias for Scaling Up Parameters in Deep Reinforcement Learning","date":"2024-10-13","arxiv_id":"2410.09754","repositories_listed":4,"syntology":{"n":6,"n_ran":6,"n_constructed":2,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simba-simplicity-bias-for-scaling-up#ran","syntology_url":"https://syntology.ai/paper/2410.09754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09754"}},"official":{"repos":["sonyresearch/simba"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/u-net-v2-rethinking-the-skip-connections-of-u","slug":"u-net-v2-rethinking-the-skip-connections-of-u","title":"U-Net v2: Rethinking the Skip Connections of U-Net for Medical Image Segmentation","date":"2023-11-29","arxiv_id":"2311.17791","repositories_listed":4,"syntology":null},{"url":"/paper/vocos-closing-the-gap-between-time-domain-and","slug":"vocos-closing-the-gap-between-time-domain-and","title":"Vocos: Closing the gap between time-domain and Fourier-based neural vocoders for high-quality audio synthesis","date":"2023-06-01","arxiv_id":"2306.00814","repositories_listed":4,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"10 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; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/vocos-closing-the-gap-between-time-domain-and#ran","syntology_url":"https://syntology.ai/paper/2306.00814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.00814"}},"official":{"repos":["gemelo-ai/vocos"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/audioldm-text-to-audio-generation-with-latent","slug":"audioldm-text-to-audio-generation-with-latent","title":"AudioLDM: Text-to-Audio Generation with Latent Diffusion Models","date":"2023-01-29","arxiv_id":"2301.12503","repositories_listed":4,"syntology":{"n":21,"n_ran":16,"n_constructed":1,"n_ran_checked":11,"n_instrument":5,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":9,"n_pointer_only":12,"phrase":"16 ran (of which 1 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 1 violated, 9 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/audioldm-text-to-audio-generation-with-latent#ran","syntology_url":"https://syntology.ai/paper/2301.12503","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12503"}},"official":{"repos":["haoheliu/AudioLDM"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["named_in_paper","official"]}}},{"url":"/paper/efficient-aggregated-kernel-tests-using","slug":"efficient-aggregated-kernel-tests-using","title":"Efficient Aggregated Kernel Tests using Incomplete $U$-statistics","date":"2022-06-18","arxiv_id":"2206.09194","repositories_listed":4,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":4,"n_instrument":6,"n_unverified":3,"n_honours":4,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/efficient-aggregated-kernel-tests-using#ran","syntology_url":"https://syntology.ai/paper/2206.09194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09194"}},"official":{"repos":["antoninschrab/ksdagg"],"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","named_in_paper","official"]}}},{"url":"/paper/davit-dual-attention-vision-transformers","slug":"davit-dual-attention-vision-transformers","title":"DaViT: Dual Attention Vision Transformers","date":"2022-04-07","arxiv_id":"2204.03645","repositories_listed":4,"syntology":{"n":15,"n_ran":8,"n_constructed":5,"n_ran_checked":6,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/davit-dual-attention-vision-transformers#ran","syntology_url":"https://syntology.ai/paper/2204.03645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.03645"}},"official":{"repos":["dingmyu/davit"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/tsa-net-tube-self-attention-network-for","slug":"tsa-net-tube-self-attention-network-for","title":"TSA-Net: Tube Self-Attention Network for Action Quality Assessment","date":"2022-01-11","arxiv_id":"2201.03746","repositories_listed":4,"syntology":null},{"url":"/paper/output-space-entropy-search-framework-for","slug":"output-space-entropy-search-framework-for","title":"Output Space Entropy Search Framework for Multi-Objective Bayesian Optimization","date":"2021-10-13","arxiv_id":"2110.06980","repositories_listed":4,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/output-space-entropy-search-framework-for#ran","syntology_url":"https://syntology.ai/paper/2110.06980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.06980"}},"official":{"repos":["belakaria/MESMO","belakaria/MESMOC","belakaria/imoca","belakaria/mf-osemo"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/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/patch-netvlad-multi-scale-fusion-of-locally","slug":"patch-netvlad-multi-scale-fusion-of-locally","title":"Patch-NetVLAD: Multi-Scale Fusion of Locally-Global Descriptors for Place Recognition","date":"2021-03-02","arxiv_id":"2103.01486","repositories_listed":4,"syntology":{"n":5,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/patch-netvlad-multi-scale-fusion-of-locally#ran","syntology_url":"https://syntology.ai/paper/2103.01486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.01486"}},"official":{"repos":["QVPR/Patch-NetVLAD"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/multi-relational-embedding-for-knowledge","slug":"multi-relational-embedding-for-knowledge","title":"Multi-Relational Embedding for Knowledge Graph Representation and Analysis","date":"2020-09-28","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/fast-sequence-based-embedding-with-diffusion-1","slug":"fast-sequence-based-embedding-with-diffusion-1","title":"Fast Sequence-Based Embedding with Diffusion Graphs","date":"2020-01-21","arxiv_id":"2001.07463","repositories_listed":4,"syntology":null},{"url":"/paper/safety-verification-and-robustness-analysis","slug":"safety-verification-and-robustness-analysis","title":"Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programming","date":"2019-03-04","arxiv_id":"1903.01287","repositories_listed":4,"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/safety-verification-and-robustness-analysis#ran","syntology_url":"https://syntology.ai/paper/1903.01287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.01287"}},"official":{"repos":["mahyarfazlyab/DeepSDP"],"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/flow-improving-flow-based-generative-models","slug":"flow-improving-flow-based-generative-models","title":"Flow++: Improving Flow-Based Generative Models with Variational Dequantization and Architecture Design","date":"2019-02-01","arxiv_id":"1902.00275","repositories_listed":4,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/flow-improving-flow-based-generative-models#ran","syntology_url":"https://syntology.ai/paper/1902.00275","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00275"}},"official":{"repos":["aravind0706/flowpp","aravindsrinivas/flowpp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/ccnet-criss-cross-attention-for-semantic","slug":"ccnet-criss-cross-attention-for-semantic","title":"CCNet: Criss-Cross Attention for Semantic Segmentation","date":"2018-11-28","arxiv_id":"1811.11721","repositories_listed":4,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":7,"n_instrument":6,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":4,"n_pointer_only":3,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 1 violated, 4 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/ccnet-criss-cross-attention-for-semantic#ran","syntology_url":"https://syntology.ai/paper/1811.11721","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.11721"}},"official":{"repos":["speedinghzl/CCNet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/training-domain-specific-models-for-energy","slug":"training-domain-specific-models-for-energy","title":"Training Domain Specific Models for Energy-Efficient Object Detection","date":"2018-11-06","arxiv_id":"1811.02689","repositories_listed":4,"syntology":null},{"url":"/paper/fast-counting-in-machine-learning","slug":"fast-counting-in-machine-learning","title":"Fast Counting in Machine Learning Applications","date":"2018-04-12","arxiv_id":"1804.04640","repositories_listed":4,"syntology":null},{"url":"/paper/arbitrary-oriented-scene-text-detection-via","slug":"arbitrary-oriented-scene-text-detection-via","title":"Arbitrary-Oriented Scene Text Detection via Rotation Proposals","date":"2017-03-03","arxiv_id":"1703.01086","repositories_listed":4,"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/arbitrary-oriented-scene-text-detection-via#ran","syntology_url":"https://syntology.ai/paper/1703.01086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.01086"}},"official":{"repos":["mjq11302010044/RRPN"],"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/fast-and-accurate-entity-recognition-with","slug":"fast-and-accurate-entity-recognition-with","title":"Fast and Accurate Entity Recognition with Iterated Dilated Convolutions","date":"2017-02-07","arxiv_id":"1702.02098","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":3,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 3 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-and-accurate-entity-recognition-with#ran","syntology_url":"https://syntology.ai/paper/1702.02098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.02098"}},"official":{"repos":["iesl/dilated-cnn-ner"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/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/discovering-and-deciphering-relationships","slug":"discovering-and-deciphering-relationships","title":"Discovering and Deciphering Relationships Across Disparate Data Modalities","date":"2016-09-16","arxiv_id":"1609.05148","repositories_listed":4,"syntology":null},{"url":"/paper/coverm-read-alignment-statistics-for","slug":"coverm-read-alignment-statistics-for","title":"CoverM: Read alignment statistics for metagenomics","date":"2025-01-20","arxiv_id":"2501.11217","repositories_listed":3,"syntology":null},{"url":"/paper/rad-a-metric-for-medical-image-distribution","slug":"rad-a-metric-for-medical-image-distribution","title":"Fréchet Radiomic Distance (FRD): A Versatile Metric for Comparing Medical Imaging Datasets","date":"2024-12-02","arxiv_id":"2412.01496","repositories_listed":3,"syntology":null},{"url":"/paper/beyond-the-rainbow-high-performance-deep","slug":"beyond-the-rainbow-high-performance-deep","title":"Beyond The Rainbow: High Performance Deep Reinforcement Learning on a Desktop PC","date":"2024-11-06","arxiv_id":"2411.03820","repositories_listed":3,"syntology":{"n":25,"n_ran":16,"n_constructed":10,"n_ran_checked":12,"n_instrument":4,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":21,"phrase":"16 ran (of which 10 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 4 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/beyond-the-rainbow-high-performance-deep#ran","syntology_url":"https://syntology.ai/paper/2411.03820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.03820"}},"official":{"repos":["viptankz/btr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/bone-block-affine-transformation-as-parameter","slug":"bone-block-affine-transformation-as-parameter","title":"Balancing LoRA Performance and Efficiency with Simple Shard Sharing","date":"2024-09-19","arxiv_id":"2409.15371","repositories_listed":3,"syntology":null},{"url":"/paper/salience-detr-enhancing-detection-transformer-1","slug":"salience-detr-enhancing-detection-transformer-1","title":"Salience DETR: Enhancing Detection Transformer with Hierarchical Salience Filtering Refinement","date":"2024-03-24","arxiv_id":"2403.16131","repositories_listed":3,"syntology":{"n":23,"n_ran":11,"n_constructed":6,"n_ran_checked":8,"n_instrument":3,"n_unverified":12,"n_honours":2,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"11 ran (of which 6 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/salience-detr-enhancing-detection-transformer-1#ran","syntology_url":"https://syntology.ai/paper/2403.16131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.16131"}},"official":{"repos":["xiuqhou/Salience-DETR"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":7,"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/probabilistic-mimo-u-net-efficient-and","slug":"probabilistic-mimo-u-net-efficient-and","title":"Probabilistic MIMO U-Net: Efficient and Accurate Uncertainty Estimation for Pixel-wise Regression","date":"2023-08-14","arxiv_id":"2308.07477","repositories_listed":3,"syntology":null},{"url":"/paper/vits2-improving-quality-and-efficiency-of","slug":"vits2-improving-quality-and-efficiency-of","title":"VITS2: Improving Quality and Efficiency of Single-Stage Text-to-Speech with Adversarial Learning and Architecture Design","date":"2023-07-31","arxiv_id":"2307.16430","repositories_listed":3,"syntology":null},{"url":"/paper/a-private-watermark-for-large-language-models","slug":"a-private-watermark-for-large-language-models","title":"An Unforgeable Publicly Verifiable Watermark for Large Language Models","date":"2023-07-30","arxiv_id":"2307.16230","repositories_listed":3,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":1,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-private-watermark-for-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2307.16230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.16230"}},"official":{"repos":["THU-BPM/private_watermark","thu-bpm/markllm","thu-bpm/unforgeable_watermark"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rl4co-an-extensive-reinforcement-learning-for","slug":"rl4co-an-extensive-reinforcement-learning-for","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","date":"2023-06-29","arxiv_id":"2306.17100","repositories_listed":3,"syntology":{"n":16,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":3,"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) · 4 unverified","sample_list":"/paper/rl4co-an-extensive-reinforcement-learning-for#ran","syntology_url":"https://syntology.ai/paper/2306.17100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.17100"}},"official":{"repos":["ai4co/rl4co","pytorch/rl"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/biformer-vision-transformer-with-bi-level","slug":"biformer-vision-transformer-with-bi-level","title":"BiFormer: Vision Transformer with Bi-Level Routing Attention","date":"2023-03-15","arxiv_id":"2303.08810","repositories_listed":3,"syntology":{"n":6,"n_ran":6,"n_constructed":5,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/biformer-vision-transformer-with-bi-level#ran","syntology_url":"https://syntology.ai/paper/2303.08810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.08810"}},"official":{"repos":["rayleizhu/biformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/evidencecap-towards-trustworthy-medical-image","slug":"evidencecap-towards-trustworthy-medical-image","title":"Towards Reliable Medical Image Segmentation by utilizing Evidential Calibrated Uncertainty","date":"2023-01-01","arxiv_id":"2301.00349","repositories_listed":3,"syntology":null},{"url":"/paper/spatial-spectral-transformer-for","slug":"spatial-spectral-transformer-for","title":"Spatial-Spectral Transformer for Hyperspectral Image Denoising","date":"2022-11-25","arxiv_id":"2211.14090","repositories_listed":3,"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":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/spatial-spectral-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2211.14090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14090"}},"official":{"repos":["myuli/sst"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/transvisdrone-spatio-temporal-transformer-for","slug":"transvisdrone-spatio-temporal-transformer-for","title":"TransVisDrone: Spatio-Temporal Transformer for Vision-based Drone-to-Drone Detection in Aerial Videos","date":"2022-10-16","arxiv_id":"2210.08423","repositories_listed":3,"syntology":null},{"url":"/paper/mplug-effective-and-efficient-vision-language","slug":"mplug-effective-and-efficient-vision-language","title":"mPLUG: Effective and Efficient Vision-Language Learning by Cross-modal Skip-connections","date":"2022-05-24","arxiv_id":"2205.12005","repositories_listed":3,"syntology":null},{"url":"/paper/hyperbolic-procrustes-analysis-using","slug":"hyperbolic-procrustes-analysis-using","title":"Hyperbolic Procrustes Analysis Using Riemannian Geometry","date":"2021-12-01","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/transformer-based-transform-coding","slug":"transformer-based-transform-coding","title":"Transformer-based Transform Coding","date":"2021-09-29","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/m-ar-k-fast-independent-component-analysis","slug":"m-ar-k-fast-independent-component-analysis","title":"M-ar-K-Fast Independent Component Analysis","date":"2021-08-17","arxiv_id":"2108.07908","repositories_listed":3,"syntology":null},{"url":"/paper/token-shift-transformer-for-video","slug":"token-shift-transformer-for-video","title":"Token Shift Transformer for Video Classification","date":"2021-08-05","arxiv_id":"2108.02432","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/token-shift-transformer-for-video#ran","syntology_url":"https://syntology.ai/paper/2108.02432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.02432"}},"official":{"repos":["VideoNetworks/TokShift-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/vision-transformer-for-fast-and-efficient","slug":"vision-transformer-for-fast-and-efficient","title":"Vision Transformer for Fast and Efficient Scene Text Recognition","date":"2021-05-18","arxiv_id":"2105.08582","repositories_listed":3,"syntology":null},{"url":"/paper/movinets-mobile-video-networks-for-efficient","slug":"movinets-mobile-video-networks-for-efficient","title":"MoViNets: Mobile Video Networks for Efficient Video Recognition","date":"2021-03-21","arxiv_id":"2103.11511","repositories_listed":3,"syntology":{"n":13,"n_ran":9,"n_constructed":6,"n_ran_checked":8,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"9 ran (of which 6 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/movinets-mobile-video-networks-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2103.11511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.11511"}},"official":{"repos":["tensorflow/models"],"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/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/efficient-and-compact-convolutional-neural","slug":"efficient-and-compact-convolutional-neural","title":"Efficient and Compact Convolutional Neural Network Architectures for Non-temporal Real-time Fire Detection","date":"2020-10-17","arxiv_id":"2010.08833","repositories_listed":3,"syntology":null},{"url":"/paper/yolobile-real-time-object-detection-on-mobile","slug":"yolobile-real-time-object-detection-on-mobile","title":"YOLObile: Real-Time Object Detection on Mobile Devices via Compression-Compilation Co-Design","date":"2020-09-12","arxiv_id":"2009.05697","repositories_listed":3,"syntology":null},{"url":"/paper/babyai-1-1","slug":"babyai-1-1","title":"BabyAI 1.1","date":"2020-07-24","arxiv_id":"2007.12770","repositories_listed":3,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/babyai-1-1#ran","syntology_url":"https://syntology.ai/paper/2007.12770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.12770"}},"official":{"repos":["mila-iqia/babyai"],"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/radon-cumulative-distribution-transform","slug":"radon-cumulative-distribution-transform","title":"Radon cumulative distribution transform subspace modeling for image classification","date":"2020-04-07","arxiv_id":"2004.03669","repositories_listed":3,"syntology":null},{"url":"/paper/semantic-segmentation-of-underwater-imagery","slug":"semantic-segmentation-of-underwater-imagery","title":"Semantic Segmentation of Underwater Imagery: Dataset and Benchmark","date":"2020-04-02","arxiv_id":"2004.01241","repositories_listed":3,"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/semantic-segmentation-of-underwater-imagery#ran","syntology_url":"https://syntology.ai/paper/2004.01241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01241"}},"official":null}},{"url":"/paper/transformer-hawkes-process","slug":"transformer-hawkes-process","title":"Transformer Hawkes Process","date":"2020-02-21","arxiv_id":"2002.09291","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/transformer-hawkes-process#ran","syntology_url":"https://syntology.ai/paper/2002.09291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09291"}},"official":{"repos":["SimiaoZuo/Transformer-Hawkes-Process"],"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/amr-similarity-metrics-from-principles","slug":"amr-similarity-metrics-from-principles","title":"AMR Similarity Metrics from Principles","date":"2020-01-29","arxiv_id":"2001.10929","repositories_listed":3,"syntology":null},{"url":"/paper/multi-level-wavelet-convolutional-neural","slug":"multi-level-wavelet-convolutional-neural","title":"Multi-level Wavelet Convolutional Neural Networks","date":"2019-07-06","arxiv_id":"1907.03128","repositories_listed":3,"syntology":{"n":4,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 4 unverified","sample_list":"/paper/multi-level-wavelet-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/1907.03128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.03128"}},"official":{"repos":["lpj-github-io/MWCNNv2"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/how-can-we-be-so-dense-the-benefits-of-using","slug":"how-can-we-be-so-dense-the-benefits-of-using","title":"How Can We Be So Dense? The Benefits of Using Highly Sparse Representations","date":"2019-03-27","arxiv_id":"1903.11257","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-can-we-be-so-dense-the-benefits-of-using#ran","syntology_url":"https://syntology.ai/paper/1903.11257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.11257"}},"official":{"repos":["numenta/htmpapers"],"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/gcnv2-efficient-correspondence-prediction-for","slug":"gcnv2-efficient-correspondence-prediction-for","title":"GCNv2: Efficient Correspondence Prediction for Real-Time SLAM","date":"2019-02-28","arxiv_id":"1902.11046","repositories_listed":3,"syntology":null},{"url":"/paper/knowledge-distillation-by-on-the-fly-native","slug":"knowledge-distillation-by-on-the-fly-native","title":"Knowledge Distillation by On-the-Fly Native Ensemble","date":"2018-06-12","arxiv_id":"1806.04606","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/knowledge-distillation-by-on-the-fly-native#ran","syntology_url":"https://syntology.ai/paper/1806.04606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.04606"}},"official":null}},{"url":"/paper/rethinking-the-smaller-norm-less-informative","slug":"rethinking-the-smaller-norm-less-informative","title":"Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layers","date":"2018-02-01","arxiv_id":"1802.00124","repositories_listed":3,"syntology":null},{"url":"/paper/spherical-cnns","slug":"spherical-cnns","title":"Spherical CNNs","date":"2018-01-30","arxiv_id":"1801.10130","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/spherical-cnns#ran","syntology_url":"https://syntology.ai/paper/1801.10130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.10130"}},"official":{"repos":["jonas-koehler/s2cnn"],"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/bayesian-compression-for-deep-learning","slug":"bayesian-compression-for-deep-learning","title":"Bayesian Compression for Deep Learning","date":"2017-05-24","arxiv_id":"1705.08665","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/bayesian-compression-for-deep-learning#ran","syntology_url":"https://syntology.ai/paper/1705.08665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.08665"}},"official":{"repos":["KarenUllrich/Tutorial_BayesianCompressionForDL"],"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/mmd-gan-towards-deeper-understanding-of","slug":"mmd-gan-towards-deeper-understanding-of","title":"MMD GAN: Towards Deeper Understanding of Moment Matching Network","date":"2017-05-24","arxiv_id":"1705.08584","repositories_listed":3,"syntology":null},{"url":"/paper/on-learning-optimized-reaction-diffusion","slug":"on-learning-optimized-reaction-diffusion","title":"On learning optimized reaction diffusion processes for effective image restoration","date":"2015-03-19","arxiv_id":"1503.05768","repositories_listed":3,"syntology":null},{"url":"/paper/yolov13-real-time-object-detection-with","slug":"yolov13-real-time-object-detection-with","title":"YOLOv13: Real-Time Object Detection with Hypergraph-Enhanced Adaptive Visual Perception","date":"2025-06-21","arxiv_id":"2506.17733","repositories_listed":2,"syntology":null},{"url":"/paper/pruning-everything-everywhere-all-at-once","slug":"pruning-everything-everywhere-all-at-once","title":"Pruning Everything, Everywhere, All at Once","date":"2025-06-04","arxiv_id":"2506.04513","repositories_listed":2,"syntology":null},{"url":"/paper/gotennet-rethinking-efficient-3d-equivariant","slug":"gotennet-rethinking-efficient-3d-equivariant","title":"GotenNet: Rethinking Efficient 3D Equivariant Graph Neural Networks","date":"2025-04-24","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/tree-guided-l-1-convex-clustering","slug":"tree-guided-l-1-convex-clustering","title":"Tree-Guided $L_1$-Convex Clustering","date":"2025-03-31","arxiv_id":"2503.24012","repositories_listed":2,"syntology":null},{"url":"/paper/weathermesh-3-fast-and-accurate-operational","slug":"weathermesh-3-fast-and-accurate-operational","title":"WeatherMesh-3: Fast and accurate operational global weather forecasting","date":"2025-03-28","arxiv_id":"2503.22235","repositories_listed":2,"syntology":null},{"url":"/paper/erwin-a-tree-based-hierarchical-transformer","slug":"erwin-a-tree-based-hierarchical-transformer","title":"Erwin: A Tree-based Hierarchical Transformer for Large-scale Physical Systems","date":"2025-02-24","arxiv_id":"2502.17019","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/erwin-a-tree-based-hierarchical-transformer#ran","syntology_url":"https://syntology.ai/paper/2502.17019","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.17019"}},"official":{"repos":["maxxxzdn/erwin"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-and-accurate-blind-flexible-docking","slug":"fast-and-accurate-blind-flexible-docking","title":"Fast and Accurate Blind Flexible Docking","date":"2025-02-20","arxiv_id":"2502.14934","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-and-accurate-blind-flexible-docking#ran","syntology_url":"https://syntology.ai/paper/2502.14934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.14934"}},"official":{"repos":["tmlr-group/fabflex"],"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-survey-of-world-models-for-autonomous","slug":"a-survey-of-world-models-for-autonomous","title":"A Survey of World Models for Autonomous Driving","date":"2025-01-20","arxiv_id":"2501.11260","repositories_listed":2,"syntology":null},{"url":"/paper/flash-window-attention-speedup-the-attention","slug":"flash-window-attention-speedup-the-attention","title":"Flash Window Attention: speedup the attention computation for Swin Transformer","date":"2025-01-11","arxiv_id":"2501.06480","repositories_listed":2,"syntology":null},{"url":"/paper/recursive-gaussian-process-state-space-model","slug":"recursive-gaussian-process-state-space-model","title":"Recursive Gaussian Process State Space Model","date":"2024-11-22","arxiv_id":"2411.14679","repositories_listed":2,"syntology":null},{"url":"/paper/reconsidering-the-performance-of-gae-in-link","slug":"reconsidering-the-performance-of-gae-in-link","title":"Reconsidering the Performance of GAE in Link Prediction","date":"2024-11-06","arxiv_id":"2411.03845","repositories_listed":2,"syntology":null},{"url":"/paper/toward-automated-algorithm-design-a-survey","slug":"toward-automated-algorithm-design-a-survey","title":"Toward Automated Algorithm Design: A Survey and Practical Guide to Meta-Black-Box-Optimization","date":"2024-11-01","arxiv_id":"2411.00625","repositories_listed":2,"syntology":null},{"url":"/paper/a-class-of-modular-and-flexible-covariate","slug":"a-class-of-modular-and-flexible-covariate","title":"A class of modular and flexible covariate-based covariance functions for nonstationary spatial modeling","date":"2024-10-22","arxiv_id":"2410.16716","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-data-optimization-dynamic-sample","slug":"adaptive-data-optimization-dynamic-sample","title":"Adaptive Data Optimization: Dynamic Sample Selection with Scaling Laws","date":"2024-10-15","arxiv_id":"2410.11820","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-data-optimization-dynamic-sample#ran","syntology_url":"https://syntology.ai/paper/2410.11820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.11820"}},"official":{"repos":["yidingjiang/ado"],"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/parco-learning-parallel-autoregressive","slug":"parco-learning-parallel-autoregressive","title":"Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization","date":"2024-09-05","arxiv_id":"2409.03811","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":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) · 2 unverified","sample_list":"/paper/parco-learning-parallel-autoregressive#ran","syntology_url":"https://syntology.ai/paper/2409.03811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.03811"}},"official":{"repos":["ai4co/parco"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}}],"syntology_records":54,"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":369,"papers_where_code_ran_first_page":"/task/computational-efficiency/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":49,"url":"/task/computational-efficiency/papers/2","json":"/task/computational-efficiency/papers/2.json","rows":100},{"order":"archive","page":3,"of":49,"url":"/task/computational-efficiency/papers/3","json":"/task/computational-efficiency/papers/3.json","rows":100},{"order":"archive","page":4,"of":49,"url":"/task/computational-efficiency/papers/4","json":"/task/computational-efficiency/papers/4.json","rows":100},{"order":"archive","page":5,"of":49,"url":"/task/computational-efficiency/papers/5","json":"/task/computational-efficiency/papers/5.json","rows":100},{"order":"archive","page":6,"of":49,"url":"/task/computational-efficiency/papers/6","json":"/task/computational-efficiency/papers/6.json","rows":100},{"order":"archive","page":7,"of":49,"url":"/task/computational-efficiency/papers/7","json":"/task/computational-efficiency/papers/7.json","rows":100},{"order":"archive","page":8,"of":49,"url":"/task/computational-efficiency/papers/8","json":"/task/computational-efficiency/papers/8.json","rows":100},{"order":"archive","page":9,"of":49,"url":"/task/computational-efficiency/papers/9","json":"/task/computational-efficiency/papers/9.json","rows":100},{"order":"archive","page":10,"of":49,"url":"/task/computational-efficiency/papers/10","json":"/task/computational-efficiency/papers/10.json","rows":100},{"order":"archive","page":11,"of":49,"url":"/task/computational-efficiency/papers/11","json":"/task/computational-efficiency/papers/11.json","rows":100},{"order":"archive","page":12,"of":49,"url":"/task/computational-efficiency/papers/12","json":"/task/computational-efficiency/papers/12.json","rows":100},{"order":"archive","page":13,"of":49,"url":"/task/computational-efficiency/papers/13","json":"/task/computational-efficiency/papers/13.json","rows":100},{"order":"archive","page":14,"of":49,"url":"/task/computational-efficiency/papers/14","json":"/task/computational-efficiency/papers/14.json","rows":100},{"order":"archive","page":15,"of":49,"url":"/task/computational-efficiency/papers/15","json":"/task/computational-efficiency/papers/15.json","rows":100},{"order":"archive","page":16,"of":49,"url":"/task/computational-efficiency/papers/16","json":"/task/computational-efficiency/papers/16.json","rows":100},{"order":"archive","page":17,"of":49,"url":"/task/computational-efficiency/papers/17","json":"/task/computational-efficiency/papers/17.json","rows":100},{"order":"archive","page":18,"of":49,"url":"/task/computational-efficiency/papers/18","json":"/task/computational-efficiency/papers/18.json","rows":100},{"order":"archive","page":19,"of":49,"url":"/task/computational-efficiency/papers/19","json":"/task/computational-efficiency/papers/19.json","rows":100},{"order":"archive","page":20,"of":49,"url":"/task/computational-efficiency/papers/20","json":"/task/computational-efficiency/papers/20.json","rows":100},{"order":"archive","page":21,"of":49,"url":"/task/computational-efficiency/papers/21","json":"/task/computational-efficiency/papers/21.json","rows":100},{"order":"archive","page":22,"of":49,"url":"/task/computational-efficiency/papers/22","json":"/task/computational-efficiency/papers/22.json","rows":100},{"order":"archive","page":23,"of":49,"url":"/task/computational-efficiency/papers/23","json":"/task/computational-efficiency/papers/23.json","rows":100},{"order":"archive","page":24,"of":49,"url":"/task/computational-efficiency/papers/24","json":"/task/computational-efficiency/papers/24.json","rows":100},{"order":"archive","page":25,"of":49,"url":"/task/computational-efficiency/papers/25","json":"/task/computational-efficiency/papers/25.json","rows":100},{"order":"archive","page":26,"of":49,"url":"/task/computational-efficiency/papers/26","json":"/task/computational-efficiency/papers/26.json","rows":100},{"order":"archive","page":27,"of":49,"url":"/task/computational-efficiency/papers/27","json":"/task/computational-efficiency/papers/27.json","rows":100},{"order":"archive","page":28,"of":49,"url":"/task/computational-efficiency/papers/28","json":"/task/computational-efficiency/papers/28.json","rows":100},{"order":"archive","page":29,"of":49,"url":"/task/computational-efficiency/papers/29","json":"/task/computational-efficiency/papers/29.json","rows":100},{"order":"archive","page":30,"of":49,"url":"/task/computational-efficiency/papers/30","json":"/task/computational-efficiency/papers/30.json","rows":100},{"order":"archive","page":31,"of":49,"url":"/task/computational-efficiency/papers/31","json":"/task/computational-efficiency/papers/31.json","rows":100},{"order":"archive","page":32,"of":49,"url":"/task/computational-efficiency/papers/32","json":"/task/computational-efficiency/papers/32.json","rows":100},{"order":"archive","page":33,"of":49,"url":"/task/computational-efficiency/papers/33","json":"/task/computational-efficiency/papers/33.json","rows":100},{"order":"archive","page":34,"of":49,"url":"/task/computational-efficiency/papers/34","json":"/task/computational-efficiency/papers/34.json","rows":100},{"order":"archive","page":35,"of":49,"url":"/task/computational-efficiency/papers/35","json":"/task/computational-efficiency/papers/35.json","rows":100},{"order":"archive","page":36,"of":49,"url":"/task/computational-efficiency/papers/36","json":"/task/computational-efficiency/papers/36.json","rows":100},{"order":"archive","page":37,"of":49,"url":"/task/computational-efficiency/papers/37","json":"/task/computational-efficiency/papers/37.json","rows":100},{"order":"archive","page":38,"of":49,"url":"/task/computational-efficiency/papers/38","json":"/task/computational-efficiency/papers/38.json","rows":100},{"order":"archive","page":39,"of":49,"url":"/task/computational-efficiency/papers/39","json":"/task/computational-efficiency/papers/39.json","rows":100},{"order":"archive","page":40,"of":49,"url":"/task/computational-efficiency/papers/40","json":"/task/computational-efficiency/papers/40.json","rows":100},{"order":"archive","page":41,"of":49,"url":"/task/computational-efficiency/papers/41","json":"/task/computational-efficiency/papers/41.json","rows":100},{"order":"archive","page":42,"of":49,"url":"/task/computational-efficiency/papers/42","json":"/task/computational-efficiency/papers/42.json","rows":100},{"order":"archive","page":43,"of":49,"url":"/task/computational-efficiency/papers/43","json":"/task/computational-efficiency/papers/43.json","rows":100},{"order":"archive","page":44,"of":49,"url":"/task/computational-efficiency/papers/44","json":"/task/computational-efficiency/papers/44.json","rows":100},{"order":"archive","page":45,"of":49,"url":"/task/computational-efficiency/papers/45","json":"/task/computational-efficiency/papers/45.json","rows":100},{"order":"archive","page":46,"of":49,"url":"/task/computational-efficiency/papers/46","json":"/task/computational-efficiency/papers/46.json","rows":100},{"order":"archive","page":47,"of":49,"url":"/task/computational-efficiency/papers/47","json":"/task/computational-efficiency/papers/47.json","rows":100},{"order":"archive","page":48,"of":49,"url":"/task/computational-efficiency/papers/48","json":"/task/computational-efficiency/papers/48.json","rows":100},{"order":"archive","page":49,"of":49,"url":"/task/computational-efficiency/papers/49","json":"/task/computational-efficiency/papers/49.json","rows":91},{"order":"ran","page":1,"of":4,"url":"/task/computational-efficiency/papers/ran/1","json":"/task/computational-efficiency/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":4,"url":"/task/computational-efficiency/papers/ran/2","json":"/task/computational-efficiency/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":4,"url":"/task/computational-efficiency/papers/ran/3","json":"/task/computational-efficiency/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":4,"url":"/task/computational-efficiency/papers/ran/4","json":"/task/computational-efficiency/papers/ran/4.json","rows":69}],"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":"a8eea7eb63e9b8ce6a92e84d9a874bd209f3846de360521f1279468c14a6fc6b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}