{"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/ran/4","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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":4,"pages_in_order":4,"rows_per_page":100,"rows":[301,369],"of":369,"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/papers/ran/1","prev":"/task/computational-efficiency/papers/ran/3","next":null,"papers":[{"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/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/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/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/checkerboard-context-model-for-efficient","slug":"checkerboard-context-model-for-efficient","title":"Checkerboard Context Model for Efficient Learned Image Compression","date":"2021-03-29","arxiv_id":"2103.15306","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/checkerboard-context-model-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2103.15306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.15306"}},"official":null}},{"url":"/paper/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/movinets-mobile-video-networks-for-efficient","slug":"movinets-mobile-video-networks-for-efficient","title":"MoViNets: Mobile Video Networks for Efficient Video Recognition","date":"2021-03-21","arxiv_id":"2103.11511","repositories_listed":3,"syntology":{"n":13,"n_ran":9,"n_constructed":6,"n_ran_checked":8,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"9 ran (of which 6 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/movinets-mobile-video-networks-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2103.11511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.11511"}},"official":{"repos":["tensorflow/models"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/patch-netvlad-multi-scale-fusion-of-locally","slug":"patch-netvlad-multi-scale-fusion-of-locally","title":"Patch-NetVLAD: Multi-Scale Fusion of Locally-Global Descriptors for Place Recognition","date":"2021-03-02","arxiv_id":"2103.01486","repositories_listed":4,"syntology":{"n":5,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/patch-netvlad-multi-scale-fusion-of-locally#ran","syntology_url":"https://syntology.ai/paper/2103.01486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.01486"}},"official":{"repos":["QVPR/Patch-NetVLAD"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/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/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/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/a-transformer-based-framework-for-1","slug":"a-transformer-based-framework-for-1","title":"A Transformer-based Framework for Multivariate Time Series Representation Learning","date":"2020-10-06","arxiv_id":"2010.02803","repositories_listed":6,"syntology":{"n":32,"n_ran":23,"n_constructed":0,"n_ran_checked":22,"n_instrument":1,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":22,"n_pointer_only":6,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 0 honoured, 0 violated, 22 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/a-transformer-based-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/2010.02803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02803"}},"official":{"repos":["gzerveas/mvts_transformer"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":4,"ran_from_kinds":["listed","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/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/pp-ocr-a-practical-ultra-lightweight-ocr","slug":"pp-ocr-a-practical-ultra-lightweight-ocr","title":"PP-OCR: A Practical Ultra Lightweight OCR System","date":"2020-09-21","arxiv_id":"2009.09941","repositories_listed":10,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/pp-ocr-a-practical-ultra-lightweight-ocr#ran","syntology_url":"https://syntology.ai/paper/2009.09941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.09941"}},"official":{"repos":["PaddlePaddle/PaddleOCR"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/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/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/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/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/babyai-1-1","slug":"babyai-1-1","title":"BabyAI 1.1","date":"2020-07-24","arxiv_id":"2007.12770","repositories_listed":3,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/babyai-1-1#ran","syntology_url":"https://syntology.ai/paper/2007.12770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.12770"}},"official":{"repos":["mila-iqia/babyai"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/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/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/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/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/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/semantic-segmentation-of-underwater-imagery","slug":"semantic-segmentation-of-underwater-imagery","title":"Semantic Segmentation of Underwater Imagery: Dataset and Benchmark","date":"2020-04-02","arxiv_id":"2004.01241","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/semantic-segmentation-of-underwater-imagery#ran","syntology_url":"https://syntology.ai/paper/2004.01241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01241"}},"official":null}},{"url":"/paper/muxconv-information-multiplexing-in","slug":"muxconv-information-multiplexing-in","title":"MUXConv: Information Multiplexing in Convolutional Neural Networks","date":"2020-03-31","arxiv_id":"2003.13880","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/muxconv-information-multiplexing-in#ran","syntology_url":"https://syntology.ai/paper/2003.13880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13880"}},"official":{"repos":["human-analysis/MUXConv"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/coping-with-simulators-that-don-t-always","slug":"coping-with-simulators-that-don-t-always","title":"Coping With Simulators That Don't Always Return","date":"2020-03-28","arxiv_id":"2003.12908","repositories_listed":1,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/coping-with-simulators-that-don-t-always#ran","syntology_url":"https://syntology.ai/paper/2003.12908","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12908"}},"official":{"repos":["plai-group/stdr"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/spike-flownet-event-based-optical-flow","slug":"spike-flownet-event-based-optical-flow","title":"Spike-FlowNet: Event-based Optical Flow Estimation with Energy-Efficient Hybrid Neural Networks","date":"2020-03-14","arxiv_id":"2003.06696","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/spike-flownet-event-based-optical-flow#ran","syntology_url":"https://syntology.ai/paper/2003.06696","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.06696"}},"official":{"repos":["chan8972/Spike-FlowNet"],"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/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/transformer-hawkes-process","slug":"transformer-hawkes-process","title":"Transformer Hawkes Process","date":"2020-02-21","arxiv_id":"2002.09291","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transformer-hawkes-process#ran","syntology_url":"https://syntology.ai/paper/2002.09291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09291"}},"official":{"repos":["SimiaoZuo/Transformer-Hawkes-Process"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/scale-equivariant-steerable-networks-1","slug":"scale-equivariant-steerable-networks-1","title":"Scale-Equivariant Steerable Networks","date":"2019-10-14","arxiv_id":"1910.11093","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/scale-equivariant-steerable-networks-1#ran","syntology_url":"https://syntology.ai/paper/1910.11093","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11093"}},"official":null}},{"url":"/paper/exploiting-structural-and-semantic-context","slug":"exploiting-structural-and-semantic-context","title":"Commonsense Knowledge Base Completion with Structural and Semantic Context","date":"2019-10-07","arxiv_id":"1910.02915","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/exploiting-structural-and-semantic-context#ran","syntology_url":"https://syntology.ai/paper/1910.02915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02915"}},"official":null}},{"url":"/paper/neural-multisensory-scene-inference","slug":"neural-multisensory-scene-inference","title":"Neural Multisensory Scene Inference","date":"2019-10-06","arxiv_id":"1910.02344","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":0,"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/neural-multisensory-scene-inference#ran","syntology_url":"https://syntology.ai/paper/1910.02344","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02344"}},"official":{"repos":["lim0606/pytorch-generative-multisensory-network"],"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/kimera-an-open-source-library-for-real-time","slug":"kimera-an-open-source-library-for-real-time","title":"Kimera: an Open-Source Library for Real-Time Metric-Semantic Localization and Mapping","date":"2019-10-06","arxiv_id":"1910.02490","repositories_listed":12,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/kimera-an-open-source-library-for-real-time#ran","syntology_url":"https://syntology.ai/paper/1910.02490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02490"}},"official":{"repos":["MIT-SPARK/Kimera"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/compression-with-flows-via-local-bits-back","slug":"compression-with-flows-via-local-bits-back","title":"Compression with Flows via Local Bits-Back Coding","date":"2019-05-21","arxiv_id":"1905.08500","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/compression-with-flows-via-local-bits-back#ran","syntology_url":"https://syntology.ai/paper/1905.08500","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.08500"}},"official":{"repos":["hojonathanho/localbitsback"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/190409408","slug":"190409408","title":"Language Models with Transformers","date":"2019-04-20","arxiv_id":"1904.09408","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":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190409408#ran","syntology_url":"https://syntology.ai/paper/1904.09408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09408"}},"official":{"repos":["cgraywang/gluon-nlp-1"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semantics-guided-neural-networks-for","slug":"semantics-guided-neural-networks-for","title":"Semantics-Guided Neural Networks for Efficient Skeleton-Based Human Action Recognition","date":"2019-04-02","arxiv_id":"1904.01189","repositories_listed":2,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"11 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/semantics-guided-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/1904.01189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01189"}},"official":{"repos":["microsoft/SGN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/how-can-we-be-so-dense-the-benefits-of-using","slug":"how-can-we-be-so-dense-the-benefits-of-using","title":"How Can We Be So Dense? The Benefits of Using Highly Sparse Representations","date":"2019-03-27","arxiv_id":"1903.11257","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-can-we-be-so-dense-the-benefits-of-using#ran","syntology_url":"https://syntology.ai/paper/1903.11257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.11257"}},"official":{"repos":["numenta/htmpapers"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/pointnetlk-robust-efficient-point-cloud","slug":"pointnetlk-robust-efficient-point-cloud","title":"PointNetLK: Robust & Efficient Point Cloud Registration using PointNet","date":"2019-03-13","arxiv_id":"1903.05711","repositories_listed":7,"syntology":{"n":24,"n_ran":20,"n_constructed":0,"n_ran_checked":18,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":18,"n_pointer_only":22,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 0 violated, 18 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/pointnetlk-robust-efficient-point-cloud#ran","syntology_url":"https://syntology.ai/paper/1903.05711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.05711"}},"official":{"repos":["hmgoforth/PointNetLK"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/safety-verification-and-robustness-analysis","slug":"safety-verification-and-robustness-analysis","title":"Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programming","date":"2019-03-04","arxiv_id":"1903.01287","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/safety-verification-and-robustness-analysis#ran","syntology_url":"https://syntology.ai/paper/1903.01287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.01287"}},"official":{"repos":["mahyarfazlyab/DeepSDP"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/macow-masked-convolutional-generative-flow","slug":"macow-masked-convolutional-generative-flow","title":"MaCow: Masked Convolutional Generative Flow","date":"2019-02-12","arxiv_id":"1902.04208","repositories_listed":2,"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/macow-masked-convolutional-generative-flow#ran","syntology_url":"https://syntology.ai/paper/1902.04208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.04208"}},"official":{"repos":["XuezheMax/macow"],"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/flow-improving-flow-based-generative-models","slug":"flow-improving-flow-based-generative-models","title":"Flow++: Improving Flow-Based Generative Models with Variational Dequantization and Architecture Design","date":"2019-02-01","arxiv_id":"1902.00275","repositories_listed":4,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/flow-improving-flow-based-generative-models#ran","syntology_url":"https://syntology.ai/paper/1902.00275","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00275"}},"official":{"repos":["aravind0706/flowpp","aravindsrinivas/flowpp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/iclabel-an-automated-electroencephalographic","slug":"iclabel-an-automated-electroencephalographic","title":"ICLabel: An automated electroencephalographic independent component classifier, dataset, and website","date":"2019-01-22","arxiv_id":"1901.07915","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/iclabel-an-automated-electroencephalographic#ran","syntology_url":"https://syntology.ai/paper/1901.07915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07915"}},"official":{"repos":["lucapton/ICLabel-Train"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/ccnet-criss-cross-attention-for-semantic","slug":"ccnet-criss-cross-attention-for-semantic","title":"CCNet: Criss-Cross Attention for Semantic Segmentation","date":"2018-11-28","arxiv_id":"1811.11721","repositories_listed":4,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":7,"n_instrument":6,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":4,"n_pointer_only":3,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 1 violated, 4 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/ccnet-criss-cross-attention-for-semantic#ran","syntology_url":"https://syntology.ai/paper/1811.11721","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.11721"}},"official":{"repos":["speedinghzl/CCNet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/efficient-neural-network-robustness","slug":"efficient-neural-network-robustness","title":"Efficient Neural Network Robustness Certification with General Activation Functions","date":"2018-11-02","arxiv_id":"1811.00866","repositories_listed":16,"syntology":{"n":43,"n_ran":33,"n_constructed":0,"n_ran_checked":31,"n_instrument":2,"n_unverified":10,"n_honours":2,"n_violates":0,"n_no_contract":29,"n_pointer_only":3,"phrase":"33 ran (of which 0 constructed an object rather than computing a result; 31 with no instrument failure: 2 honoured, 0 violated, 29 with no contract checked; 2 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/efficient-neural-network-robustness#ran","syntology_url":"https://syntology.ai/paper/1811.00866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.00866"}},"official":{"repos":["huanzhang12/CROWN-Robustness-Certification"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/memc-net-motion-estimation-and-motion","slug":"memc-net-motion-estimation-and-motion","title":"MEMC-Net: Motion Estimation and Motion Compensation Driven Neural Network for Video Interpolation and Enhancement","date":"2018-10-20","arxiv_id":"1810.08768","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/memc-net-motion-estimation-and-motion#ran","syntology_url":"https://syntology.ai/paper/1810.08768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.08768"}},"official":null}},{"url":"/paper/adaptive-skip-intervals-temporal-abstraction","slug":"adaptive-skip-intervals-temporal-abstraction","title":"Adaptive Skip Intervals: Temporal Abstraction for Recurrent Dynamical Models","date":"2018-08-14","arxiv_id":"1808.04768","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/adaptive-skip-intervals-temporal-abstraction#ran","syntology_url":"https://syntology.ai/paper/1808.04768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.04768"}},"official":{"repos":["neitzal/adaptive-skip-intervals"],"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/knowledge-distillation-by-on-the-fly-native","slug":"knowledge-distillation-by-on-the-fly-native","title":"Knowledge Distillation by On-the-Fly Native Ensemble","date":"2018-06-12","arxiv_id":"1806.04606","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/knowledge-distillation-by-on-the-fly-native#ran","syntology_url":"https://syntology.ai/paper/1806.04606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.04606"}},"official":null}},{"url":"/paper/attention-u-net-learning-where-to-look-for","slug":"attention-u-net-learning-where-to-look-for","title":"Attention U-Net: Learning Where to Look for the Pancreas","date":"2018-04-11","arxiv_id":"1804.03999","repositories_listed":37,"syntology":{"n":28,"n_ran":23,"n_constructed":0,"n_ran_checked":15,"n_instrument":8,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":7,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 8 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/attention-u-net-learning-where-to-look-for#ran","syntology_url":"https://syntology.ai/paper/1804.03999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.03999"}},"official":{"repos":["ozan-oktay/Attention-Gated-Networks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/simple-random-search-provides-a-competitive","slug":"simple-random-search-provides-a-competitive","title":"Simple random search provides a competitive approach to reinforcement learning","date":"2018-03-19","arxiv_id":"1803.07055","repositories_listed":26,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/simple-random-search-provides-a-competitive#ran","syntology_url":"https://syntology.ai/paper/1803.07055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.07055"}},"official":{"repos":["modestyachts/ARS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/spherical-cnns","slug":"spherical-cnns","title":"Spherical CNNs","date":"2018-01-30","arxiv_id":"1801.10130","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/spherical-cnns#ran","syntology_url":"https://syntology.ai/paper/1801.10130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.10130"}},"official":{"repos":["jonas-koehler/s2cnn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/bayesian-compression-for-deep-learning","slug":"bayesian-compression-for-deep-learning","title":"Bayesian Compression for Deep Learning","date":"2017-05-24","arxiv_id":"1705.08665","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bayesian-compression-for-deep-learning#ran","syntology_url":"https://syntology.ai/paper/1705.08665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.08665"}},"official":{"repos":["KarenUllrich/Tutorial_BayesianCompressionForDL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/continual-learning-through-synaptic","slug":"continual-learning-through-synaptic","title":"Continual Learning Through Synaptic Intelligence","date":"2017-03-13","arxiv_id":"1703.04200","repositories_listed":6,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/continual-learning-through-synaptic#ran","syntology_url":"https://syntology.ai/paper/1703.04200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04200"}},"official":{"repos":["ganguli-lab/pathint"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/arbitrary-oriented-scene-text-detection-via","slug":"arbitrary-oriented-scene-text-detection-via","title":"Arbitrary-Oriented Scene Text Detection via Rotation Proposals","date":"2017-03-03","arxiv_id":"1703.01086","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/arbitrary-oriented-scene-text-detection-via#ran","syntology_url":"https://syntology.ai/paper/1703.01086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.01086"}},"official":{"repos":["mjq11302010044/RRPN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/fast-and-accurate-entity-recognition-with","slug":"fast-and-accurate-entity-recognition-with","title":"Fast and Accurate Entity Recognition with Iterated Dilated Convolutions","date":"2017-02-07","arxiv_id":"1702.02098","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":3,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 3 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-and-accurate-entity-recognition-with#ran","syntology_url":"https://syntology.ai/paper/1702.02098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.02098"}},"official":{"repos":["iesl/dilated-cnn-ner"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/outrageously-large-neural-networks-the","slug":"outrageously-large-neural-networks-the","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","date":"2017-01-23","arxiv_id":"1701.06538","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/outrageously-large-neural-networks-the#ran","syntology_url":"https://syntology.ai/paper/1701.06538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.06538"}},"official":null}},{"url":"/paper/spatially-adaptive-computation-time-for","slug":"spatially-adaptive-computation-time-for","title":"Spatially Adaptive Computation Time for Residual Networks","date":"2016-12-07","arxiv_id":"1612.02297","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/spatially-adaptive-computation-time-for#ran","syntology_url":"https://syntology.ai/paper/1612.02297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.02297"}},"official":{"repos":["mfigurnov/sact"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-variational-auto-encoders-using-1","slug":"improving-variational-auto-encoders-using-1","title":"Improving Variational Auto-Encoders using Householder Flow","date":"2016-11-29","arxiv_id":"1611.09630","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/improving-variational-auto-encoders-using-1#ran","syntology_url":"https://syntology.ai/paper/1611.09630","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.09630"}},"official":null}},{"url":"/paper/large-scale-kernel-methods-for-independence","slug":"large-scale-kernel-methods-for-independence","title":"Large-Scale Kernel Methods for Independence Testing","date":"2016-06-25","arxiv_id":"1606.07892","repositories_listed":1,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/large-scale-kernel-methods-for-independence#ran","syntology_url":"https://syntology.ai/paper/1606.07892","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.07892"}},"official":null}},{"url":"/paper/the-deterministic-information-bottleneck","slug":"the-deterministic-information-bottleneck","title":"The deterministic information bottleneck","date":"2016-04-01","arxiv_id":"1604.00268","repositories_listed":2,"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":3,"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/the-deterministic-information-bottleneck#ran","syntology_url":"https://syntology.ai/paper/1604.00268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.00268"}},"official":null}},{"url":"/paper/rethinking-the-inception-architecture-for","slug":"rethinking-the-inception-architecture-for","title":"Rethinking the Inception Architecture for Computer Vision","date":"2015-12-02","arxiv_id":"1512.00567","repositories_listed":113,"syntology":{"n":26,"n_ran":20,"n_constructed":0,"n_ran_checked":19,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":18,"n_pointer_only":5,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 1 honoured, 0 violated, 18 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/rethinking-the-inception-architecture-for#ran","syntology_url":"https://syntology.ai/paper/1512.00567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1512.00567"}},"official":null}},{"url":"/paper/on-the-computational-efficiency-of-training","slug":"on-the-computational-efficiency-of-training","title":"On the Computational Efficiency of Training Neural Networks","date":"2014-10-05","arxiv_id":"1410.1141","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/on-the-computational-efficiency-of-training#ran","syntology_url":"https://syntology.ai/paper/1410.1141","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1410.1141"}},"official":null}},{"url":"/paper/a-comparative-study-of-efficient","slug":"a-comparative-study-of-efficient","title":"A Comparative Study of Efficient Initialization Methods for the K-Means Clustering Algorithm","date":"2012-09-10","arxiv_id":"1209.1960","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/a-comparative-study-of-efficient#ran","syntology_url":"https://syntology.ai/paper/1209.1960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1209.1960"}},"official":null}}],"record_sha256":"b3775c454e9a3169d25c42973d71fe7180a25963c56c5d836fb45b0d9e1a6bfd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}