{"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/binarization/papers/ran/1","list_of":"/task/binarization","task":"Binarization","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,39],"of":39,"counts":{"archive_papers_tagged":433,"with_a_code_link":184,"where_syntology_ran_a_sample":39,"not_listed_spam_title":0,"listed":433,"listed_where_code_ran":39,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":36,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":36,"listed_every_run_a_failure_of_syntologys_instrument":3,"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/binarization/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/bhvit-binarized-hybrid-vision-transformer","slug":"bhvit-binarized-hybrid-vision-transformer","title":"BHViT: Binarized Hybrid Vision Transformer","date":"2025-03-04","arxiv_id":"2503.02394","repositories_listed":1,"syntology":{"n":29,"n_ran":16,"n_constructed":13,"n_ran_checked":15,"n_instrument":1,"n_unverified":13,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"16 ran (of which 13 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 1 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/bhvit-binarized-hybrid-vision-transformer#ran","syntology_url":"https://syntology.ai/paper/2503.02394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.02394"}},"official":{"repos":["IMRL/BHViT"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":13,"n_ran_no_instrument_failure":15,"n_unverified":13,"ran_from_kinds":["official"]}}},{"url":"/paper/progressive-binarization-with-semi-structured","slug":"progressive-binarization-with-semi-structured","title":"Progressive Binarization with Semi-Structured Pruning for LLMs","date":"2025-02-03","arxiv_id":"2502.01705","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":0,"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/progressive-binarization-with-semi-structured#ran","syntology_url":"https://syntology.ai/paper/2502.01705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.01705"}},"official":{"repos":["xianglongyan/pbs2p"],"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/bidm-pushing-the-limit-of-quantization-for","slug":"bidm-pushing-the-limit-of-quantization-for","title":"BiDM: Pushing the Limit of Quantization for Diffusion Models","date":"2024-12-08","arxiv_id":"2412.05926","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":6,"n_instrument":8,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":16,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 8 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bidm-pushing-the-limit-of-quantization-for#ran","syntology_url":"https://syntology.ai/paper/2412.05926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.05926"}},"official":{"repos":["xingyu-zheng/bidm"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/arb-llm-alternating-refined-binarizations-for","slug":"arb-llm-alternating-refined-binarizations-for","title":"ARB-LLM: Alternating Refined Binarizations for Large Language Models","date":"2024-10-04","arxiv_id":"2410.03129","repositories_listed":1,"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/arb-llm-alternating-refined-binarizations-for#ran","syntology_url":"https://syntology.ai/paper/2410.03129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03129"}},"official":{"repos":["zhitengli/arb-llm"],"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":["official"]}}},{"url":"/paper/2408-03215","slug":"2408-03215","title":"FedBAT: Communication-Efficient Federated Learning via Learnable Binarization","date":"2024-08-06","arxiv_id":"2408.03215","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/2408-03215#ran","syntology_url":"https://syntology.ai/paper/2408.03215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.03215"}},"official":{"repos":["Leopold1423/fedbat-icml24"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mixture-of-scales-memory-efficient-token","slug":"mixture-of-scales-memory-efficient-token","title":"Mixture of Scales: Memory-Efficient Token-Adaptive Binarization for Large Language Models","date":"2024-06-18","arxiv_id":"2406.12311","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"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 2 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; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/mixture-of-scales-memory-efficient-token#ran","syntology_url":"https://syntology.ai/paper/2406.12311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12311"}},"official":null}},{"url":"/paper/binarized-diffusion-model-for-image-super","slug":"binarized-diffusion-model-for-image-super","title":"Binarized Diffusion Model for Image Super-Resolution","date":"2024-06-09","arxiv_id":"2406.05723","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 2 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/binarized-diffusion-model-for-image-super#ran","syntology_url":"https://syntology.ai/paper/2406.05723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05723"}},"official":{"repos":["zhengchen1999/bi-diffsr"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/binarydm-towards-accurate-binarization-of","slug":"binarydm-towards-accurate-binarization-of","title":"BinaryDM: Accurate Weight Binarization for Efficient Diffusion Models","date":"2024-04-08","arxiv_id":"2404.05662","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":1,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/binarydm-towards-accurate-binarization-of#ran","syntology_url":"https://syntology.ai/paper/2404.05662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.05662"}},"official":{"repos":["xingyu-zheng/binarydm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mini-splatting-representing-scenes-with-a","slug":"mini-splatting-representing-scenes-with-a","title":"Mini-Splatting: Representing Scenes with a Constrained Number of Gaussians","date":"2024-03-21","arxiv_id":"2403.14166","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":10,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/mini-splatting-representing-scenes-with-a#ran","syntology_url":"https://syntology.ai/paper/2403.14166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.14166"}},"official":{"repos":["fatpeter/mini-splatting"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/lum-vit-learnable-under-sampling-mask-vision","slug":"lum-vit-learnable-under-sampling-mask-vision","title":"LUM-ViT: Learnable Under-sampling Mask Vision Transformer for Bandwidth Limited Optical Signal Acquisition","date":"2024-03-03","arxiv_id":"2403.01412","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":7,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/lum-vit-learnable-under-sampling-mask-vision#ran","syntology_url":"https://syntology.ai/paper/2403.01412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01412"}},"official":{"repos":["maxllf/lum-vit"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/billm-pushing-the-limit-of-post-training","slug":"billm-pushing-the-limit-of-post-training","title":"BiLLM: Pushing the Limit of Post-Training Quantization for LLMs","date":"2024-02-06","arxiv_id":"2402.04291","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"8 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/billm-pushing-the-limit-of-post-training#ran","syntology_url":"https://syntology.ai/paper/2402.04291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04291"}},"official":{"repos":["aaronhuang-778/billm"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-foundation-for-exact-binarized","slug":"a-foundation-for-exact-binarized","title":"A foundation for exact binarized morphological neural networks","date":"2024-01-08","arxiv_id":"2401.03830","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/a-foundation-for-exact-binarized#ran","syntology_url":"https://syntology.ai/paper/2401.03830","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.03830"}},"official":{"repos":["TheodoreAouad/LBQNN2023"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pb-llm-partially-binarized-large-language","slug":"pb-llm-partially-binarized-large-language","title":"PB-LLM: Partially Binarized Large Language Models","date":"2023-09-29","arxiv_id":"2310.00034","repositories_listed":2,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"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) · 6 unverified","sample_list":"/paper/pb-llm-partially-binarized-large-language#ran","syntology_url":"https://syntology.ai/paper/2310.00034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00034"}},"official":{"repos":["hahnyuan/binaryllm","hahnyuan/pb-llm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/estimator-meets-equilibrium-perspective-a","slug":"estimator-meets-equilibrium-perspective-a","title":"Estimator Meets Equilibrium Perspective: A Rectified Straight Through Estimator for Binary Neural Networks Training","date":"2023-08-13","arxiv_id":"2308.06689","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":1,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/estimator-meets-equilibrium-perspective-a#ran","syntology_url":"https://syntology.ai/paper/2308.06689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.06689"}},"official":{"repos":["dravenalg/reste"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/binarized-spectral-compressive-imaging-1","slug":"binarized-spectral-compressive-imaging-1","title":"Binarized Spectral Compressive Imaging","date":"2023-05-17","arxiv_id":"2305.10299","repositories_listed":2,"syntology":{"n":32,"n_ran":21,"n_constructed":0,"n_ran_checked":20,"n_instrument":1,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":20,"n_pointer_only":3,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 0 honoured, 0 violated, 20 with no contract checked; 1 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/binarized-spectral-compressive-imaging-1#ran","syntology_url":"https://syntology.ai/paper/2305.10299","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10299"}},"official":{"repos":["caiyuanhao1998/MST","caiyuanhao1998/bisci"],"state":"official (archive's flag): 21 ran","n_ran":21,"n_constructed":0,"n_ran_no_instrument_failure":20,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/binarized-neural-machine-translation-1","slug":"binarized-neural-machine-translation-1","title":"Binarized Neural Machine Translation","date":"2023-02-09","arxiv_id":"2302.04907","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/binarized-neural-machine-translation-1#ran","syntology_url":"https://syntology.ai/paper/2302.04907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.04907"}},"official":{"repos":["google/aqt"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/ecoformer-energy-saving-attention-with-linear","slug":"ecoformer-energy-saving-attention-with-linear","title":"EcoFormer: Energy-Saving Attention with Linear Complexity","date":"2022-09-19","arxiv_id":"2209.09004","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/ecoformer-energy-saving-attention-with-linear#ran","syntology_url":"https://syntology.ai/paper/2209.09004","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.09004"}},"official":{"repos":["ziplab/ecoformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-accurate-binary-neural-networks-via","slug":"towards-accurate-binary-neural-networks-via","title":"Towards Accurate Binary Neural Networks via Modeling Contextual Dependencies","date":"2022-09-03","arxiv_id":"2209.01404","repositories_listed":1,"syntology":{"n":17,"n_ran":10,"n_constructed":2,"n_ran_checked":7,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":17,"phrase":"10 ran (of which 2 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/towards-accurate-binary-neural-networks-via#ran","syntology_url":"https://syntology.ai/paper/2209.01404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.01404"}},"official":{"repos":["sense-gvt/bcdnet"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":2,"n_ran_no_instrument_failure":7,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/divide-and-conquer-3d-point-cloud-instance","slug":"divide-and-conquer-3d-point-cloud-instance","title":"Divide and Conquer: 3D Point Cloud Instance Segmentation With Point-Wise Binarization","date":"2022-07-22","arxiv_id":"2207.11209","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/divide-and-conquer-3d-point-cloud-instance#ran","syntology_url":"https://syntology.ai/paper/2207.11209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.11209"}},"official":{"repos":["weiguangzhao/PBNet"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lipschitz-continuity-retained-binary-neural","slug":"lipschitz-continuity-retained-binary-neural","title":"Lipschitz Continuity Retained Binary Neural Network","date":"2022-07-13","arxiv_id":"2207.06540","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 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; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/lipschitz-continuity-retained-binary-neural#ran","syntology_url":"https://syntology.ai/paper/2207.06540","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06540"}},"official":{"repos":["42shawn/lcr_bnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/network-binarization-via-contrastive-learning","slug":"network-binarization-via-contrastive-learning","title":"Network Binarization via Contrastive Learning","date":"2022-07-06","arxiv_id":"2207.02970","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 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) · 0 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/network-binarization-via-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2207.02970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02970"}},"official":{"repos":["42Shawn/CMIM"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bit-robustly-binarized-multi-distilled","slug":"bit-robustly-binarized-multi-distilled","title":"BiT: Robustly Binarized Multi-distilled Transformer","date":"2022-05-25","arxiv_id":"2205.13016","repositories_listed":3,"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/bit-robustly-binarized-multi-distilled#ran","syntology_url":"https://syntology.ai/paper/2205.13016","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13016"}},"official":{"repos":["facebookresearch/bit"],"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/equal-bits-enforcing-equally-distributed","slug":"equal-bits-enforcing-equally-distributed","title":"Equal Bits: Enforcing Equally Distributed Binary Network Weights","date":"2021-12-02","arxiv_id":"2112.03406","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/equal-bits-enforcing-equally-distributed#ran","syntology_url":"https://syntology.ai/paper/2112.03406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.03406"}},"official":{"repos":["liyunqianggyn/equal-bits-bnn"],"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/a-comprehensive-review-of-binary-neural","slug":"a-comprehensive-review-of-binary-neural","title":"A comprehensive review of Binary Neural Network","date":"2021-10-11","arxiv_id":"2110.06804","repositories_listed":2,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":14,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-comprehensive-review-of-binary-neural#ran","syntology_url":"https://syntology.ai/paper/2110.06804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.06804"}},"official":{"repos":["hpi-xnor/BMXNet-v2"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/recu-reviving-the-dead-weights-in-binary","slug":"recu-reviving-the-dead-weights-in-binary","title":"ReCU: Reviving the Dead Weights in Binary Neural Networks","date":"2021-03-23","arxiv_id":"2103.12369","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/recu-reviving-the-dead-weights-in-binary#ran","syntology_url":"https://syntology.ai/paper/2103.12369","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12369"}},"official":{"repos":["z-hXu/ReCU"],"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/binarybert-pushing-the-limit-of-bert","slug":"binarybert-pushing-the-limit-of-bert","title":"BinaryBERT: Pushing the Limit of BERT Quantization","date":"2020-12-31","arxiv_id":"2012.15701","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"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) · 2 unverified","sample_list":"/paper/binarybert-pushing-the-limit-of-bert#ran","syntology_url":"https://syntology.ai/paper/2012.15701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.15701"}},"official":{"repos":["huawei-noah/Pretrained-Language-Model"],"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/bi-gcn-binary-graph-convolutional-network","slug":"bi-gcn-binary-graph-convolutional-network","title":"Bi-GCN: Binary Graph Convolutional Network","date":"2020-10-15","arxiv_id":"2010.07565","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bi-gcn-binary-graph-convolutional-network#ran","syntology_url":"https://syntology.ai/paper/2010.07565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07565"}},"official":{"repos":["bywmm/Bi-GCN"],"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/bipointnet-binary-neural-network-for-point-2","slug":"bipointnet-binary-neural-network-for-point-2","title":"BiPointNet: Binary Neural Network for Point Clouds","date":"2020-10-12","arxiv_id":"2010.05501","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/bipointnet-binary-neural-network-for-point-2#ran","syntology_url":"https://syntology.ai/paper/2010.05501","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05501"}},"official":{"repos":["htqin/BiPointNet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/high-capacity-expert-binary-networks-1","slug":"high-capacity-expert-binary-networks-1","title":"High-Capacity Expert Binary Networks","date":"2020-10-07","arxiv_id":"2010.03558","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/high-capacity-expert-binary-networks-1#ran","syntology_url":"https://syntology.ai/paper/2010.03558","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03558"}},"official":{"repos":["1adrianb/expert-binary-networks"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-network-compression-framework-for-fast","slug":"neural-network-compression-framework-for-fast","title":"Neural Network Compression Framework for fast model inference","date":"2020-02-20","arxiv_id":"2002.08679","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/neural-network-compression-framework-for-fast#ran","syntology_url":"https://syntology.ai/paper/2002.08679","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08679"}},"official":{"repos":["openvinotoolkit/nncf","openvinotoolkit/nncf_pytorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/real-time-scene-text-detection-with","slug":"real-time-scene-text-detection-with","title":"Real-time Scene Text Detection with Differentiable Binarization","date":"2019-11-20","arxiv_id":"1911.08947","repositories_listed":15,"syntology":{"n":25,"n_ran":20,"n_constructed":0,"n_ran_checked":17,"n_instrument":3,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":1,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/real-time-scene-text-detection-with#ran","syntology_url":"https://syntology.ai/paper/1911.08947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08947"}},"official":{"repos":["MhLiao/DB"],"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/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/190513128","slug":"190513128","title":"Recommendation from Raw Data with Adaptive Compound Poisson Factorization","date":"2019-05-20","arxiv_id":"1905.13128","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/190513128#ran","syntology_url":"https://syntology.ai/paper/1905.13128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13128"}},"official":{"repos":["Oligou/dcPF"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/making-classification-competitive-for-deep","slug":"making-classification-competitive-for-deep","title":"Classification is a Strong Baseline for Deep Metric Learning","date":"2018-11-30","arxiv_id":"1811.12649","repositories_listed":2,"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/making-classification-competitive-for-deep#ran","syntology_url":"https://syntology.ai/paper/1811.12649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.12649"}},"official":{"repos":["azgo14/classification_metric_learning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-the-first-adversarially-robust-neural","slug":"towards-the-first-adversarially-robust-neural","title":"Towards the first adversarially robust neural network model on MNIST","date":"2018-05-23","arxiv_id":"1805.09190","repositories_listed":3,"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/towards-the-first-adversarially-robust-neural#ran","syntology_url":"https://syntology.ai/paper/1805.09190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09190"}},"official":null}},{"url":"/paper/efficient-end-to-end-learning-for-quantizable","slug":"efficient-end-to-end-learning-for-quantizable","title":"Efficient end-to-end learning for quantizable representations","date":"2018-05-15","arxiv_id":"1805.05809","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-end-to-end-learning-for-quantizable#ran","syntology_url":"https://syntology.ai/paper/1805.05809","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.05809"}},"official":{"repos":["maestrojeong/Deep-Hash-Table-ICML18"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-convolutional-networks-for-content","slug":"learning-convolutional-networks-for-content","title":"Learning Convolutional Networks for Content-weighted Image Compression","date":"2017-03-30","arxiv_id":"1703.10553","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-convolutional-networks-for-content#ran","syntology_url":"https://syntology.ai/paper/1703.10553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.10553"}},"official":null}},{"url":"/paper/hashnet-deep-learning-to-hash-by-continuation","slug":"hashnet-deep-learning-to-hash-by-continuation","title":"HashNet: Deep Learning to Hash by Continuation","date":"2017-02-02","arxiv_id":"1702.00758","repositories_listed":2,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":2,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/hashnet-deep-learning-to-hash-by-continuation#ran","syntology_url":"https://syntology.ai/paper/1702.00758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.00758"}},"official":{"repos":["thuml/HashNet"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/xnor-net-imagenet-classification-using-binary","slug":"xnor-net-imagenet-classification-using-binary","title":"XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networks","date":"2016-03-16","arxiv_id":"1603.05279","repositories_listed":20,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":9,"n_instrument":7,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"16 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; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/xnor-net-imagenet-classification-using-binary#ran","syntology_url":"https://syntology.ai/paper/1603.05279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.05279"}},"official":null}}],"record_sha256":"249a939952c7372def396d3484d59b138fcf2d57cce4f231ad5badd8fd15251b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}