{"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/efficient-neural-network/papers/ran/1","list_of":"/task/efficient-neural-network","task":"Efficient Neural Network","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":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,16],"of":16,"counts":{"archive_papers_tagged":224,"with_a_code_link":89,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":224,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":15,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":15,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/efficient-neural-network/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/automatic-joint-structured-pruning-and","slug":"automatic-joint-structured-pruning-and","title":"Automatic Joint Structured Pruning and Quantization for Efficient Neural Network Training and Compression","date":"2025-02-23","arxiv_id":"2502.16638","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":1,"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 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) · 4 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/automatic-joint-structured-pruning-and#ran","syntology_url":"https://syntology.ai/paper/2502.16638","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.16638"}},"official":{"repos":["microsoft/geta"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/gated-attention-coding-for-training-high","slug":"gated-attention-coding-for-training-high","title":"Gated Attention Coding for Training High-performance and Efficient Spiking Neural Networks","date":"2023-08-12","arxiv_id":"2308.06582","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":12,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/gated-attention-coding-for-training-high#ran","syntology_url":"https://syntology.ai/paper/2308.06582","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.06582"}},"official":{"repos":["bollossom/GAC"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/prompting-in-context-operator-learning-with","slug":"prompting-in-context-operator-learning-with","title":"Fine-Tune Language Models as Multi-Modal Differential Equation Solvers","date":"2023-08-09","arxiv_id":"2308.05061","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/prompting-in-context-operator-learning-with#ran","syntology_url":"https://syntology.ai/paper/2308.05061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.05061"}},"official":{"repos":["liuyangmage/in-context-operator-networks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-three-regime-model-of-network-pruning","slug":"a-three-regime-model-of-network-pruning","title":"A Three-regime Model of Network Pruning","date":"2023-05-28","arxiv_id":"2305.18383","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-three-regime-model-of-network-pruning#ran","syntology_url":"https://syntology.ai/paper/2305.18383","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18383"}},"official":{"repos":["yefanzhou/threeregimepruning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-improved-one-millisecond-mobile-backbone","slug":"an-improved-one-millisecond-mobile-backbone","title":"MobileOne: An Improved One millisecond Mobile Backbone","date":"2022-06-08","arxiv_id":"2206.04040","repositories_listed":10,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"4 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-improved-one-millisecond-mobile-backbone#ran","syntology_url":"https://syntology.ai/paper/2206.04040","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04040"}},"official":{"repos":["apple/ml-mobileone","rwightman/pytorch-image-models"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/trainable-weight-averaging-for-fast","slug":"trainable-weight-averaging-for-fast","title":"Trainable Weight Averaging: A General Approach for Subspace Training","date":"2022-05-26","arxiv_id":"2205.13104","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":5,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 5 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/trainable-weight-averaging-for-fast#ran","syntology_url":"https://syntology.ai/paper/2205.13104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13104"}},"official":{"repos":["nblt/twa"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-and-accurate-conversion-of-spiking","slug":"efficient-and-accurate-conversion-of-spiking","title":"Efficient and Accurate Conversion of Spiking Neural Network with Burst Spikes","date":"2022-04-28","arxiv_id":"2204.13271","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/efficient-and-accurate-conversion-of-spiking#ran","syntology_url":"https://syntology.ai/paper/2204.13271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13271"}},"official":{"repos":["brain-inspired-cognitive-engine/conversion_burst"],"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/scaling-the-convex-barrier-with-active-sets-1","slug":"scaling-the-convex-barrier-with-active-sets-1","title":"Scaling the Convex Barrier with Sparse Dual Algorithms","date":"2021-01-14","arxiv_id":"2101.05844","repositories_listed":0,"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":0,"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/scaling-the-convex-barrier-with-active-sets-1#ran","syntology_url":"https://syntology.ai/paper/2101.05844","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.05844"}},"official":null}},{"url":"/paper/sudo-rm-rf-efficient-networks-for-universal","slug":"sudo-rm-rf-efficient-networks-for-universal","title":"Sudo rm -rf: Efficient Networks for Universal Audio Source Separation","date":"2020-07-14","arxiv_id":"2007.06833","repositories_listed":4,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sudo-rm-rf-efficient-networks-for-universal#ran","syntology_url":"https://syntology.ai/paper/2007.06833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06833"}},"official":{"repos":["etzinis/sudo_rm_rf"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/eagleeye-fast-sub-net-evaluation-for","slug":"eagleeye-fast-sub-net-evaluation-for","title":"EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruning","date":"2020-07-06","arxiv_id":"2007.02491","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/eagleeye-fast-sub-net-evaluation-for#ran","syntology_url":"https://syntology.ai/paper/2007.02491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02491"}},"official":{"repos":["anonymous47823493/EagleEye"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lutnet-learning-fpga-configurations-for","slug":"lutnet-learning-fpga-configurations-for","title":"LUTNet: Learning FPGA Configurations for Highly Efficient Neural Network Inference","date":"2019-10-24","arxiv_id":"1910.12625","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/lutnet-learning-fpga-configurations-for#ran","syntology_url":"https://syntology.ai/paper/1910.12625","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.12625"}},"official":{"repos":["awai54st/LUTNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/deephoyer-learning-sparser-neural-network","slug":"deephoyer-learning-sparser-neural-network","title":"DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measures","date":"2019-08-27","arxiv_id":"1908.09979","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/deephoyer-learning-sparser-neural-network#ran","syntology_url":"https://syntology.ai/paper/1908.09979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09979"}},"official":{"repos":["yanghr/DeepHoyer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/nextvlad-an-efficient-neural-network-to","slug":"nextvlad-an-efficient-neural-network-to","title":"NeXtVLAD: An Efficient Neural Network to Aggregate Frame-level Features for Large-scale Video Classification","date":"2018-11-12","arxiv_id":"1811.05014","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/nextvlad-an-efficient-neural-network-to#ran","syntology_url":"https://syntology.ai/paper/1811.05014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.05014"}},"official":null}},{"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/network-trimming-a-data-driven-neuron-pruning","slug":"network-trimming-a-data-driven-neuron-pruning","title":"Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architectures","date":"2016-07-12","arxiv_id":"1607.03250","repositories_listed":7,"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/network-trimming-a-data-driven-neuron-pruning#ran","syntology_url":"https://syntology.ai/paper/1607.03250","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.03250"}},"official":null}},{"url":"/paper/enet-a-deep-neural-network-architecture-for","slug":"enet-a-deep-neural-network-architecture-for","title":"ENet: A Deep Neural Network Architecture for Real-Time Semantic Segmentation","date":"2016-06-07","arxiv_id":"1606.02147","repositories_listed":49,"syntology":{"n":30,"n_ran":26,"n_constructed":0,"n_ran_checked":22,"n_instrument":4,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":22,"n_pointer_only":2,"phrase":"26 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; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/enet-a-deep-neural-network-architecture-for#ran","syntology_url":"https://syntology.ai/paper/1606.02147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.02147"}},"official":null}}],"record_sha256":"fc73306d59b0333dd6848fd679a7b55e8742b063da12a555631d95a2e3de39e0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}