{"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/15","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":15,"pages_in_order":49,"rows_per_page":100,"rows":[1401,1500],"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/14","next":"/task/computational-efficiency/papers/16","papers":[{"url":"/paper/obtaining-better-static-word-embeddings-using","slug":"obtaining-better-static-word-embeddings-using","title":"Obtaining Better Static Word Embeddings Using Contextual Embedding Models","date":"2021-06-08","arxiv_id":"2106.04302","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/obtaining-better-static-word-embeddings-using#ran","syntology_url":"https://syntology.ai/paper/2106.04302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04302"}},"official":{"repos":["epfml/X2Static"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-filtering-for-multiscale","slug":"stochastic-filtering-for-multiscale","title":"Stochastic filtering for multiscale stochastic reaction networks based on hybrid approximations","date":"2021-06-06","arxiv_id":"2106.03276","repositories_listed":1,"syntology":null},{"url":"/paper/protores-proto-residual-architecture-for-deep","slug":"protores-proto-residual-architecture-for-deep","title":"ProtoRes: Proto-Residual Network for Pose Authoring via Learned Inverse Kinematics","date":"2021-06-03","arxiv_id":"2106.01981","repositories_listed":1,"syntology":null},{"url":"/paper/global-selector-a-new-benchmark-dataset-and","slug":"global-selector-a-new-benchmark-dataset-and","title":"Uni-Encoder: A Fast and Accurate Response Selection Paradigm for Generation-Based Dialogue Systems","date":"2021-06-02","arxiv_id":"2106.01263","repositories_listed":1,"syntology":null},{"url":"/paper/a-framework-for-data-driven-solution-and","slug":"a-framework-for-data-driven-solution-and","title":"A framework for data-driven solution and parameter estimation of PDEs using conditional generative adversarial networks","date":"2021-05-27","arxiv_id":"2105.13136","repositories_listed":1,"syntology":null},{"url":"/paper/multi-resolution-data-fusion-for","slug":"multi-resolution-data-fusion-for","title":"Multi-Resolution Data Fusion for Super Resolution Imaging","date":"2021-05-13","arxiv_id":"2105.06533","repositories_listed":1,"syntology":null},{"url":"/paper/auction-based-combinatorial-multi-armed","slug":"auction-based-combinatorial-multi-armed","title":"Auction-Based Combinatorial Multi-Armed Bandit Mechanisms with Strategic Arms","date":"2021-05-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/uvstyle-net-unsupervised-few-shot-learning-of","slug":"uvstyle-net-unsupervised-few-shot-learning-of","title":"UVStyle-Net: Unsupervised Few-shot Learning of 3D Style Similarity Measure for B-Reps","date":"2021-04-28","arxiv_id":"2105.02961","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/uvstyle-net-unsupervised-few-shot-learning-of#ran","syntology_url":"https://syntology.ai/paper/2105.02961","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02961"}},"official":{"repos":["AutodeskAILab/UVStyle-Net"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-5th-ai-city-challenge","slug":"the-5th-ai-city-challenge","title":"The 5th AI City Challenge","date":"2021-04-25","arxiv_id":"2104.12233","repositories_listed":1,"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/the-5th-ai-city-challenge#ran","syntology_url":"https://syntology.ai/paper/2104.12233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12233"}},"official":null}},{"url":"/paper/consistent-accelerated-inference-via","slug":"consistent-accelerated-inference-via","title":"Consistent Accelerated Inference via Confident Adaptive Transformers","date":"2021-04-18","arxiv_id":"2104.08803","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/consistent-accelerated-inference-via#ran","syntology_url":"https://syntology.ai/paper/2104.08803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08803"}},"official":{"repos":["TalSchuster/CATs"],"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/improving-hyper-relational-knowledge-graph","slug":"improving-hyper-relational-knowledge-graph","title":"Improving Hyper-Relational Knowledge Graph Completion","date":"2021-04-16","arxiv_id":"2104.08167","repositories_listed":1,"syntology":null},{"url":"/paper/condensenet-v2-sparse-feature-reactivation","slug":"condensenet-v2-sparse-feature-reactivation","title":"CondenseNet V2: Sparse Feature Reactivation for Deep Networks","date":"2021-04-09","arxiv_id":"2104.04382","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/condensenet-v2-sparse-feature-reactivation#ran","syntology_url":"https://syntology.ai/paper/2104.04382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04382"}},"official":{"repos":["jianghaojun/CondenseNetV2"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/sdan-squared-deformable-alignment-network-for","slug":"sdan-squared-deformable-alignment-network-for","title":"SDAN: Squared Deformable Alignment Network for Learning Misaligned Optical Zoom","date":"2021-04-02","arxiv_id":"2104.00848","repositories_listed":1,"syntology":null},{"url":"/paper/linear-systems-with-neural-network","slug":"linear-systems-with-neural-network","title":"Linear systems with neural network nonlinearities: Improved stability analysis via acausal Zames-Falb multipliers","date":"2021-03-31","arxiv_id":"2103.17106","repositories_listed":1,"syntology":null},{"url":"/paper/training-sparse-neural-network-by","slug":"training-sparse-neural-network-by","title":"Training Sparse Neural Network by Constraining Synaptic Weight on Unit Lp Sphere","date":"2021-03-30","arxiv_id":"2103.16013","repositories_listed":1,"syntology":null},{"url":"/paper/cloth-changing-person-re-identification-from","slug":"cloth-changing-person-re-identification-from","title":"Cloth-Changing Person Re-identification from A Single Image with Gait Prediction and Regularization","date":"2021-03-29","arxiv_id":"2103.15537","repositories_listed":1,"syntology":null},{"url":"/paper/a-computationally-efficient-neural-network-1","slug":"a-computationally-efficient-neural-network-1","title":"Combining distribution-based neural networks to predict weather forecast probabilities","date":"2021-03-26","arxiv_id":"2103.14430","repositories_listed":1,"syntology":null},{"url":"/paper/parallel-model-exploration-for-tumor","slug":"parallel-model-exploration-for-tumor","title":"Parallel Model Exploration for Tumor Treatment Simulations","date":"2021-03-25","arxiv_id":"2103.14132","repositories_listed":1,"syntology":null},{"url":"/paper/deep-implicit-moving-least-squares-functions","slug":"deep-implicit-moving-least-squares-functions","title":"Deep Implicit Moving Least-Squares Functions for 3D Reconstruction","date":"2021-03-23","arxiv_id":"2103.12266","repositories_listed":1,"syntology":{"n":14,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/deep-implicit-moving-least-squares-functions#ran","syntology_url":"https://syntology.ai/paper/2103.12266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12266"}},"official":{"repos":["Andy97/DeepMLS"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/deepopf-v-solving-ac-opf-problems-efficiently","slug":"deepopf-v-solving-ac-opf-problems-efficiently","title":"DeepOPF-V: Solving AC-OPF Problems Efficiently","date":"2021-03-22","arxiv_id":"2103.11793","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-cnn-bilstm-voice-activity-detector","slug":"a-hybrid-cnn-bilstm-voice-activity-detector","title":"A Hybrid CNN-BiLSTM Voice Activity Detector","date":"2021-03-05","arxiv_id":"2103.03529","repositories_listed":1,"syntology":null},{"url":"/paper/improving-computational-efficiency-in-visual","slug":"improving-computational-efficiency-in-visual","title":"Improving Computational Efficiency in Visual Reinforcement Learning via Stored Embeddings","date":"2021-03-04","arxiv_id":"2103.02886","repositories_listed":1,"syntology":null},{"url":"/paper/real-world-single-image-super-resolution-a","slug":"real-world-single-image-super-resolution-a","title":"Real-World Single Image Super-Resolution: A Brief Review","date":"2021-03-03","arxiv_id":"2103.02368","repositories_listed":1,"syntology":null},{"url":"/paper/a-pose-only-solution-to-visual-reconstruction","slug":"a-pose-only-solution-to-visual-reconstruction","title":"A Pose-only Solution to Visual Reconstruction and Navigation","date":"2021-03-02","arxiv_id":"2103.01530","repositories_listed":1,"syntology":null},{"url":"/paper/faith-fast-iterative-half-plane-focus-of","slug":"faith-fast-iterative-half-plane-focus-of","title":"FAITH: Fast iterative half-plane focus of expansion estimation using event-based optic flow","date":"2021-02-25","arxiv_id":"2102.12823","repositories_listed":1,"syntology":null},{"url":"/paper/anytime-sampling-for-autoregressive-models-1","slug":"anytime-sampling-for-autoregressive-models-1","title":"Anytime Sampling for Autoregressive Models via Ordered Autoencoding","date":"2021-02-23","arxiv_id":"2102.11495","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/anytime-sampling-for-autoregressive-models-1#ran","syntology_url":"https://syntology.ai/paper/2102.11495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11495"}},"official":{"repos":["Newbeeer/Anytime-Auto-Regressive-Model"],"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/solving-high-dimensional-parabolic-pdes-using","slug":"solving-high-dimensional-parabolic-pdes-using","title":"Solving high-dimensional parabolic PDEs using the tensor train format","date":"2021-02-23","arxiv_id":"2102.11830","repositories_listed":1,"syntology":null},{"url":"/paper/generative-archimedean-copulas","slug":"generative-archimedean-copulas","title":"Generative Archimedean Copulas","date":"2021-02-22","arxiv_id":"2102.11351","repositories_listed":1,"syntology":null},{"url":"/paper/manifold-learning-with-approximate-nearest","slug":"manifold-learning-with-approximate-nearest","title":"Computationally Efficient Learning of Statistical Manifolds","date":"2021-02-22","arxiv_id":"2103.11773","repositories_listed":1,"syntology":null},{"url":"/paper/ps-and-qs-quantization-aware-pruning-for","slug":"ps-and-qs-quantization-aware-pruning-for","title":"Ps and Qs: Quantization-aware pruning for efficient low latency neural network inference","date":"2021-02-22","arxiv_id":"2102.11289","repositories_listed":1,"syntology":null},{"url":"/paper/you-only-compress-once-optimal-data","slug":"you-only-compress-once-optimal-data","title":"You Only Compress Once: Optimal Data Compression for Estimating Linear Models","date":"2021-02-22","arxiv_id":"2102.11297","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-two-stream-network-for-violence","slug":"efficient-two-stream-network-for-violence","title":"Efficient Two-Stream Network for Violence Detection Using Separable Convolutional LSTM","date":"2021-02-21","arxiv_id":"2102.10590","repositories_listed":1,"syntology":null},{"url":"/paper/top-k-extreme-contextual-bandits-with-arm","slug":"top-k-extreme-contextual-bandits-with-arm","title":"Top-$k$ eXtreme Contextual Bandits with Arm Hierarchy","date":"2021-02-15","arxiv_id":"2102.07800","repositories_listed":1,"syntology":null},{"url":"/paper/tight-lower-bounds-for-dynamic-time-warping","slug":"tight-lower-bounds-for-dynamic-time-warping","title":"Tight lower bounds for Dynamic Time Warping","date":"2021-02-14","arxiv_id":"2102.07076","repositories_listed":1,"syntology":null},{"url":"/paper/amplitude-demodulation-of-wideband-signals","slug":"amplitude-demodulation-of-wideband-signals","title":"Fast and Accurate Amplitude Demodulation of Wideband Signals","date":"2021-02-09","arxiv_id":"2102.04832","repositories_listed":1,"syntology":null},{"url":"/paper/refining-a-nearest-neighbor-graph-for-a","slug":"refining-a-nearest-neighbor-graph-for-a","title":"Refining a -nearest neighbor graph for a computationally efficient spectral clustering","date":"2021-02-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-universal-framework-for-featurization-of","slug":"a-universal-framework-for-featurization-of","title":"A Universal Framework for Featurization of Atomistic Systems","date":"2021-02-04","arxiv_id":"2102.02390","repositories_listed":1,"syntology":null},{"url":"/paper/a-multiscale-environment-for-learning-by","slug":"a-multiscale-environment-for-learning-by","title":"A Multiscale Environment for Learning by Diffusion","date":"2021-01-31","arxiv_id":"2102.00500","repositories_listed":1,"syntology":null},{"url":"/paper/recurrent-localization-networks-applied-to","slug":"recurrent-localization-networks-applied-to","title":"Recurrent Localization Networks applied to the Lippmann-Schwinger Equation","date":"2021-01-29","arxiv_id":"2102.00063","repositories_listed":1,"syntology":null},{"url":"/paper/cobbo-coordinate-backoff-bayesian","slug":"cobbo-coordinate-backoff-bayesian","title":"CobBO: Coordinate Backoff Bayesian Optimization with Two-Stage Kernels","date":"2021-01-13","arxiv_id":"2101.05147","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-prostate-cancer-detection-in-bpmri","slug":"end-to-end-prostate-cancer-detection-in-bpmri","title":"End-to-end Prostate Cancer Detection in bpMRI via 3D CNNs: Effects of Attention Mechanisms, Clinical Priori and Decoupled False Positive Reduction","date":"2021-01-08","arxiv_id":"2101.03244","repositories_listed":1,"syntology":null},{"url":"/paper/rdi-net-relational-dynamic-inference-networks","slug":"rdi-net-relational-dynamic-inference-networks","title":"RDI-Net: Relational Dynamic Inference Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adjusted-chi-square-test-for-degree-corrected","slug":"adjusted-chi-square-test-for-degree-corrected","title":"Adjusted chi-square test for degree-corrected block models","date":"2020-12-30","arxiv_id":"2012.15047","repositories_listed":1,"syntology":null},{"url":"/paper/doubly-stochastic-generative-arrivals","slug":"doubly-stochastic-generative-arrivals","title":"A Doubly Stochastic Simulator with Applications in Arrivals Modeling and Simulation","date":"2020-12-27","arxiv_id":"2012.13940","repositories_listed":1,"syntology":null},{"url":"/paper/a-non-alternating-graph-hashing-algorithm-for","slug":"a-non-alternating-graph-hashing-algorithm-for","title":"A non-alternating graph hashing algorithm for large scale image search","date":"2020-12-24","arxiv_id":"2012.13138","repositories_listed":1,"syntology":null},{"url":"/paper/stainnet-a-fast-and-robust-stain","slug":"stainnet-a-fast-and-robust-stain","title":"StainNet: a fast and robust stain normalization network","date":"2020-12-23","arxiv_id":"2012.12535","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-verification-of-quantized-neural","slug":"scalable-verification-of-quantized-neural","title":"Scalable Verification of Quantized Neural Networks (Technical Report)","date":"2020-12-15","arxiv_id":"2012.08185","repositories_listed":1,"syntology":null},{"url":"/paper/inspire-intensity-and-spatial-information","slug":"inspire-intensity-and-spatial-information","title":"INSPIRE: Intensity and spatial information-based deformable image registration","date":"2020-12-14","arxiv_id":"2012.07208","repositories_listed":1,"syntology":null},{"url":"/paper/an-empirical-evaluation-of-functional","slug":"an-empirical-evaluation-of-functional","title":"An empirical evaluation of functional alignment using inter-subject decoding","date":"2020-12-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/extending-conditional-convolution-structures","slug":"extending-conditional-convolution-structures","title":"EXTENDING CONDITIONAL CONVOLUTION STRUCTURES FOR ENHANCING MULTITASKING CONTINUAL LEARNING","date":"2020-12-07","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/linear-reduced-order-model-predictive-control","slug":"linear-reduced-order-model-predictive-control","title":"Linear Reduced Order Model Predictive Control","date":"2020-12-06","arxiv_id":"2012.03384","repositories_listed":1,"syntology":null},{"url":"/paper/multistage-attention-resu-net-for-semantic","slug":"multistage-attention-resu-net-for-semantic","title":"Multi-stage Attention ResU-Net for Semantic Segmentation of Fine-Resolution Remote Sensing Images","date":"2020-11-29","arxiv_id":"2011.14302","repositories_listed":1,"syntology":null},{"url":"/paper/multi-features-guidance-network-for-partial","slug":"multi-features-guidance-network-for-partial","title":"Multi-Features Guidance Network for partial-to-partial point cloud registration","date":"2020-11-24","arxiv_id":"2011.12079","repositories_listed":1,"syntology":null},{"url":"/paper/a-variational-infinite-mixture-for","slug":"a-variational-infinite-mixture-for","title":"A Variational Infinite Mixture for Probabilistic Inverse Dynamics Learning","date":"2020-11-10","arxiv_id":"2011.05217","repositories_listed":1,"syntology":null},{"url":"/paper/magic-learning-macro-actions-for-online-pomdp","slug":"magic-learning-macro-actions-for-online-pomdp","title":"MAGIC: Learning Macro-Actions for Online POMDP Planning","date":"2020-11-07","arxiv_id":"2011.03813","repositories_listed":1,"syntology":null},{"url":"/paper/multi-2oie-multilingual-open-information-1","slug":"multi-2oie-multilingual-open-information-1","title":"Multi\\^2OIE: Multilingual Open Information Extraction Based on Multi-Head Attention with BERT","date":"2020-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-local-minimal-intensity-prior-and-an","slug":"a-simple-local-minimal-intensity-prior-and-an","title":"A Simple Local Minimal Intensity Prior and An Improved Algorithm for Blind Image Deblurring","date":"2020-10-29","arxiv_id":"1906.06642","repositories_listed":1,"syntology":null},{"url":"/paper/a-computationally-efficient-approach-to-black","slug":"a-computationally-efficient-approach-to-black","title":"A Domain-Shrinking based Bayesian Optimization Algorithm with Order-Optimal Regret Performance","date":"2020-10-27","arxiv_id":"2010.13997","repositories_listed":1,"syntology":null},{"url":"/paper/low-complexity-decentralized-algorithm-for","slug":"low-complexity-decentralized-algorithm-for","title":"Low-complexity decentralized algorithm for aggregate load control of thermostatic loads","date":"2020-10-22","arxiv_id":"2010.12443","repositories_listed":1,"syntology":null},{"url":"/paper/federated-bayesian-optimization-via-thompson","slug":"federated-bayesian-optimization-via-thompson","title":"Federated Bayesian Optimization via Thompson Sampling","date":"2020-10-20","arxiv_id":"2010.10154","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-gaussian-process-variational-1","slug":"sparse-gaussian-process-variational-1","title":"Sparse Gaussian Process Variational Autoencoders","date":"2020-10-20","arxiv_id":"2010.10177","repositories_listed":1,"syntology":null},{"url":"/paper/decomposing-complicated-signals-with-time","slug":"decomposing-complicated-signals-with-time","title":"Decomposing non-stationary signals with time-varying wave-shape functions","date":"2020-10-14","arxiv_id":"2010.07394","repositories_listed":1,"syntology":null},{"url":"/paper/rapid-robust-principal-component-analysis-cur","slug":"rapid-robust-principal-component-analysis-cur","title":"Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation","date":"2020-10-14","arxiv_id":"2010.07422","repositories_listed":1,"syntology":null},{"url":"/paper/correlation-filter-for-uav-based-aerial","slug":"correlation-filter-for-uav-based-aerial","title":"Correlation Filters for Unmanned Aerial Vehicle-Based Aerial Tracking: A Review and Experimental Evaluation","date":"2020-10-13","arxiv_id":"2010.06255","repositories_listed":1,"syntology":null},{"url":"/paper/glance-and-focus-a-dynamic-approach-to","slug":"glance-and-focus-a-dynamic-approach-to","title":"Glance and Focus: a Dynamic Approach to Reducing Spatial Redundancy in Image Classification","date":"2020-10-11","arxiv_id":"2010.05300","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/glance-and-focus-a-dynamic-approach-to#ran","syntology_url":"https://syntology.ai/paper/2010.05300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05300"}},"official":{"repos":["blackfeather-wang/GFNet-Pytorch"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dct-snn-using-dct-to-distribute-spatial-1","slug":"dct-snn-using-dct-to-distribute-spatial-1","title":"DCT-SNN: Using DCT to Distribute Spatial Information over Time for Learning Low-Latency Spiking Neural Networks","date":"2020-10-05","arxiv_id":"2010.01795","repositories_listed":1,"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/dct-snn-using-dct-to-distribute-spatial-1#ran","syntology_url":"https://syntology.ai/paper/2010.01795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01795"}},"official":{"repos":["SayeedChowdhury/dct-snn"],"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/self-grouping-convolutional-neural-networks","slug":"self-grouping-convolutional-neural-networks","title":"Self-grouping Convolutional Neural Networks","date":"2020-09-29","arxiv_id":"2009.13803","repositories_listed":1,"syntology":null},{"url":"/paper/multiscale-context-aware-ensemble-deep-kelm","slug":"multiscale-context-aware-ensemble-deep-kelm","title":"Multiscale Context-Aware Ensemble Deep KELM for Efficient Hyperspectral Image Classification","date":"2020-09-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/energy-based-reranking-improving-neural","slug":"energy-based-reranking-improving-neural","title":"Energy-Based Reranking: Improving Neural Machine Translation Using Energy-Based Models","date":"2020-09-20","arxiv_id":"2009.13267","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/energy-based-reranking-improving-neural#ran","syntology_url":"https://syntology.ai/paper/2009.13267","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13267"}},"official":{"repos":["rooshenas/ebr_mt"],"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/overlapping-community-detection-in-networks-1","slug":"overlapping-community-detection-in-networks-1","title":"Overlapping community detection in networks via sparse spectral decomposition","date":"2020-09-20","arxiv_id":"2009.10641","repositories_listed":1,"syntology":null},{"url":"/paper/multi-2oie-multilingual-open-information","slug":"multi-2oie-multilingual-open-information","title":"Multi$^2$OIE: Multilingual Open Information Extraction Based on Multi-Head Attention with BERT","date":"2020-09-17","arxiv_id":"2009.08128","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":2,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multi-2oie-multilingual-open-information#ran","syntology_url":"https://syntology.ai/paper/2009.08128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08128"}},"official":{"repos":["youngbin-ro/Multi2OIE"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mats-an-interpretable-trajectory-forecasting","slug":"mats-an-interpretable-trajectory-forecasting","title":"MATS: An Interpretable Trajectory Forecasting Representation for Planning and Control","date":"2020-09-16","arxiv_id":"2009.07517","repositories_listed":1,"syntology":null},{"url":"/paper/etc-nlg-end-to-end-topic-conditioned-natural","slug":"etc-nlg-end-to-end-topic-conditioned-natural","title":"ETC-NLG: End-to-end Topic-Conditioned Natural Language Generation","date":"2020-08-25","arxiv_id":"2008.10875","repositories_listed":1,"syntology":null},{"url":"/paper/dense-an-enhanced-non-abelian-group","slug":"dense-an-enhanced-non-abelian-group","title":"DensE: An Enhanced Non-commutative Representation for Knowledge Graph Embedding with Adaptive Semantic Hierarchy","date":"2020-08-11","arxiv_id":"2008.04548","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-large-scale-machine-learning","slug":"a-survey-on-large-scale-machine-learning","title":"A Survey on Large-scale Machine Learning","date":"2020-08-10","arxiv_id":"2008.03911","repositories_listed":1,"syntology":null},{"url":"/paper/pseudoinverse-graph-convolutional-networks","slug":"pseudoinverse-graph-convolutional-networks","title":"Pseudoinverse Graph Convolutional Networks: Fast Filters Tailored for Large Eigengaps of Dense Graphs and Hypergraphs","date":"2020-08-03","arxiv_id":"2008.00720","repositories_listed":1,"syntology":null},{"url":"/paper/corner-proposal-network-for-anchor-free-two","slug":"corner-proposal-network-for-anchor-free-two","title":"Corner Proposal Network for Anchor-free, Two-stage Object Detection","date":"2020-07-27","arxiv_id":"2007.13816","repositories_listed":1,"syntology":null},{"url":"/paper/oblique-predictive-clustering-trees","slug":"oblique-predictive-clustering-trees","title":"Oblique Predictive Clustering Trees","date":"2020-07-27","arxiv_id":"2007.13617","repositories_listed":1,"syntology":null},{"url":"/paper/backpropagated-gradient-representations-for","slug":"backpropagated-gradient-representations-for","title":"Backpropagated Gradient Representations for Anomaly Detection","date":"2020-07-18","arxiv_id":"2007.09507","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-scalable-radio","slug":"graph-neural-networks-for-scalable-radio","title":"Graph Neural Networks for Scalable Radio Resource Management: Architecture Design and Theoretical Analysis","date":"2020-07-15","arxiv_id":"2007.07632","repositories_listed":1,"syntology":null},{"url":"/paper/state-space-expectation-propagation-efficient","slug":"state-space-expectation-propagation-efficient","title":"State Space Expectation Propagation: Efficient Inference Schemes for Temporal Gaussian Processes","date":"2020-07-12","arxiv_id":"2007.05994","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/state-space-expectation-propagation-efficient#ran","syntology_url":"https://syntology.ai/paper/2007.05994","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05994"}},"official":{"repos":["AaltoML/kalman-jax"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-group-convolution-for-accelerating","slug":"dynamic-group-convolution-for-accelerating","title":"Dynamic Group Convolution for Accelerating Convolutional Neural Networks","date":"2020-07-08","arxiv_id":"2007.04242","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dynamic-group-convolution-for-accelerating#ran","syntology_url":"https://syntology.ai/paper/2007.04242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04242"}},"official":{"repos":["zhuogege1943/dgc"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/high-dimensional-bayesian-optimization","slug":"high-dimensional-bayesian-optimization","title":"High Dimensional Bayesian Optimization Assisted by Principal Component Analysis","date":"2020-07-02","arxiv_id":"2007.00925","repositories_listed":1,"syntology":null},{"url":"/paper/similarity-search-for-efficient-active","slug":"similarity-search-for-efficient-active","title":"Similarity Search for Efficient Active Learning and Search of Rare Concepts","date":"2020-06-30","arxiv_id":"2007.00077","repositories_listed":1,"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/similarity-search-for-efficient-active#ran","syntology_url":"https://syntology.ai/paper/2007.00077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00077"}},"official":null}},{"url":"/paper/understanding-diversity-based-pruning-of","slug":"understanding-diversity-based-pruning-of","title":"Statistical Mechanical Analysis of Neural Network Pruning","date":"2020-06-30","arxiv_id":"2006.16617","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-iteration-complexity-of-hypergradient","slug":"on-the-iteration-complexity-of-hypergradient","title":"On the Iteration Complexity of Hypergradient Computation","date":"2020-06-29","arxiv_id":"2006.16218","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-iteration-complexity-of-hypergradient#ran","syntology_url":"https://syntology.ai/paper/2006.16218","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16218"}},"official":{"repos":["prolearner/hypertorch"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/freetree-a-tree-based-approach-for-high","slug":"freetree-a-tree-based-approach-for-high","title":"FREEtree: A Tree-based Approach for High Dimensional Longitudinal Data With Correlated Features","date":"2020-06-17","arxiv_id":"2006.09693","repositories_listed":1,"syntology":null},{"url":"/paper/wasserstein-embedding-for-graph-learning","slug":"wasserstein-embedding-for-graph-learning","title":"Wasserstein Embedding for Graph Learning","date":"2020-06-16","arxiv_id":"2006.09430","repositories_listed":1,"syntology":null},{"url":"/paper/augmented-sliced-wasserstein-distances","slug":"augmented-sliced-wasserstein-distances","title":"Augmented Sliced Wasserstein Distances","date":"2020-06-15","arxiv_id":"2006.08812","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/augmented-sliced-wasserstein-distances#ran","syntology_url":"https://syntology.ai/paper/2006.08812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08812"}},"official":{"repos":["xiongjiechen/ASWD"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/algebranets","slug":"algebranets","title":"AlgebraNets","date":"2020-06-12","arxiv_id":"2006.07360","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-quality-and-generalizability-in","slug":"exploring-quality-and-generalizability-in","title":"Exploring Quality and Generalizability in Parameterized Neural Audio Effects","date":"2020-06-10","arxiv_id":"2006.05584","repositories_listed":1,"syntology":null},{"url":"/paper/neural-network-activation-quantization-with","slug":"neural-network-activation-quantization-with","title":"Neural Network Activation Quantization with Bitwise Information Bottlenecks","date":"2020-06-09","arxiv_id":"2006.05210","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-aware-cnns-for-depth-completion-1","slug":"uncertainty-aware-cnns-for-depth-completion-1","title":"Uncertainty-Aware CNNs for Depth Completion: Uncertainty from Beginning to End","date":"2020-06-05","arxiv_id":"2006.03349","repositories_listed":1,"syntology":null},{"url":"/paper/overcoming-multi-model-forgetting-in-one-shot","slug":"overcoming-multi-model-forgetting-in-one-shot","title":"Overcoming Multi-Model Forgetting in One-Shot NAS With Diversity Maximization","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/beyond-the-mean-field-structured-deep","slug":"beyond-the-mean-field-structured-deep","title":"Beyond the Mean-Field: Structured Deep Gaussian Processes Improve the Predictive Uncertainties","date":"2020-05-22","arxiv_id":"2005.11110","repositories_listed":1,"syntology":null},{"url":"/paper/improved-protein-ligand-binding-affinity","slug":"improved-protein-ligand-binding-affinity","title":"Improved Protein-ligand Binding Affinity Prediction with Structure-Based Deep Fusion Inference","date":"2020-05-17","arxiv_id":"2005.07704","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improved-protein-ligand-binding-affinity#ran","syntology_url":"https://syntology.ai/paper/2005.07704","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07704"}},"official":{"repos":["LLNL/FAST"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/walking-with-perception-efficient-random-walk","slug":"walking-with-perception-efficient-random-walk","title":"Walking with Perception: Efficient Random Walk Sampling via Common Neighbor Awareness","date":"2020-05-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/the-scalable-birth-death-mcmc-algorithm-for","slug":"the-scalable-birth-death-mcmc-algorithm-for","title":"The scalable Birth-Death MCMC Algorithm for Mixed Graphical Model Learning with Application to Genomic Data Integration","date":"2020-05-08","arxiv_id":"2005.04139","repositories_listed":1,"syntology":null},{"url":"/paper/development-of-a-skateboarding-trick","slug":"development-of-a-skateboarding-trick","title":"Development of a skateboarding trick classifier using accelerometry and machine learning","date":"2020-05-06","arxiv_id":"2005.04186","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-and-information-preserving-future","slug":"efficient-and-information-preserving-future","title":"Efficient and Information-Preserving Future Frame Prediction and Beyond","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"98bf9a15772a1e7cf099494142e3e63c1abeff13a29aaac7c9e2dc473ac4d33d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}