{"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/13","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":13,"pages_in_order":49,"rows_per_page":100,"rows":[1201,1300],"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/papers/12","next":"/task/computational-efficiency/papers/14","papers":[{"url":"/paper/hybrik-transformer","slug":"hybrik-transformer","title":"3D Human Pose and Shape Estimation via HybrIK-Transformer","date":"2023-02-09","arxiv_id":"2302.04774","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-select-pivotal-samples-for-meta","slug":"learning-to-select-pivotal-samples-for-meta","title":"Learning to Select Pivotal Samples for Meta Re-weighting","date":"2023-02-09","arxiv_id":"2302.04418","repositories_listed":1,"syntology":null},{"url":"/paper/a-fast-bootstrap-algorithm-for-causal","slug":"a-fast-bootstrap-algorithm-for-causal","title":"A Fast Bootstrap Algorithm for Causal Inference with Large Data","date":"2023-02-06","arxiv_id":"2302.02859","repositories_listed":1,"syntology":null},{"url":"/paper/single-cells-are-spatial-tokens-transformers","slug":"single-cells-are-spatial-tokens-transformers","title":"Single Cells Are Spatial Tokens: Transformers for Spatial Transcriptomic Data Imputation","date":"2023-02-06","arxiv_id":"2302.03038","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-end-to-end-video-question-answering","slug":"efficient-end-to-end-video-question-answering","title":"Efficient End-to-End Video Question Answering with Pyramidal Multimodal Transformer","date":"2023-02-04","arxiv_id":"2302.02136","repositories_listed":1,"syntology":null},{"url":"/paper/towards-practical-preferential-bayesian","slug":"towards-practical-preferential-bayesian","title":"Towards Practical Preferential Bayesian Optimization with Skew Gaussian Processes","date":"2023-02-03","arxiv_id":"2302.01513","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-practical-preferential-bayesian#ran","syntology_url":"https://syntology.ai/paper/2302.01513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01513"}},"official":{"repos":["CyberAgentAILab/preferentialBO"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-image-to-semantics-translation-for","slug":"few-shot-image-to-semantics-translation-for","title":"Few-Shot Image-to-Semantics Translation for Policy Transfer in Reinforcement Learning","date":"2023-01-31","arxiv_id":"2301.13343","repositories_listed":1,"syntology":null},{"url":"/paper/graph-mixer-networks","slug":"graph-mixer-networks","title":"Graph Mixer Networks","date":"2023-01-29","arxiv_id":"2301.12493","repositories_listed":1,"syntology":null},{"url":"/paper/maximum-optimality-margin-a-unified-approach","slug":"maximum-optimality-margin-a-unified-approach","title":"Maximum Optimality Margin: A Unified Approach for Contextual Linear Programming and Inverse Linear Programming","date":"2023-01-26","arxiv_id":"2301.11260","repositories_listed":1,"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/maximum-optimality-margin-a-unified-approach#ran","syntology_url":"https://syntology.ai/paper/2301.11260","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.11260"}},"official":{"repos":["liushangnoname/maximum-optimality-margin"],"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/rewarded-meta-pruning-meta-learning-with","slug":"rewarded-meta-pruning-meta-learning-with","title":"Rewarded meta-pruning: Meta Learning with Rewards for Channel Pruning","date":"2023-01-26","arxiv_id":"2301.11063","repositories_listed":1,"syntology":null},{"url":"/paper/rd-nas-enhancing-one-shot-supernet-ranking","slug":"rd-nas-enhancing-one-shot-supernet-ranking","title":"RD-NAS: Enhancing One-shot Supernet Ranking Ability via Ranking Distillation from Zero-cost Proxies","date":"2023-01-24","arxiv_id":"2301.09850","repositories_listed":1,"syntology":null},{"url":"/paper/out-of-distribution-detection-based-on-in","slug":"out-of-distribution-detection-based-on-in","title":"Out-of-Distribution Detection based on In-Distribution Data Patterns Memorization with Modern Hopfield Energy","date":"2023-01-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-asynchronous-intensity-representation-for","slug":"an-asynchronous-intensity-representation-for","title":"An Asynchronous Intensity Representation for Framed and Event Video Sources","date":"2023-01-20","arxiv_id":"2301.08783","repositories_listed":1,"syntology":null},{"url":"/paper/ntlink-a-toolkit-for-de-novo-genome-assembly","slug":"ntlink-a-toolkit-for-de-novo-genome-assembly","title":"ntLink: a toolkit for de novo genome assembly scaffolding and mapping using long reads","date":"2023-01-20","arxiv_id":"2301.08785","repositories_listed":1,"syntology":null},{"url":"/paper/pdformer-propagation-delay-aware-dynamic-long","slug":"pdformer-propagation-delay-aware-dynamic-long","title":"PDFormer: Propagation Delay-Aware Dynamic Long-Range Transformer for Traffic Flow Prediction","date":"2023-01-19","arxiv_id":"2301.07945","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":6,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 6 samples that ran constructed an object rather than computing a result","sample_list":"/paper/pdformer-propagation-delay-aware-dynamic-long#ran","syntology_url":"https://syntology.ai/paper/2301.07945","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.07945"}},"official":{"repos":["BUAABIGSCity/PDFormer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-prediction-and-behavioural-analysis-of","slug":"a-prediction-and-behavioural-analysis-of","title":"A prediction and behavioural analysis of machine learning methods for modelling travel mode choice","date":"2023-01-11","arxiv_id":"2301.04404","repositories_listed":1,"syntology":null},{"url":"/paper/topologically-regularized-data-embeddings","slug":"topologically-regularized-data-embeddings","title":"Topologically Regularized Data Embeddings","date":"2023-01-09","arxiv_id":"2301.03338","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-spiral-layers-for-efficient-3d","slug":"adaptive-spiral-layers-for-efficient-3d","title":"Adaptive Spiral Layers for Efficient 3D Representation Learning on Meshes","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/buffer-balancing-accuracy-efficiency-and","slug":"buffer-balancing-accuracy-efficiency-and","title":"BUFFER: Balancing Accuracy, Efficiency, and Generalizability in Point Cloud Registration","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-mix-based-data-augmentation","slug":"a-survey-of-mix-based-data-augmentation","title":"A Survey of Mix-based Data Augmentation: Taxonomy, Methods, Applications, and Explainability","date":"2022-12-21","arxiv_id":"2212.10888","repositories_listed":1,"syntology":null},{"url":"/paper/fast-fullsubnet-accelerate-full-band-and-sub","slug":"fast-fullsubnet-accelerate-full-band-and-sub","title":"Fast FullSubNet: Accelerate Full-band and Sub-band Fusion Model for Single-channel Speech Enhancement","date":"2022-12-18","arxiv_id":"2212.09019","repositories_listed":1,"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/fast-fullsubnet-accelerate-full-band-and-sub#ran","syntology_url":"https://syntology.ai/paper/2212.09019","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09019"}},"official":{"repos":["audio-westlakeu/fullsubnet"],"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/efficient-long-sequence-modeling-via-state","slug":"efficient-long-sequence-modeling-via-state","title":"Efficient Long Sequence Modeling via State Space Augmented Transformer","date":"2022-12-15","arxiv_id":"2212.08136","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"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 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) · 1 unverified","sample_list":"/paper/efficient-long-sequence-modeling-via-state#ran","syntology_url":"https://syntology.ai/paper/2212.08136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.08136"}},"official":{"repos":["microsoft/efficientlongsequencemodeling"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/stlgru-spatio-temporal-lightweight-graph-gru","slug":"stlgru-spatio-temporal-lightweight-graph-gru","title":"STLGRU: Spatio-Temporal Lightweight Graph GRU for Traffic Flow Prediction","date":"2022-12-08","arxiv_id":"2212.04548","repositories_listed":1,"syntology":null},{"url":"/paper/hadas-hardware-aware-dynamic-neural","slug":"hadas-hardware-aware-dynamic-neural","title":"HADAS: Hardware-Aware Dynamic Neural Architecture Search for Edge Performance Scaling","date":"2022-12-06","arxiv_id":"2212.03354","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-neural-networks-with","slug":"graph-convolutional-neural-networks-with","title":"Graph Convolutional Neural Networks with Diverse Negative Samples via Decomposed Determinant Point Processes","date":"2022-12-05","arxiv_id":"2212.02055","repositories_listed":1,"syntology":null},{"url":"/paper/softctc-unicode-x2013-semi-supervised","slug":"softctc-unicode-x2013-semi-supervised","title":"SoftCTC -- Semi-Supervised Learning for Text Recognition using Soft Pseudo-Labels","date":"2022-12-05","arxiv_id":"2212.02135","repositories_listed":1,"syntology":null},{"url":"/paper/robust-and-fast-measure-of-information-via","slug":"robust-and-fast-measure-of-information-via","title":"Robust and Fast Measure of Information via Low-rank Representation","date":"2022-11-30","arxiv_id":"2211.16784","repositories_listed":1,"syntology":null},{"url":"/paper/lie-group-forced-variational-integrator","slug":"lie-group-forced-variational-integrator","title":"Lie Group Forced Variational Integrator Networks for Learning and Control of Robot Systems","date":"2022-11-29","arxiv_id":"2211.16006","repositories_listed":1,"syntology":null},{"url":"/paper/towards-more-robust-interpretation-via-local","slug":"towards-more-robust-interpretation-via-local","title":"Towards More Robust Interpretation via Local Gradient Alignment","date":"2022-11-29","arxiv_id":"2211.15900","repositories_listed":1,"syntology":null},{"url":"/paper/fast-snarf-a-fast-deformer-for-articulated","slug":"fast-snarf-a-fast-deformer-for-articulated","title":"Fast-SNARF: A Fast Deformer for Articulated Neural Fields","date":"2022-11-28","arxiv_id":"2211.15601","repositories_listed":1,"syntology":null},{"url":"/paper/condensed-gradient-boosting","slug":"condensed-gradient-boosting","title":"Condensed Gradient Boosting","date":"2022-11-26","arxiv_id":"2211.14599","repositories_listed":1,"syntology":null},{"url":"/paper/mecch-metapath-context-convolution-based","slug":"mecch-metapath-context-convolution-based","title":"MECCH: Metapath Context Convolution-based Heterogeneous Graph Neural Networks","date":"2022-11-23","arxiv_id":"2211.12792","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-attentive-tokens-incorporating-token","slug":"beyond-attentive-tokens-incorporating-token","title":"Beyond Attentive Tokens: Incorporating Token Importance and Diversity for Efficient Vision Transformers","date":"2022-11-21","arxiv_id":"2211.11315","repositories_listed":1,"syntology":null},{"url":"/paper/a-transformer-framework-for-data-fusion-and","slug":"a-transformer-framework-for-data-fusion-and","title":"A Transformer Framework for Data Fusion and Multi-Task Learning in Smart Cities","date":"2022-11-18","arxiv_id":"2211.10506","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-inference-for-coadded","slug":"statistical-inference-for-coadded","title":"Statistical Inference for Coadded Astronomical Images","date":"2022-11-17","arxiv_id":"2211.09300","repositories_listed":1,"syntology":null},{"url":"/paper/model-predictive-control-for-signal-temporal-1","slug":"model-predictive-control-for-signal-temporal-1","title":"Model Predictive Control for Signal Temporal Logic Specifications with Time Interval Decomposition","date":"2022-11-15","arxiv_id":"2211.08031","repositories_listed":1,"syntology":null},{"url":"/paper/resilient-set-based-state-estimation-for","slug":"resilient-set-based-state-estimation-for","title":"Resilient Set-based State Estimation for Linear Time-Invariant Systems Using Zonotopes","date":"2022-11-15","arxiv_id":"2211.08474","repositories_listed":1,"syntology":null},{"url":"/paper/soft-landing-strategy-for-alleviating-the","slug":"soft-landing-strategy-for-alleviating-the","title":"Soft-Landing Strategy for Alleviating the Task Discrepancy Problem in Temporal Action Localization Tasks","date":"2022-11-11","arxiv_id":"2211.06023","repositories_listed":1,"syntology":null},{"url":"/paper/cluster-consistency-simple-yet-effect-robust","slug":"cluster-consistency-simple-yet-effect-robust","title":"Learning From Alarms: A Robust Learning Approach for Accurate Photoplethysmography-Based Atrial Fibrillation Detection using Eight Million Samples Labeled with Imprecise Arrhythmia Alarms","date":"2022-11-07","arxiv_id":"2211.03333","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-induces-robustness-information","slug":"privacy-induces-robustness-information","title":"Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimation","date":"2022-11-01","arxiv_id":"2211.00724","repositories_listed":1,"syntology":null},{"url":"/paper/ensemble-transport-smoothing-part-1-unified","slug":"ensemble-transport-smoothing-part-1-unified","title":"Ensemble transport smoothing. Part I: Unified framework","date":"2022-10-31","arxiv_id":"2210.17000","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-optimize-permutation-flow-shop","slug":"learning-to-optimize-permutation-flow-shop","title":"Learning to Optimize Permutation Flow Shop Scheduling via Graph-based Imitation Learning","date":"2022-10-31","arxiv_id":"2210.17178","repositories_listed":1,"syntology":null},{"url":"/paper/page-prototype-based-model-level-explanations","slug":"page-prototype-based-model-level-explanations","title":"PAGE: Prototype-Based Model-Level Explanations for Graph Neural Networks","date":"2022-10-31","arxiv_id":"2210.17159","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-memory-augmented-transformer-for","slug":"an-efficient-memory-augmented-transformer-for","title":"An Efficient Memory-Augmented Transformer for Knowledge-Intensive NLP Tasks","date":"2022-10-30","arxiv_id":"2210.16773","repositories_listed":1,"syntology":null},{"url":"/paper/bebert-efficient-and-robust-binary-ensemble","slug":"bebert-efficient-and-robust-binary-ensemble","title":"BEBERT: Efficient and Robust Binary Ensemble BERT","date":"2022-10-28","arxiv_id":"2210.15976","repositories_listed":1,"syntology":null},{"url":"/paper/delving-into-masked-autoencoders-for-multi","slug":"delving-into-masked-autoencoders-for-multi","title":"Delving into Masked Autoencoders for Multi-Label Thorax Disease Classification","date":"2022-10-23","arxiv_id":"2210.12843","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/delving-into-masked-autoencoders-for-multi#ran","syntology_url":"https://syntology.ai/paper/2210.12843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12843"}},"official":{"repos":["lambert-x/medical_mae"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-speech-translation-and-named-entity","slug":"joint-speech-translation-and-named-entity","title":"Joint Speech Translation and Named Entity Recognition","date":"2022-10-21","arxiv_id":"2210.11987","repositories_listed":1,"syntology":null},{"url":"/paper/ribseg-v2-a-large-scale-benchmark-for-rib","slug":"ribseg-v2-a-large-scale-benchmark-for-rib","title":"RibSeg v2: A Large-scale Benchmark for Rib Labeling and Anatomical Centerline Extraction","date":"2022-10-18","arxiv_id":"2210.09309","repositories_listed":1,"syntology":null},{"url":"/paper/dynamics-aware-adversarial-attack-of-adaptive","slug":"dynamics-aware-adversarial-attack-of-adaptive","title":"Dynamics-aware Adversarial Attack of Adaptive Neural Networks","date":"2022-10-15","arxiv_id":"2210.08159","repositories_listed":1,"syntology":null},{"url":"/paper/bi-stride-multi-scale-graph-neural-network","slug":"bi-stride-multi-scale-graph-neural-network","title":"Efficient Learning of Mesh-Based Physical Simulation with BSMS-GNN","date":"2022-10-05","arxiv_id":"2210.02573","repositories_listed":1,"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/bi-stride-multi-scale-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2210.02573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02573"}},"official":{"repos":["eydcao/bsms-gnn"],"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/centroid-distance-keypoint-detector-for","slug":"centroid-distance-keypoint-detector-for","title":"Centroid Distance Keypoint Detector for Colored Point Clouds","date":"2022-10-04","arxiv_id":"2210.01298","repositories_listed":1,"syntology":null},{"url":"/paper/learning-signal-temporal-logic-through-neural","slug":"learning-signal-temporal-logic-through-neural","title":"Learning Signal Temporal Logic through Neural Network for Interpretable Classification","date":"2022-10-04","arxiv_id":"2210.01910","repositories_listed":1,"syntology":null},{"url":"/paper/concurrent-recognition-and-segmentation-with","slug":"concurrent-recognition-and-segmentation-with","title":"Learning Hierarchical Image Segmentation For Recognition and By Recognition","date":"2022-10-01","arxiv_id":"2210.00314","repositories_listed":1,"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":4,"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/concurrent-recognition-and-segmentation-with#ran","syntology_url":"https://syntology.ai/paper/2210.00314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00314"}},"official":{"repos":["twke18/cast"],"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/ernie-vil-2-0-multi-view-contrastive-learning","slug":"ernie-vil-2-0-multi-view-contrastive-learning","title":"ERNIE-ViL 2.0: Multi-view Contrastive Learning for Image-Text Pre-training","date":"2022-09-30","arxiv_id":"2209.15270","repositories_listed":1,"syntology":null},{"url":"/paper/offline-reinforcement-learning-via-high","slug":"offline-reinforcement-learning-via-high","title":"Offline Reinforcement Learning via High-Fidelity Generative Behavior Modeling","date":"2022-09-29","arxiv_id":"2209.14548","repositories_listed":1,"syntology":null},{"url":"/paper/neural-generalized-ordinary-differential","slug":"neural-generalized-ordinary-differential","title":"Neural Generalized Ordinary Differential Equations with Layer-varying Parameters","date":"2022-09-21","arxiv_id":"2209.10633","repositories_listed":1,"syntology":null},{"url":"/paper/hipart-hierarchical-divisive-clustering","slug":"hipart-hierarchical-divisive-clustering","title":"HiPart: Hierarchical Divisive Clustering Toolbox","date":"2022-09-18","arxiv_id":"2209.08680","repositories_listed":1,"syntology":null},{"url":"/paper/svnet-where-so-3-equivariance-meets","slug":"svnet-where-so-3-equivariance-meets","title":"SVNet: Where SO(3) Equivariance Meets Binarization on Point Cloud Representation","date":"2022-09-13","arxiv_id":"2209.05924","repositories_listed":1,"syntology":null},{"url":"/paper/tube-based-zonotopic-data-driven-predictive","slug":"tube-based-zonotopic-data-driven-predictive","title":"Tube-Based Zonotopic Data-Driven Predictive Control","date":"2022-09-07","arxiv_id":"2209.03500","repositories_listed":1,"syntology":null},{"url":"/paper/latent-similarity-identifies-important","slug":"latent-similarity-identifies-important","title":"Latent Similarity Identifies Important Functional Connections for Phenotype Prediction","date":"2022-08-30","arxiv_id":"2208.14484","repositories_listed":1,"syntology":null},{"url":"/paper/inferring-subhalo-effective-density-slopes","slug":"inferring-subhalo-effective-density-slopes","title":"Inferring subhalo effective density slopes from strong lensing observations with neural likelihood-ratio estimation","date":"2022-08-29","arxiv_id":"2208.13796","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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) · 0 unverified","sample_list":"/paper/inferring-subhalo-effective-density-slopes#ran","syntology_url":"https://syntology.ai/paper/2208.13796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.13796"}},"official":{"repos":["gemyxzhang/neural-subhalo-slope"],"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/algorithmic-differentiation-for-automatized","slug":"algorithmic-differentiation-for-automatized","title":"Algorithmic Differentiation for Automated Modeling of Machine Learned Force Fields","date":"2022-08-25","arxiv_id":"2208.12104","repositories_listed":1,"syntology":{"n":13,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":10,"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) · 10 unverified","sample_list":"/paper/algorithmic-differentiation-for-automatized#ran","syntology_url":"https://syntology.ai/paper/2208.12104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.12104"}},"official":{"repos":["niklasschmitz/ad-kernels"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/curbing-task-interference-using","slug":"curbing-task-interference-using","title":"Curbing Task Interference using Representation Similarity-Guided Multi-Task Feature Sharing","date":"2022-08-19","arxiv_id":"2208.09427","repositories_listed":1,"syntology":null},{"url":"/paper/towards-efficient-capsule-networks","slug":"towards-efficient-capsule-networks","title":"Towards Efficient Capsule Networks","date":"2022-08-19","arxiv_id":"2208.09203","repositories_listed":1,"syntology":null},{"url":"/paper/a-unifying-partially-interpretable-framework","slug":"a-unifying-partially-interpretable-framework","title":"Regression modelling of spatiotemporal extreme U.S. wildfires via partially-interpretable neural networks","date":"2022-08-16","arxiv_id":"2208.07581","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-numerical-solvers-for-large","slug":"accelerating-numerical-solvers-for-large","title":"On Fast Simulation of Dynamical System with Neural Vector Enhanced Numerical Solver","date":"2022-08-07","arxiv_id":"2208.03680","repositories_listed":1,"syntology":null},{"url":"/paper/are-gradients-on-graph-structure-reliable-in","slug":"are-gradients-on-graph-structure-reliable-in","title":"Are Gradients on Graph Structure Reliable in Gray-box Attacks?","date":"2022-08-07","arxiv_id":"2208.05514","repositories_listed":1,"syntology":null},{"url":"/paper/robust-graph-neural-networks-using-weighted","slug":"robust-graph-neural-networks-using-weighted","title":"Robust Graph Neural Networks using Weighted Graph Laplacian","date":"2022-08-03","arxiv_id":"2208.01853","repositories_listed":1,"syntology":null},{"url":"/paper/accelerated-and-interpretable-oblique-random","slug":"accelerated-and-interpretable-oblique-random","title":"Accelerated and interpretable oblique random survival forests","date":"2022-08-01","arxiv_id":"2208.01129","repositories_listed":1,"syntology":null},{"url":"/paper/transcl-transformer-makes-strong-and-flexible","slug":"transcl-transformer-makes-strong-and-flexible","title":"TransCL: Transformer Makes Strong and Flexible Compressive Learning","date":"2022-07-25","arxiv_id":"2207.11972","repositories_listed":1,"syntology":null},{"url":"/paper/seplut-separable-image-adaptive-lookup-tables","slug":"seplut-separable-image-adaptive-lookup-tables","title":"SepLUT: Separable Image-adaptive Lookup Tables for Real-time Image Enhancement","date":"2022-07-18","arxiv_id":"2207.08351","repositories_listed":1,"syntology":null},{"url":"/paper/bip-boost-invariant-polynomials-for-efficient","slug":"bip-boost-invariant-polynomials-for-efficient","title":"BIP: Boost Invariant Polynomials for Efficient Jet Tagging","date":"2022-07-17","arxiv_id":"2207.08272","repositories_listed":1,"syntology":null},{"url":"/paper/continual-learning-for-on-device","slug":"continual-learning-for-on-device","title":"Continual Learning For On-Device Environmental Sound Classification","date":"2022-07-15","arxiv_id":"2207.07429","repositories_listed":1,"syntology":null},{"url":"/paper/strike-goldd-4-0-user-friendly-efficient","slug":"strike-goldd-4-0-user-friendly-efficient","title":"STRIKE-GOLDD 4.0: user-friendly, efficient analysis of structural identifiability and observability","date":"2022-07-15","arxiv_id":"2207.07346","repositories_listed":1,"syntology":null},{"url":"/paper/equivariant-hypergraph-diffusion-neural","slug":"equivariant-hypergraph-diffusion-neural","title":"Equivariant Hypergraph Diffusion Neural Operators","date":"2022-07-14","arxiv_id":"2207.06680","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/equivariant-hypergraph-diffusion-neural#ran","syntology_url":"https://syntology.ai/paper/2207.06680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06680"}},"official":{"repos":["graph-com/ed-hnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adamnodes-when-neural-ode-meets-adaptive","slug":"adamnodes-when-neural-ode-meets-adaptive","title":"AdamNODEs: When Neural ODE Meets Adaptive Moment Estimation","date":"2022-07-13","arxiv_id":"2207.06066","repositories_listed":1,"syntology":null},{"url":"/paper/pointnorm-normalization-is-all-you-need-for","slug":"pointnorm-normalization-is-all-you-need-for","title":"PointNorm: Dual Normalization is All You Need for Point Cloud Analysis","date":"2022-07-13","arxiv_id":"2207.06324","repositories_listed":1,"syntology":null},{"url":"/paper/interactive-combinatorial-bandits-balancing","slug":"interactive-combinatorial-bandits-balancing","title":"Online SuBmodular + SuPermodular (BP) Maximization with Bandit Feedback","date":"2022-07-07","arxiv_id":"2207.03091","repositories_listed":1,"syntology":null},{"url":"/paper/robust-optimal-well-control-using-an-adaptive","slug":"robust-optimal-well-control-using-an-adaptive","title":"Robust optimal well control using an adaptive multi-grid reinforcement learning framework","date":"2022-07-07","arxiv_id":"2207.03253","repositories_listed":1,"syntology":null},{"url":"/paper/style-interleaved-learning-for-generalizable","slug":"style-interleaved-learning-for-generalizable","title":"Style Interleaved Learning for Generalizable Person Re-identification","date":"2022-07-07","arxiv_id":"2207.03132","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-synchronization-avoiding","slug":"data-driven-synchronization-avoiding","title":"Data-driven synchronization-avoiding algorithms in the explicit distributed structural analysis of soft tissue","date":"2022-07-05","arxiv_id":"2207.02194","repositories_listed":1,"syntology":null},{"url":"/paper/softmax-free-linear-transformers","slug":"softmax-free-linear-transformers","title":"Softmax-free Linear Transformers","date":"2022-07-05","arxiv_id":"2207.03341","repositories_listed":1,"syntology":null},{"url":"/paper/benchmark-dataset-for-precipitation","slug":"benchmark-dataset-for-precipitation","title":"Benchmark Dataset for Precipitation Forecasting by Post-Processing the Numerical Weather Prediction","date":"2022-06-30","arxiv_id":"2206.15241","repositories_listed":1,"syntology":null},{"url":"/paper/electronic-structure-properties-from-atom","slug":"electronic-structure-properties-from-atom","title":"Electronic-structure properties from atom-centered predictions of the electron density","date":"2022-06-28","arxiv_id":"2206.14087","repositories_listed":1,"syntology":null},{"url":"/paper/two-stage-neural-contextual-bandits-for","slug":"two-stage-neural-contextual-bandits-for","title":"Two-Stage Neural Contextual Bandits for Personalised News Recommendation","date":"2022-06-26","arxiv_id":"2206.14648","repositories_listed":1,"syntology":null},{"url":"/paper/superadditivity-and-convex-optimization-for","slug":"superadditivity-and-convex-optimization-for","title":"Superadditivity and Convex Optimization for Globally Optimal Cell Segmentation using Deformable Shape Models","date":"2022-06-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/square-one-bias-in-nlp-towards-a-multi-2","slug":"square-one-bias-in-nlp-towards-a-multi-2","title":"Square One Bias in NLP: Towards a Multi-Dimensional Exploration of the Research Manifold","date":"2022-06-20","arxiv_id":"2206.09755","repositories_listed":1,"syntology":null},{"url":"/paper/deep-inverse-reinforcement-learning-for-route","slug":"deep-inverse-reinforcement-learning-for-route","title":"A deep inverse reinforcement learning approach to route choice modeling with context-dependent rewards","date":"2022-06-18","arxiv_id":"2206.10598","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-the-optimal-covariance-with","slug":"estimating-the-optimal-covariance-with","title":"Estimating the Optimal Covariance with Imperfect Mean in Diffusion Probabilistic Models","date":"2022-06-15","arxiv_id":"2206.07309","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-reliable-evaluation-of-adversarial-1","slug":"fast-and-reliable-evaluation-of-adversarial-1","title":"Fast and Reliable Evaluation of Adversarial Robustness with Minimum-Margin Attack","date":"2022-06-15","arxiv_id":"2206.07314","repositories_listed":1,"syntology":null},{"url":"/paper/specnet2-orthogonalization-free-spectral","slug":"specnet2-orthogonalization-free-spectral","title":"SpecNet2: Orthogonalization-free spectral embedding by neural networks","date":"2022-06-14","arxiv_id":"2206.06644","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-gradient-descent-without-full-data","slug":"stochastic-gradient-descent-without-full-data","title":"Stochastic Gradient Descent without Full Data Shuffle","date":"2022-06-12","arxiv_id":"2206.05830","repositories_listed":1,"syntology":null},{"url":"/paper/reducing-capacity-gap-in-knowledge","slug":"reducing-capacity-gap-in-knowledge","title":"Reducing Capacity Gap in Knowledge Distillation with Review Mechanism for Crowd Counting","date":"2022-06-11","arxiv_id":"2206.05475","repositories_listed":1,"syntology":null},{"url":"/paper/learning-ego-3d-representation-as-ray-tracing","slug":"learning-ego-3d-representation-as-ray-tracing","title":"Learning Ego 3D Representation as Ray Tracing","date":"2022-06-08","arxiv_id":"2206.04042","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-cardiac-mri-reconstruction-using","slug":"dynamic-cardiac-mri-reconstruction-using","title":"Dynamic Cardiac MRI Reconstruction Using Combined Tensor Nuclear Norm and Casorati Matrix Nuclear Norm Regularizations","date":"2022-06-02","arxiv_id":"2206.00831","repositories_listed":1,"syntology":null},{"url":"/paper/itkd-interchange-transfer-based-knowledge","slug":"itkd-interchange-transfer-based-knowledge","title":"itKD: Interchange Transfer-based Knowledge Distillation for 3D Object Detection","date":"2022-05-31","arxiv_id":"2205.15531","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-open-world-using-incremental","slug":"exploring-the-open-world-using-incremental","title":"Exploring the Open World Using Incremental Extreme Value Machines","date":"2022-05-30","arxiv_id":"2205.14892","repositories_listed":1,"syntology":null},{"url":"/paper/features-extraction-and-reduction-techniques","slug":"features-extraction-and-reduction-techniques","title":"Features extraction and reduction techniques with optimized SVM for Persian/Arabic handwritten digits recognition","date":"2022-05-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/linear-algorithms-for-nonparametric","slug":"linear-algorithms-for-nonparametric","title":"Linear Algorithms for Robust and Scalable Nonparametric Multiclass Probability Estimation","date":"2022-05-25","arxiv_id":"2205.12460","repositories_listed":1,"syntology":null},{"url":"/paper/fast-abc-boost-a-unified-framework-for","slug":"fast-abc-boost-a-unified-framework-for","title":"Fast ABC-Boost: A Unified Framework for Selecting the Base Class in Multi-Class Classification","date":"2022-05-22","arxiv_id":"2205.10927","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/fast-abc-boost-a-unified-framework-for#ran","syntology_url":"https://syntology.ai/paper/2205.10927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10927"}},"official":null}}],"record_sha256":"21aba5f648b1565b5b9c5e70e442783c07b40a16d4b6cd5f84a1a0d3e0c2c44d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}