{"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/papers/2","list_of":"/task/computational-efficiency","task":"Computational Efficiency","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":49,"rows_per_page":100,"rows":[101,200],"of":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":307,"every_run_a_failure_of_syntologys_instrument":62,"listed_with_a_run_with_no_instrument_failure":307,"listed_every_run_a_failure_of_syntologys_instrument":62,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/computational-efficiency","prev":"/task/computational-efficiency","next":"/task/computational-efficiency/papers/3","papers":[{"url":"/paper/msfmamba-multi-scale-feature-fusion-state","slug":"msfmamba-multi-scale-feature-fusion-state","title":"MSFMamba: Multi-Scale Feature Fusion State Space Model for Multi-Source Remote Sensing Image Classification","date":"2024-08-26","arxiv_id":"2408.14255","repositories_listed":2,"syntology":null},{"url":"/paper/efficient-and-scalable-point-cloud-generation","slug":"efficient-and-scalable-point-cloud-generation","title":"Efficient and Scalable Point Cloud Generation with Sparse Point-Voxel Diffusion Models","date":"2024-08-12","arxiv_id":"2408.06145","repositories_listed":2,"syntology":null},{"url":"/paper/rl-adn-a-high-performance-deep-reinforcement","slug":"rl-adn-a-high-performance-deep-reinforcement","title":"RL-ADN: A High-Performance Deep Reinforcement Learning Environment for Optimal Energy Storage Systems Dispatch in Active Distribution Networks","date":"2024-08-07","arxiv_id":"2408.03685","repositories_listed":2,"syntology":null},{"url":"/paper/2408-01372","slug":"2408-01372","title":"Spatial and Spatial-Spectral Morphological Mamba for Hyperspectral Image Classification","date":"2024-08-02","arxiv_id":"2408.01372","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-foundation-models-for-online","slug":"adaptive-foundation-models-for-online","title":"Scalable Exploration via Ensemble++","date":"2024-07-18","arxiv_id":"2407.13195","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":1,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"5 ran (of which 1 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) · 3 unverified","sample_list":"/paper/adaptive-foundation-models-for-online#ran","syntology_url":"https://syntology.ai/paper/2407.13195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.13195"}},"official":{"repos":["szrlee/GPT-HyperAgent","szrlee/ensemble_plus_plus"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/digraf-diffeomorphic-graph-adaptive","slug":"digraf-diffeomorphic-graph-adaptive","title":"DiGRAF: Diffeomorphic Graph-Adaptive Activation Function","date":"2024-07-02","arxiv_id":"2407.02013","repositories_listed":2,"syntology":{"n":16,"n_ran":12,"n_constructed":0,"n_ran_checked":7,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"12 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; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/digraf-diffeomorphic-graph-adaptive#ran","syntology_url":"https://syntology.ai/paper/2407.02013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02013"}},"official":{"repos":["ipsitmantri/digraf"],"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/unified-auto-encoding-with-masked-diffusion","slug":"unified-auto-encoding-with-masked-diffusion","title":"Unified Auto-Encoding with Masked Diffusion","date":"2024-06-25","arxiv_id":"2406.17688","repositories_listed":2,"syntology":null},{"url":"/paper/computation-efficient-semi-supervised","slug":"computation-efficient-semi-supervised","title":"CE-SSL: Computation-Efficient Semi-Supervised Learning for ECG-based Cardiovascular Diseases Detection","date":"2024-06-20","arxiv_id":"2406.14377","repositories_listed":2,"syntology":null},{"url":"/paper/cross-language-soccer-framework-an-open","slug":"cross-language-soccer-framework-an-open","title":"Cross Language Soccer Framework: An Open Source Framework for the RoboCup 2D Soccer Simulation","date":"2024-06-09","arxiv_id":"2406.05621","repositories_listed":2,"syntology":null},{"url":"/paper/beautymap-binary-encoded-adaptable-ground","slug":"beautymap-binary-encoded-adaptable-ground","title":"BeautyMap: Binary-Encoded Adaptable Ground Matrix for Dynamic Points Removal in Global Maps","date":"2024-05-12","arxiv_id":"2405.07283","repositories_listed":2,"syntology":null},{"url":"/paper/rag-and-rau-a-survey-on-retrieval-augmented","slug":"rag-and-rau-a-survey-on-retrieval-augmented","title":"RAG and RAU: A Survey on Retrieval-Augmented Language Model in Natural Language Processing","date":"2024-04-30","arxiv_id":"2404.19543","repositories_listed":2,"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/rag-and-rau-a-survey-on-retrieval-augmented#ran","syntology_url":"https://syntology.ai/paper/2404.19543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.19543"}},"official":{"repos":["2471023025/ralm_survey"],"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/leveraging-visibility-graphs-for-enhanced","slug":"leveraging-visibility-graphs-for-enhanced","title":"Leveraging Visibility Graphs for Enhanced Arrhythmia Classification with Graph Convolutional Networks","date":"2024-04-19","arxiv_id":"2404.15367","repositories_listed":2,"syntology":null},{"url":"/paper/tslanet-rethinking-transformers-for-time","slug":"tslanet-rethinking-transformers-for-time","title":"TSLANet: Rethinking Transformers for Time Series Representation Learning","date":"2024-04-12","arxiv_id":"2404.08472","repositories_listed":2,"syntology":{"n":16,"n_ran":13,"n_constructed":8,"n_ran_checked":8,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"13 ran (of which 8 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) · 3 unverified","sample_list":"/paper/tslanet-rethinking-transformers-for-time#ran","syntology_url":"https://syntology.ai/paper/2404.08472","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08472"}},"official":{"repos":["emadeldeen24/tslanet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/modetv2-gpu-accelerated-motion-decomposition","slug":"modetv2-gpu-accelerated-motion-decomposition","title":"ModeTv2: GPU-accelerated Motion Decomposition Transformer for Pairwise Optimization in Medical Image Registration","date":"2024-03-25","arxiv_id":"2403.16526","repositories_listed":2,"syntology":null},{"url":"/paper/negative-yields-positive-unified-dual-path","slug":"negative-yields-positive-unified-dual-path","title":"Enhancing Vision-Language Few-Shot Adaptation with Negative Learning","date":"2024-03-19","arxiv_id":"2403.12964","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"5 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; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/negative-yields-positive-unified-dual-path#ran","syntology_url":"https://syntology.ai/paper/2403.12964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.12964"}},"official":{"repos":["zhangce01/dualadapter","zhangce01/simnl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-dynamical-systems-encoding-non","slug":"learning-dynamical-systems-encoding-non","title":"Learning Dynamical Systems Encoding Non-Linearity within Space Curvature","date":"2024-03-18","arxiv_id":"2403.11948","repositories_listed":2,"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/learning-dynamical-systems-encoding-non#ran","syntology_url":"https://syntology.ai/paper/2403.11948","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.11948"}},"official":{"repos":["nash169/demo-learn-embedding","nash169/learn-embedding"],"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/dufomap-efficient-dynamic-awareness-mapping","slug":"dufomap-efficient-dynamic-awareness-mapping","title":"DUFOMap: Efficient Dynamic Awareness Mapping","date":"2024-03-03","arxiv_id":"2403.01449","repositories_listed":2,"syntology":null},{"url":"/paper/gradient-free-adaptive-global-pruning-for-pre","slug":"gradient-free-adaptive-global-pruning-for-pre","title":"SparseLLM: Towards Global Pruning for Pre-trained Language Models","date":"2024-02-28","arxiv_id":"2402.17946","repositories_listed":2,"syntology":{"n":9,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 6 unverified","sample_list":"/paper/gradient-free-adaptive-global-pruning-for-pre#ran","syntology_url":"https://syntology.ai/paper/2402.17946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17946"}},"official":{"repos":["baithebest/adagp","baithebest/sparsellm"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/lstp-language-guided-spatial-temporal-prompt","slug":"lstp-language-guided-spatial-temporal-prompt","title":"Efficient Temporal Extrapolation of Multimodal Large Language Models with Temporal Grounding Bridge","date":"2024-02-25","arxiv_id":"2402.16050","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"7 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lstp-language-guided-spatial-temporal-prompt#ran","syntology_url":"https://syntology.ai/paper/2402.16050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.16050"}},"official":{"repos":["bigai-nlco/lstp-chat","bigai-nlco/videotgb"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/linear-dynamics-embedded-neural-network-for","slug":"linear-dynamics-embedded-neural-network-for","title":"Efficient State Space Model via Fast Tensor Convolution and Block Diagonalization","date":"2024-02-23","arxiv_id":"2402.15290","repositories_listed":2,"syntology":null},{"url":"/paper/global-safe-sequential-learning-via-efficient","slug":"global-safe-sequential-learning-via-efficient","title":"Global Safe Sequential Learning via Efficient Knowledge Transfer","date":"2024-02-22","arxiv_id":"2402.14402","repositories_listed":2,"syntology":null},{"url":"/paper/dualview-data-attribution-from-the-dual","slug":"dualview-data-attribution-from-the-dual","title":"DualView: Data Attribution from the Dual Perspective","date":"2024-02-19","arxiv_id":"2402.12118","repositories_listed":2,"syntology":null},{"url":"/paper/fit-flexible-vision-transformer-for-diffusion","slug":"fit-flexible-vision-transformer-for-diffusion","title":"FiT: Flexible Vision Transformer for Diffusion Model","date":"2024-02-19","arxiv_id":"2402.12376","repositories_listed":2,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":11,"n_instrument":4,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fit-flexible-vision-transformer-for-diffusion#ran","syntology_url":"https://syntology.ai/paper/2402.12376","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12376"}},"official":{"repos":["whlzy/fit"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/attnlrp-attention-aware-layer-wise-relevance","slug":"attnlrp-attention-aware-layer-wise-relevance","title":"AttnLRP: Attention-Aware Layer-Wise Relevance Propagation for Transformers","date":"2024-02-08","arxiv_id":"2402.05602","repositories_listed":2,"syntology":null},{"url":"/paper/provably-stable-feature-rankings-with-shap","slug":"provably-stable-feature-rankings-with-shap","title":"Statistical Significance of Feature Importance Rankings","date":"2024-01-28","arxiv_id":"2401.15800","repositories_listed":2,"syntology":null},{"url":"/paper/l-autoda-leveraging-large-language-models-for","slug":"l-autoda-leveraging-large-language-models-for","title":"L-AutoDA: Leveraging Large Language Models for Automated Decision-based Adversarial Attacks","date":"2024-01-27","arxiv_id":"2401.15335","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/l-autoda-leveraging-large-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2401.15335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.15335"}},"official":{"repos":["pgg3/L-AutoDA"],"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/tim-an-efficient-temporal-interaction-module","slug":"tim-an-efficient-temporal-interaction-module","title":"TIM: An Efficient Temporal Interaction Module for Spiking Transformer","date":"2024-01-22","arxiv_id":"2401.11687","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tim-an-efficient-temporal-interaction-module#ran","syntology_url":"https://syntology.ai/paper/2401.11687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.11687"}},"official":{"repos":["braincog-x/brain-cog"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rwkv-ts-beyond-traditional-recurrent-neural","slug":"rwkv-ts-beyond-traditional-recurrent-neural","title":"RWKV-TS: Beyond Traditional Recurrent Neural Network for Time Series Tasks","date":"2024-01-17","arxiv_id":"2401.09093","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rwkv-ts-beyond-traditional-recurrent-neural#ran","syntology_url":"https://syntology.ai/paper/2401.09093","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.09093"}},"official":{"repos":["howard-hou/rwkv-ts"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tinyllama-an-open-source-small-language-model","slug":"tinyllama-an-open-source-small-language-model","title":"TinyLlama: An Open-Source Small Language Model","date":"2024-01-04","arxiv_id":"2401.02385","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tinyllama-an-open-source-small-language-model#ran","syntology_url":"https://syntology.ai/paper/2401.02385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.02385"}},"official":{"repos":["Lightning-AI/lit-gpt","jzhang38/tinyllama"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tinygpt-v-efficient-multimodal-large-language","slug":"tinygpt-v-efficient-multimodal-large-language","title":"TinyGPT-V: Efficient Multimodal Large Language Model via Small Backbones","date":"2023-12-28","arxiv_id":"2312.16862","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"7 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tinygpt-v-efficient-multimodal-large-language#ran","syntology_url":"https://syntology.ai/paper/2312.16862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.16862"}},"official":{"repos":["dlyuangod/tinygpt-v"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/global-local-mav-detection-under-challenging","slug":"global-local-mav-detection-under-challenging","title":"Global-Local MAV Detection under Challenging Conditions based on Appearance and Motion","date":"2023-12-18","arxiv_id":"2312.11008","repositories_listed":2,"syntology":null},{"url":"/paper/agent-attention-on-the-integration-of-softmax","slug":"agent-attention-on-the-integration-of-softmax","title":"Agent Attention: On the Integration of Softmax and Linear Attention","date":"2023-12-14","arxiv_id":"2312.08874","repositories_listed":2,"syntology":{"n":19,"n_ran":13,"n_constructed":0,"n_ran_checked":9,"n_instrument":4,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":7,"n_pointer_only":19,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/agent-attention-on-the-integration-of-softmax#ran","syntology_url":"https://syntology.ai/paper/2312.08874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.08874"}},"official":{"repos":["leaplabthu/agent-attention"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":6,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/videolcm-video-latent-consistency-model","slug":"videolcm-video-latent-consistency-model","title":"VideoLCM: Video Latent Consistency Model","date":"2023-12-14","arxiv_id":"2312.09109","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/videolcm-video-latent-consistency-model#ran","syntology_url":"https://syntology.ai/paper/2312.09109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.09109"}},"official":null}},{"url":"/paper/efficient-neural-network-approaches-for-1","slug":"efficient-neural-network-approaches-for-1","title":"Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference","date":"2023-10-25","arxiv_id":"2310.16975","repositories_listed":2,"syntology":null},{"url":"/paper/xval-a-continuous-number-encoding-for-large","slug":"xval-a-continuous-number-encoding-for-large","title":"xVal: A Continuous Numerical Tokenization for Scientific Language Models","date":"2023-10-04","arxiv_id":"2310.02989","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/xval-a-continuous-number-encoding-for-large#ran","syntology_url":"https://syntology.ai/paper/2310.02989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02989"}},"official":{"repos":["PolymathicAI/xVal"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/omniquant-omnidirectionally-calibrated","slug":"omniquant-omnidirectionally-calibrated","title":"OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Models","date":"2023-08-25","arxiv_id":"2308.13137","repositories_listed":2,"syntology":{"n":16,"n_ran":10,"n_constructed":1,"n_ran_checked":8,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/omniquant-omnidirectionally-calibrated#ran","syntology_url":"https://syntology.ai/paper/2308.13137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.13137"}},"official":{"repos":["opengvlab/omniquant"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/fosa-full-information-maximum-likelihood-fiml","slug":"fosa-full-information-maximum-likelihood-fiml","title":"Missing Data Imputation Based on Dynamically Adaptable Structural Equation Modeling with Self-Attention","date":"2023-08-23","arxiv_id":"2308.12388","repositories_listed":2,"syntology":null},{"url":"/paper/fedpop-federated-population-based","slug":"fedpop-federated-population-based","title":"FedPop: Federated Population-based Hyperparameter Tuning","date":"2023-08-16","arxiv_id":"2308.08634","repositories_listed":2,"syntology":null},{"url":"/paper/scqpth-an-efficient-differentiable-splitting","slug":"scqpth-an-efficient-differentiable-splitting","title":"SCQPTH: an efficient differentiable splitting method for convex quadratic programming","date":"2023-08-16","arxiv_id":"2308.08232","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/scqpth-an-efficient-differentiable-splitting#ran","syntology_url":"https://syntology.ai/paper/2308.08232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08232"}},"official":{"repos":["ipo-lab/scqpth","ipo-lab/scqpth_bench"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/jen-1-text-guided-universal-music-generation","slug":"jen-1-text-guided-universal-music-generation","title":"JEN-1: Text-Guided Universal Music Generation with Omnidirectional Diffusion Models","date":"2023-08-09","arxiv_id":"2308.04729","repositories_listed":2,"syntology":null},{"url":"/paper/objects-do-not-disappear-video-object","slug":"objects-do-not-disappear-video-object","title":"Objects do not disappear: Video object detection by single-frame object location anticipation","date":"2023-08-09","arxiv_id":"2308.04770","repositories_listed":2,"syntology":null},{"url":"/paper/practical-and-asymptotically-exact-1","slug":"practical-and-asymptotically-exact-1","title":"Practical and Asymptotically Exact Conditional Sampling in Diffusion Models","date":"2023-06-30","arxiv_id":"2306.17775","repositories_listed":2,"syntology":{"n":15,"n_ran":9,"n_constructed":1,"n_ran_checked":2,"n_instrument":7,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":15,"phrase":"9 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 7 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/practical-and-asymptotically-exact-1#ran","syntology_url":"https://syntology.ai/paper/2306.17775","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.17775"}},"official":{"repos":["blt2114/twisted_diffusion_sampler"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/famo-fast-adaptive-multitask-optimization-1","slug":"famo-fast-adaptive-multitask-optimization-1","title":"FAMO: Fast Adaptive Multitask Optimization","date":"2023-06-06","arxiv_id":"2306.03792","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":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/famo-fast-adaptive-multitask-optimization-1#ran","syntology_url":"https://syntology.ai/paper/2306.03792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03792"}},"official":{"repos":["cranial-xix/famo"],"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/torchrl-a-data-driven-decision-making-library","slug":"torchrl-a-data-driven-decision-making-library","title":"TorchRL: A data-driven decision-making library for PyTorch","date":"2023-06-01","arxiv_id":"2306.00577","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/torchrl-a-data-driven-decision-making-library#ran","syntology_url":"https://syntology.ai/paper/2306.00577","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.00577"}},"official":null}},{"url":"/paper/vandermonde-neural-operators","slug":"vandermonde-neural-operators","title":"Beyond Regular Grids: Fourier-Based Neural Operators on Arbitrary Domains","date":"2023-05-31","arxiv_id":"2305.19663","repositories_listed":2,"syntology":null},{"url":"/paper/tune-mode-convbn-blocks-for-efficient","slug":"tune-mode-convbn-blocks-for-efficient","title":"Efficient ConvBN Blocks for Transfer Learning and Beyond","date":"2023-05-19","arxiv_id":"2305.11624","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/tune-mode-convbn-blocks-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2305.11624","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11624"}},"official":{"repos":["apple/ml-tune-mode-convbn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-better-graph-representation-learning","slug":"towards-better-graph-representation-learning","title":"Towards Better Graph Representation Learning with Parameterized Decomposition & Filtering","date":"2023-05-10","arxiv_id":"2305.06102","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/towards-better-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2305.06102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06102"}},"official":{"repos":["qslim/pdf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gpr-net-geometric-prototypical-network-for","slug":"gpr-net-geometric-prototypical-network-for","title":"GPr-Net: Geometric Prototypical Network for Point Cloud Few-Shot Learning","date":"2023-04-12","arxiv_id":"2304.06007","repositories_listed":2,"syntology":null},{"url":"/paper/heat-flux-for-semi-local-machine-learning","slug":"heat-flux-for-semi-local-machine-learning","title":"Heat flux for semi-local machine-learning potentials","date":"2023-03-25","arxiv_id":"2303.14434","repositories_listed":2,"syntology":null},{"url":"/paper/fd-net-an-unsupervised-deep-forward","slug":"fd-net-an-unsupervised-deep-forward","title":"FD-Net: An Unsupervised Deep Forward-Distortion Model for Susceptibility Artifact Correction in EPI","date":"2023-03-18","arxiv_id":"2303.10436","repositories_listed":2,"syntology":null},{"url":"/paper/all4one-symbiotic-neighbour-contrastive","slug":"all4one-symbiotic-neighbour-contrastive","title":"All4One: Symbiotic Neighbour Contrastive Learning via Self-Attention and Redundancy Reduction","date":"2023-03-16","arxiv_id":"2303.09417","repositories_listed":2,"syntology":null},{"url":"/paper/a-convergent-single-loop-algorithm-for","slug":"a-convergent-single-loop-algorithm-for","title":"A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data","date":"2023-03-12","arxiv_id":"2303.06595","repositories_listed":2,"syntology":{"n":20,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":12,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/a-convergent-single-loop-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/2303.06595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.06595"}},"official":{"repos":["PythonOT/POT","squareroot3/gromov-wasserstein-for-graph"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":12,"ran_from_kinds":["official"]}}},{"url":"/paper/scaling-up-3d-kernels-with-bayesian-frequency","slug":"scaling-up-3d-kernels-with-bayesian-frequency","title":"Scaling Up 3D Kernels with Bayesian Frequency Re-parameterization for Medical Image Segmentation","date":"2023-03-10","arxiv_id":"2303.05785","repositories_listed":2,"syntology":null},{"url":"/paper/sliced-wasserstein-on-symmetric-positive","slug":"sliced-wasserstein-on-symmetric-positive","title":"Sliced-Wasserstein on Symmetric Positive Definite Matrices for M/EEG Signals","date":"2023-03-10","arxiv_id":"2303.05798","repositories_listed":2,"syntology":null},{"url":"/paper/optimising-event-driven-spiking-neural","slug":"optimising-event-driven-spiking-neural","title":"Optimising Event-Driven Spiking Neural Network with Regularisation and Cutoff","date":"2023-01-23","arxiv_id":"2301.09522","repositories_listed":2,"syntology":null},{"url":"/paper/phast-physics-aware-scalable-and-task","slug":"phast-physics-aware-scalable-and-task","title":"PhAST: Physics-Aware, Scalable, and Task-specific GNNs for Accelerated Catalyst Design","date":"2022-11-22","arxiv_id":"2211.12020","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/phast-physics-aware-scalable-and-task#ran","syntology_url":"https://syntology.ai/paper/2211.12020","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.12020"}},"official":{"repos":["vict0rsch/PhAST"],"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/simvp-towards-simple-yet-powerful","slug":"simvp-towards-simple-yet-powerful","title":"SimVPv2: Towards Simple yet Powerful Spatiotemporal Predictive Learning","date":"2022-11-22","arxiv_id":"2211.12509","repositories_listed":2,"syntology":null},{"url":"/paper/efficient-large-scale-audio-tagging-via","slug":"efficient-large-scale-audio-tagging-via","title":"Efficient Large-scale Audio Tagging via Transformer-to-CNN Knowledge Distillation","date":"2022-11-09","arxiv_id":"2211.04772","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-large-scale-audio-tagging-via#ran","syntology_url":"https://syntology.ai/paper/2211.04772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.04772"}},"official":{"repos":["fschmid56/efficientat"],"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/quala-minilm-a-quantized-length-adaptive","slug":"quala-minilm-a-quantized-length-adaptive","title":"QuaLA-MiniLM: a Quantized Length Adaptive MiniLM","date":"2022-10-31","arxiv_id":"2210.17114","repositories_listed":2,"syntology":null},{"url":"/paper/efficient-and-effective-augmentation-strategy","slug":"efficient-and-effective-augmentation-strategy","title":"Efficient and Effective Augmentation Strategy for Adversarial Training","date":"2022-10-27","arxiv_id":"2210.15318","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-and-effective-augmentation-strategy#ran","syntology_url":"https://syntology.ai/paper/2210.15318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.15318"}},"official":{"repos":["val-iisc/dajat"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mixture-of-attention-heads-selecting","slug":"mixture-of-attention-heads-selecting","title":"Mixture of Attention Heads: Selecting Attention Heads Per Token","date":"2022-10-11","arxiv_id":"2210.05144","repositories_listed":2,"syntology":{"n":17,"n_ran":13,"n_constructed":2,"n_ran_checked":10,"n_instrument":3,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":4,"phrase":"13 ran (of which 2 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/mixture-of-attention-heads-selecting#ran","syntology_url":"https://syntology.ai/paper/2210.05144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.05144"}},"official":{"repos":["yikangshen/moa"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/automating-dbscan-via-deep-reinforcement","slug":"automating-dbscan-via-deep-reinforcement","title":"Automating DBSCAN via Deep Reinforcement Learning","date":"2022-08-09","arxiv_id":"2208.04537","repositories_listed":2,"syntology":null},{"url":"/paper/temporal-attention-unit-towards-efficient","slug":"temporal-attention-unit-towards-efficient","title":"Temporal Attention Unit: Towards Efficient Spatiotemporal Predictive Learning","date":"2022-06-24","arxiv_id":"2206.12126","repositories_listed":2,"syntology":null},{"url":"/paper/jointly-efficient-and-optimal-algorithms-for","slug":"jointly-efficient-and-optimal-algorithms-for","title":"Jointly Efficient and Optimal Algorithms for Logistic Bandits","date":"2022-01-06","arxiv_id":"2201.01985","repositories_listed":2,"syntology":null},{"url":"/paper/adafocus-v2-end-to-end-training-of-spatial","slug":"adafocus-v2-end-to-end-training-of-spatial","title":"AdaFocus V2: End-to-End Training of Spatial Dynamic Networks for Video Recognition","date":"2021-12-28","arxiv_id":"2112.14238","repositories_listed":2,"syntology":null},{"url":"/paper/mseg-a-composite-dataset-for-multi-domain-1","slug":"mseg-a-composite-dataset-for-multi-domain-1","title":"MSeg: A Composite Dataset for Multi-domain Semantic Segmentation","date":"2021-12-27","arxiv_id":"2112.13762","repositories_listed":2,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":10,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":4,"phrase":"14 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mseg-a-composite-dataset-for-multi-domain-1#ran","syntology_url":"https://syntology.ai/paper/2112.13762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.13762"}},"official":{"repos":["mseg-dataset/mseg-semantic"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/efficient-geometry-aware-3d-generative","slug":"efficient-geometry-aware-3d-generative","title":"Efficient Geometry-aware 3D Generative Adversarial Networks","date":"2021-12-15","arxiv_id":"2112.07945","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-geometry-aware-3d-generative#ran","syntology_url":"https://syntology.ai/paper/2112.07945","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.07945"}},"official":{"repos":["NVlabs/eg3d"],"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/combining-recurrent-convolutional-and","slug":"combining-recurrent-convolutional-and","title":"Combining Recurrent, Convolutional, and Continuous-time Models with Linear State-Space Layers","date":"2021-10-26","arxiv_id":"2110.13985","repositories_listed":2,"syntology":{"n":53,"n_ran":19,"n_constructed":0,"n_ran_checked":5,"n_instrument":14,"n_unverified":34,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 14 where Syntology's instrument failed) · 34 unverified","sample_list":"/paper/combining-recurrent-convolutional-and#ran","syntology_url":"https://syntology.ai/paper/2110.13985","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13985"}},"official":{"repos":["hazyresearch/state-spaces"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":16,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/soft-softmax-free-transformer-with-linear","slug":"soft-softmax-free-transformer-with-linear","title":"SOFT: Softmax-free Transformer with Linear Complexity","date":"2021-10-22","arxiv_id":"2110.11945","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/soft-softmax-free-transformer-with-linear#ran","syntology_url":"https://syntology.ai/paper/2110.11945","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.11945"}},"official":null}},{"url":"/paper/dropout-q-functions-for-doubly-efficient","slug":"dropout-q-functions-for-doubly-efficient","title":"Dropout Q-Functions for Doubly Efficient Reinforcement Learning","date":"2021-10-05","arxiv_id":"2110.02034","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":3,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 3 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/dropout-q-functions-for-doubly-efficient#ran","syntology_url":"https://syntology.ai/paper/2110.02034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.02034"}},"official":{"repos":["TakuyaHiraoka/Dropout-Q-Functions-for-Doubly-Efficient-Reinforcement-Learning"],"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":["found_in_text","official"]}}},{"url":"/paper/learning-span-level-interactions-for-aspect","slug":"learning-span-level-interactions-for-aspect","title":"Learning Span-Level Interactions for Aspect Sentiment Triplet Extraction","date":"2021-07-26","arxiv_id":"2107.12214","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-wavelet-distillation-from-neural","slug":"adaptive-wavelet-distillation-from-neural","title":"Adaptive wavelet distillation from neural networks through interpretations","date":"2021-07-19","arxiv_id":"2107.09145","repositories_listed":2,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/adaptive-wavelet-distillation-from-neural#ran","syntology_url":"https://syntology.ai/paper/2107.09145","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.09145"}},"official":{"repos":["Yu-Group/adaptive-wavelets","Yu-Group/adaptive-wavelet-distillation"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-reconstruction-meets-data-driven","slug":"end-to-end-reconstruction-meets-data-driven","title":"End-to-end reconstruction meets data-driven regularization for inverse problems","date":"2021-06-07","arxiv_id":"2106.03538","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/end-to-end-reconstruction-meets-data-driven#ran","syntology_url":"https://syntology.ai/paper/2106.03538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03538"}},"official":{"repos":["Subhadip-1/unrolling_meets_data_driven_regularization"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/shuowen-jiezi-linguistically-informed","slug":"shuowen-jiezi-linguistically-informed","title":"Sub-Character Tokenization for Chinese Pretrained Language Models","date":"2021-06-01","arxiv_id":"2106.00400","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/shuowen-jiezi-linguistically-informed#ran","syntology_url":"https://syntology.ai/paper/2106.00400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.00400"}},"official":{"repos":["thunlp/subchartokenization"],"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","unlocated"]}}},{"url":"/paper/not-all-images-are-worth-16x16-words-dynamic","slug":"not-all-images-are-worth-16x16-words-dynamic","title":"Not All Images are Worth 16x16 Words: Dynamic Transformers for Efficient Image Recognition","date":"2021-05-31","arxiv_id":"2105.15075","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/not-all-images-are-worth-16x16-words-dynamic#ran","syntology_url":"https://syntology.ai/paper/2105.15075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.15075"}},"official":{"repos":["blackfeather-wang/Dynamic-Vision-Transformer","blackfeather-wang/dynamic-vision-transformer-mindspore"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/boosting-light-weight-depth-estimation-via","slug":"boosting-light-weight-depth-estimation-via","title":"Boosting Light-Weight Depth Estimation Via Knowledge Distillation","date":"2021-05-13","arxiv_id":"2105.06143","repositories_listed":2,"syntology":null},{"url":"/paper/facial-emotion-recognition-state-of-the-art","slug":"facial-emotion-recognition-state-of-the-art","title":"Facial Emotion Recognition: State of the Art Performance on FER2013","date":"2021-05-08","arxiv_id":"2105.03588","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-focus-for-efficient-video","slug":"adaptive-focus-for-efficient-video","title":"Adaptive Focus for Efficient Video Recognition","date":"2021-05-07","arxiv_id":"2105.03245","repositories_listed":2,"syntology":{"n":23,"n_ran":13,"n_constructed":0,"n_ran_checked":7,"n_instrument":6,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":23,"phrase":"13 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; 6 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/adaptive-focus-for-efficient-video#ran","syntology_url":"https://syntology.ai/paper/2105.03245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03245"}},"official":{"repos":["blackfeather-wang/AdaFocus"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/pyramidal-reservoir-graph-neural-network","slug":"pyramidal-reservoir-graph-neural-network","title":"Pyramidal Reservoir Graph Neural Network","date":"2021-04-10","arxiv_id":"2104.04710","repositories_listed":2,"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/pyramidal-reservoir-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2104.04710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04710"}},"official":{"repos":["FilippoMB/Benchmark_dataset_for_graph_classification","FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/enhancing-medical-image-registration-via","slug":"enhancing-medical-image-registration-via","title":"Enhancing Medical Image Registration via Appearance Adjustment Networks","date":"2021-03-09","arxiv_id":"2103.05213","repositories_listed":2,"syntology":null},{"url":"/paper/sandglasset-a-light-multi-granularity-self","slug":"sandglasset-a-light-multi-granularity-self","title":"Sandglasset: A Light Multi-Granularity Self-attentive Network For Time-Domain Speech Separation","date":"2021-03-01","arxiv_id":"2103.00819","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/sandglasset-a-light-multi-granularity-self#ran","syntology_url":"https://syntology.ai/paper/2103.00819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.00819"}},"official":null}},{"url":"/paper/subdimensional-expansion-for-multi-objective","slug":"subdimensional-expansion-for-multi-objective","title":"Subdimensional Expansion for Multi-objective Multi-agent Path Finding","date":"2021-02-02","arxiv_id":"2102.01353","repositories_listed":2,"syntology":null},{"url":"/paper/disentangled-self-attentive-neural-networks","slug":"disentangled-self-attentive-neural-networks","title":"Disentangled Self-Attentive Neural Networks for Click-Through Rate Prediction","date":"2021-01-11","arxiv_id":"2101.03654","repositories_listed":2,"syntology":null},{"url":"/paper/augmented-lagrangian-adversarial-attacks","slug":"augmented-lagrangian-adversarial-attacks","title":"Augmented Lagrangian Adversarial Attacks","date":"2020-11-24","arxiv_id":"2011.11857","repositories_listed":2,"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/augmented-lagrangian-adversarial-attacks#ran","syntology_url":"https://syntology.ai/paper/2011.11857","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.11857"}},"official":{"repos":["jeromerony/augmented_lagrangian_adversarial_attacks"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/robust-behavioral-cloning-for-autonomous","slug":"robust-behavioral-cloning-for-autonomous","title":"Robust Behavioral Cloning for Autonomous Vehicles using End-to-End Imitation Learning","date":"2020-10-09","arxiv_id":"2010.04767","repositories_listed":2,"syntology":null},{"url":"/paper/quantifying-statistical-significance-of-1","slug":"quantifying-statistical-significance-of-1","title":"Quantifying Statistical Significance of Neural Network-based Image Segmentation by Selective Inference","date":"2020-10-05","arxiv_id":"2010.01823","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":8,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/quantifying-statistical-significance-of-1#ran","syntology_url":"https://syntology.ai/paper/2010.01823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01823"}},"official":{"repos":["vonguyenleduy/dnn_representation_selective_inference","vonguyenleduy/dnn_segmentation_selective_inference"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/distance-encoding-design-provably-more","slug":"distance-encoding-design-provably-more","title":"Distance Encoding: Design Provably More Powerful Neural Networks for Graph Representation Learning","date":"2020-08-31","arxiv_id":"2009.00142","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/distance-encoding-design-provably-more#ran","syntology_url":"https://syntology.ai/paper/2009.00142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.00142"}},"official":{"repos":["snap-stanford/distance-encoding"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-design-of-rf-and-gradient-waveforms-via","slug":"joint-design-of-rf-and-gradient-waveforms-via","title":"Joint Design of RF and gradient waveforms via auto-differentiation for 3D tailored excitation in MRI","date":"2020-08-24","arxiv_id":"2008.10594","repositories_listed":2,"syntology":null},{"url":"/paper/revisiting-temporal-modeling-for-video-super","slug":"revisiting-temporal-modeling-for-video-super","title":"Revisiting Temporal Modeling for Video Super-resolution","date":"2020-08-13","arxiv_id":"2008.05765","repositories_listed":2,"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/revisiting-temporal-modeling-for-video-super#ran","syntology_url":"https://syntology.ai/paper/2008.05765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.05765"}},"official":{"repos":["junpan19/RRN"],"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/improving-multispectral-pedestrian-detection","slug":"improving-multispectral-pedestrian-detection","title":"Improving Multispectral Pedestrian Detection by Addressing Modality Imbalance Problems","date":"2020-08-07","arxiv_id":"2008.03043","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-transformers-for-learning-multimodal","slug":"adaptive-transformers-for-learning-multimodal","title":"Adaptive Transformers for Learning Multimodal Representations","date":"2020-05-15","arxiv_id":"2005.07486","repositories_listed":2,"syntology":null},{"url":"/paper/self-organized-operational-neural-networks","slug":"self-organized-operational-neural-networks","title":"Self-Organized Operational Neural Networks with Generative Neurons","date":"2020-04-24","arxiv_id":"2004.11778","repositories_listed":2,"syntology":null},{"url":"/paper/computing-valid-p-value-for-optimal","slug":"computing-valid-p-value-for-optimal","title":"Computing Valid p-value for Optimal Changepoint by Selective Inference using Dynamic Programming","date":"2020-02-21","arxiv_id":"2002.09132","repositories_listed":2,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":9,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/computing-valid-p-value-for-optimal#ran","syntology_url":"https://syntology.ai/paper/2002.09132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09132"}},"official":null}},{"url":"/paper/langevin-dqn","slug":"langevin-dqn","title":"Langevin DQN","date":"2020-02-17","arxiv_id":"2002.07282","repositories_listed":2,"syntology":null},{"url":"/paper/vae-encoding-stochastic-process-priors-with","slug":"vae-encoding-stochastic-process-priors-with","title":"$π$VAE: a stochastic process prior for Bayesian deep learning with MCMC","date":"2020-02-17","arxiv_id":"2002.06873","repositories_listed":2,"syntology":null},{"url":"/paper/distance-metric-learning-for-graph-structured","slug":"distance-metric-learning-for-graph-structured","title":"Distance Metric Learning for Graph Structured Data","date":"2020-02-03","arxiv_id":"2002.00727","repositories_listed":2,"syntology":null},{"url":"/paper/p2-gan-efficient-style-transfer-using-single","slug":"p2-gan-efficient-style-transfer-using-single","title":"P$^2$-GAN: Efficient Style Transfer Using Single Style Image","date":"2020-01-21","arxiv_id":"2001.07466","repositories_listed":2,"syntology":null},{"url":"/paper/liteseg-a-novel-lightweight-convnet-for","slug":"liteseg-a-novel-lightweight-convnet-for","title":"LiteSeg: A Novel Lightweight ConvNet for Semantic Segmentation","date":"2019-12-13","arxiv_id":"1912.06683","repositories_listed":2,"syntology":null},{"url":"/paper/near-optimal-oracle-efficient-algorithms-for","slug":"near-optimal-oracle-efficient-algorithms-for","title":"Randomized Exploration for Non-Stationary Stochastic Linear Bandits","date":"2019-12-11","arxiv_id":"1912.05695","repositories_listed":2,"syntology":null},{"url":"/paper/fast-and-robust-spectrally-sparse-signal","slug":"fast-and-robust-spectrally-sparse-signal","title":"Accelerated Structured Alternating Projections for Robust Spectrally Sparse Signal Recovery","date":"2019-10-13","arxiv_id":"1910.05859","repositories_listed":2,"syntology":null}],"record_sha256":"a64416d22138a5bd7dd787838fa1017ba45d0d3ba6c641366a695dd07da0d461","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}