{"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/2","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":5,"rows_per_page":100,"rows":[101,200],"of":433,"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","prev":"/task/binarization","next":"/task/binarization/papers/3","papers":[{"url":"/paper/ir2net-information-restriction-and","slug":"ir2net-information-restriction-and","title":"IR2Net: Information Restriction and Information Recovery for Accurate Binary Neural Networks","date":"2022-10-06","arxiv_id":"2210.02637","repositories_listed":1,"syntology":null},{"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/svnet-where-so-3-equivariance-meets","slug":"svnet-where-so-3-equivariance-meets","title":"SVNet: Where SO(3) Equivariance Meets Binarization on Point Cloud Representation","date":"2022-09-13","arxiv_id":"2209.05924","repositories_listed":1,"syntology":null},{"url":"/paper/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/repbnn-towards-a-precise-binary-neural","slug":"repbnn-towards-a-precise-binary-neural","title":"RepBNN: towards a precise Binary Neural Network with Enhanced Feature Map via Repeating","date":"2022-07-19","arxiv_id":"2207.09049","repositories_listed":1,"syntology":null},{"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/gaaf-searching-activation-functions-for","slug":"gaaf-searching-activation-functions-for","title":"GAAF: Searching Activation Functions for Binary Neural Networks through Genetic Algorithm","date":"2022-06-05","arxiv_id":"2206.03291","repositories_listed":1,"syntology":null},{"url":"/paper/optimization-of-decision-tree-evaluation","slug":"optimization-of-decision-tree-evaluation","title":"Optimization of Decision Tree Evaluation Using SIMD Instructions","date":"2022-05-15","arxiv_id":"2205.07307","repositories_listed":1,"syntology":null},{"url":"/paper/puert-probabilistic-under-sampling-and","slug":"puert-probabilistic-under-sampling-and","title":"PUERT: Probabilistic Under-sampling and Explicable Reconstruction Network for CS-MRI","date":"2022-04-24","arxiv_id":"2204.11189","repositories_listed":1,"syntology":null},{"url":"/paper/tormentor-deterministic-dynamic-path-data","slug":"tormentor-deterministic-dynamic-path-data","title":"TorMentor: Deterministic dynamic-path, data augmentations with fractals","date":"2022-04-07","arxiv_id":"2204.03776","repositories_listed":1,"syntology":null},{"url":"/paper/bimodal-distributed-binarized-neural-networks","slug":"bimodal-distributed-binarized-neural-networks","title":"Bimodal Distributed Binarized Neural Networks","date":"2022-04-05","arxiv_id":"2204.02004","repositories_listed":1,"syntology":null},{"url":"/paper/tooth-instance-segmentation-on-panoramic","slug":"tooth-instance-segmentation-on-panoramic","title":"Tooth Instance Segmentation on Panoramic Dental Radiographs Using U-Nets and Morphological Processing","date":"2022-03-31","arxiv_id":"2204.00095","repositories_listed":1,"syntology":null},{"url":"/paper/bibert-accurate-fully-binarized-bert-1","slug":"bibert-accurate-fully-binarized-bert-1","title":"BiBERT: Accurate Fully Binarized BERT","date":"2022-03-12","arxiv_id":"2203.06390","repositories_listed":1,"syntology":null},{"url":"/paper/bifsmn-binary-neural-network-for-keyword","slug":"bifsmn-binary-neural-network-for-keyword","title":"BiFSMN: Binary Neural Network for Keyword Spotting","date":"2022-02-14","arxiv_id":"2202.06483","repositories_listed":1,"syntology":null},{"url":"/paper/docentr-an-end-to-end-document-image","slug":"docentr-an-end-to-end-document-image","title":"DocEnTr: An End-to-End Document Image Enhancement Transformer","date":"2022-01-25","arxiv_id":"2201.10252","repositories_listed":1,"syntology":null},{"url":"/paper/kartalol-transfer-learning-using-deep-neural","slug":"kartalol-transfer-learning-using-deep-neural","title":"KartalOl: Transfer learning using deep neural network for iris segmentation and localization: New dataset for iris segmentation","date":"2021-12-09","arxiv_id":"2112.05236","repositories_listed":1,"syntology":null},{"url":"/paper/hhf-hashing-guided-hinge-function-for-deep","slug":"hhf-hashing-guided-hinge-function-for-deep","title":"HHF: Hashing-guided Hinge Function for Deep Hashing Retrieval","date":"2021-12-04","arxiv_id":"2112.02225","repositories_listed":1,"syntology":null},{"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/binary-independent-component-analysis-via-non","slug":"binary-independent-component-analysis-via-non","title":"Binary Independent Component Analysis: A Non-stationarity-based Approach","date":"2021-11-30","arxiv_id":"2111.15431","repositories_listed":1,"syntology":null},{"url":"/paper/pokebnn-a-binary-pursuit-of-lightweight","slug":"pokebnn-a-binary-pursuit-of-lightweight","title":"PokeBNN: A Binary Pursuit of Lightweight Accuracy","date":"2021-11-30","arxiv_id":"2112.00133","repositories_listed":1,"syntology":null},{"url":"/paper/xnodr-and-xnidr-two-accurate-and-fast-fully","slug":"xnodr-and-xnidr-two-accurate-and-fast-fully","title":"XnODR and XnIDR: Two Accurate and Fast Fully Connected Layers For Convolutional Neural Networks","date":"2021-11-21","arxiv_id":"2111.10854","repositories_listed":1,"syntology":null},{"url":"/paper/iterative-training-finding-binary-weight-deep","slug":"iterative-training-finding-binary-weight-deep","title":"Iterative Training: Finding Binary Weight Deep Neural Networks with Layer Binarization","date":"2021-11-13","arxiv_id":"2111.07046","repositories_listed":1,"syntology":null},{"url":"/paper/communication-efficient-federated-learning-9","slug":"communication-efficient-federated-learning-9","title":"Communication-Efficient Federated Learning with Binary Neural Networks","date":"2021-10-05","arxiv_id":"2110.02226","repositories_listed":1,"syntology":null},{"url":"/paper/somnnet-an-spo2-based-deep-learning-network","slug":"somnnet-an-spo2-based-deep-learning-network","title":"SomnNET: An SpO2 Based Deep Learning Network for Sleep Apnea Detection in Smartwatches","date":"2021-08-25","arxiv_id":"2108.11468","repositories_listed":1,"syntology":null},{"url":"/paper/n-ary-constituent-tree-parsing-with-recursive","slug":"n-ary-constituent-tree-parsing-with-recursive","title":"N-ary Constituent Tree Parsing with Recursive Semi-Markov Model","date":"2021-07-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/exact-backpropagation-in-binary-weighted","slug":"exact-backpropagation-in-binary-weighted","title":"Exact Backpropagation in Binary Weighted Networks with Group Weight Transformations","date":"2021-07-03","arxiv_id":"2107.01400","repositories_listed":1,"syntology":null},{"url":"/paper/enhance-to-read-better-an-improved-generative","slug":"enhance-to-read-better-an-improved-generative","title":"Enhance to Read Better: A Multi-Task Adversarial Network for Handwritten Document Image Enhancement","date":"2021-05-26","arxiv_id":"2105.12710","repositories_listed":1,"syntology":null},{"url":"/paper/sauvolanet-learning-adaptive-sauvola-network","slug":"sauvolanet-learning-adaptive-sauvola-network","title":"SauvolaNet: Learning Adaptive Sauvola Network for Degraded Document Binarization","date":"2021-05-12","arxiv_id":"2105.05521","repositories_listed":1,"syntology":null},{"url":"/paper/a-1d-cnn-based-deep-learning-technique-for","slug":"a-1d-cnn-based-deep-learning-technique-for","title":"A 1D-CNN Based Deep Learning Technique for Sleep Apnea Detection in IoT Sensors","date":"2021-05-02","arxiv_id":"2105.00528","repositories_listed":1,"syntology":null},{"url":"/paper/binarized-aggregated-network-with","slug":"binarized-aggregated-network-with","title":"Binarized Aggregated Network with Quantization: Flexible Deep Learning Deployment for CSI Feedback in Massive MIMO System","date":"2021-05-01","arxiv_id":"2105.00354","repositories_listed":1,"syntology":null},{"url":"/paper/training-multi-bit-quantized-and-binarized","slug":"training-multi-bit-quantized-and-binarized","title":"Training Multi-bit Quantized and Binarized Networks with A Learnable Symmetric Quantizer","date":"2021-04-01","arxiv_id":"2104.00210","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustness-by-design-through","slug":"adversarial-robustness-by-design-through","title":"Adversarial Robustness by Design through Analog Computing and Synthetic Gradients","date":"2021-01-06","arxiv_id":"2101.02115","repositories_listed":1,"syntology":null},{"url":"/paper/binary-graph-neural-networks","slug":"binary-graph-neural-networks","title":"Binary Graph Neural Networks","date":"2020-12-31","arxiv_id":"2012.15823","repositories_listed":1,"syntology":null},{"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/learning-independent-instance-maps-for-crowd","slug":"learning-independent-instance-maps-for-crowd","title":"Learning Independent Instance Maps for Crowd Localization","date":"2020-12-08","arxiv_id":"2012.04164","repositories_listed":1,"syntology":null},{"url":"/paper/binary-neural-network-aided-csi-feedback-in","slug":"binary-neural-network-aided-csi-feedback-in","title":"Binary Neural Network Aided CSI Feedback in Massive MIMO System","date":"2020-11-05","arxiv_id":"2011.02692","repositories_listed":1,"syntology":null},{"url":"/paper/sugeno-integral-generalization-applied-to","slug":"sugeno-integral-generalization-applied-to","title":"Sugeno integral generalization applied to improve adaptive image binarization","date":"2020-10-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/two-stage-generative-adversarial-networks-for","slug":"two-stage-generative-adversarial-networks-for","title":"Two-stage generative adversarial networks for document image binarization with color noise and background removal","date":"2020-10-20","arxiv_id":"2010.10103","repositories_listed":1,"syntology":null},{"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/training-binary-neural-networks-through-1","slug":"training-binary-neural-networks-through-1","title":"Training Binary Neural Networks through Learning with Noisy Supervision","date":"2020-10-10","arxiv_id":"2010.04871","repositories_listed":1,"syntology":null},{"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/unconstrained-text-detection-in-manga-a-new","slug":"unconstrained-text-detection-in-manga-a-new","title":"Unconstrained Text Detection in Manga: a New Dataset and Baseline","date":"2020-09-09","arxiv_id":"2009.04042","repositories_listed":1,"syntology":null},{"url":"/paper/a-generalization-of-otsus-method-and-minimum","slug":"a-generalization-of-otsus-method-and-minimum","title":"A Generalization of Otsu’s Method and Minimum Error Thresholding","date":"2020-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-generalization-of-otsu-s-method-and-minimum","slug":"a-generalization-of-otsu-s-method-and-minimum","title":"A Generalization of Otsu's Method and Minimum Error Thresholding","date":"2020-07-14","arxiv_id":"2007.07350","repositories_listed":1,"syntology":null},{"url":"/paper/udbnet-unsupervised-document-binarization","slug":"udbnet-unsupervised-document-binarization","title":"UDBNET: Unsupervised Document Binarization Network via Adversarial Game","date":"2020-07-14","arxiv_id":"2007.07075","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-neural-network-deployment-for","slug":"efficient-neural-network-deployment-for","title":"Efficient Neural Network Deployment for Microcontroller","date":"2020-07-02","arxiv_id":"2007.01348","repositories_listed":1,"syntology":null},{"url":"/paper/defending-and-harnessing-the-bit-flip-based","slug":"defending-and-harnessing-the-bit-flip-based","title":"Defending and Harnessing the Bit-Flip Based Adversarial Weight Attack","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ordinal-non-negative-matrix-factorization-for","slug":"ordinal-non-negative-matrix-factorization-for","title":"Ordinal Non-negative Matrix Factorization for Recommendation","date":"2020-06-01","arxiv_id":"2006.01034","repositories_listed":1,"syntology":null},{"url":"/paper/training-binary-neural-networks-with-real-to-1","slug":"training-binary-neural-networks-with-real-to-1","title":"Training Binary Neural Networks with Real-to-Binary Convolutions","date":"2020-03-25","arxiv_id":"2003.11535","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-connection-between-binary-and","slug":"exploring-the-connection-between-binary-and","title":"Exploring the Connection Between Binary and Spiking Neural Networks","date":"2020-02-24","arxiv_id":"2002.10064","repositories_listed":1,"syntology":null},{"url":"/paper/meliusnet-can-binary-neural-networks-achieve","slug":"meliusnet-can-binary-neural-networks-achieve","title":"MeliusNet: Can Binary Neural Networks Achieve MobileNet-level Accuracy?","date":"2020-01-16","arxiv_id":"2001.05936","repositories_listed":1,"syntology":null},{"url":"/paper/tentaclenet-a-pseudo-ensemble-template-for","slug":"tentaclenet-a-pseudo-ensemble-template-for","title":"TentacleNet: A Pseudo-Ensemble Template for Accurate Binary Convolutional Neural Networks","date":"2019-12-20","arxiv_id":"1912.10103","repositories_listed":1,"syntology":null},{"url":"/paper/transparent-classification-with-multilayer","slug":"transparent-classification-with-multilayer","title":"Transparent Classification with Multilayer Logical Perceptrons and Random Binarization","date":"2019-12-10","arxiv_id":"1912.04695","repositories_listed":1,"syntology":null},{"url":"/paper/coopnet-cooperative-convolutional-neural","slug":"coopnet-cooperative-convolutional-neural","title":"CoopNet: Cooperative Convolutional Neural Network for Low-Power MCUs","date":"2019-11-19","arxiv_id":"1911.08606","repositories_listed":1,"syntology":null},{"url":"/paper/a-computing-kernel-for-network-binarization","slug":"a-computing-kernel-for-network-binarization","title":"A Computing Kernel for Network Binarization on PyTorch","date":"2019-11-11","arxiv_id":"1911.04477","repositories_listed":1,"syntology":null},{"url":"/paper/xnor-net-improved-binary-neural-networks","slug":"xnor-net-improved-binary-neural-networks","title":"XNOR-Net++: Improved Binary Neural Networks","date":"2019-09-30","arxiv_id":"1909.13863","repositories_listed":1,"syntology":null},{"url":"/paper/balanced-binary-neural-networks-with-gated","slug":"balanced-binary-neural-networks-with-gated","title":"Balanced Binary Neural Networks with Gated Residual","date":"2019-09-26","arxiv_id":"1909.12117","repositories_listed":1,"syntology":null},{"url":"/paper/midi-sandwich2-rnn-based-hierarchical-multi","slug":"midi-sandwich2-rnn-based-hierarchical-multi","title":"MIDI-Sandwich2: RNN-based Hierarchical Multi-modal Fusion Generation VAE networks for multi-track symbolic music generation","date":"2019-09-08","arxiv_id":"1909.03522","repositories_listed":1,"syntology":null},{"url":"/paper/brno-mobile-ocr-dataset","slug":"brno-mobile-ocr-dataset","title":"Brno Mobile OCR Dataset","date":"2019-07-02","arxiv_id":"1907.01307","repositories_listed":1,"syntology":null},{"url":"/paper/memory-efficient-and-fast-implementation-of","slug":"memory-efficient-and-fast-implementation-of","title":"Memory-efficient and fast implementation of local adaptive binarization methods","date":"2019-05-30","arxiv_id":"1905.13038","repositories_listed":1,"syntology":null},{"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/improved-training-of-binary-networks-for","slug":"improved-training-of-binary-networks-for","title":"Improved training of binary networks for human pose estimation and image recognition","date":"2019-04-11","arxiv_id":"1904.05868","repositories_listed":1,"syntology":null},{"url":"/paper/progressive-stochastic-binarization-of-deep","slug":"progressive-stochastic-binarization-of-deep","title":"Progressive Stochastic Binarization of Deep Networks","date":"2019-04-03","arxiv_id":"1904.02205","repositories_listed":1,"syntology":null},{"url":"/paper/improving-document-binarization-via","slug":"improving-document-binarization-via","title":"Improving Document Binarization via Adversarial Noise-Texture Augmentation","date":"2018-10-25","arxiv_id":"1810.11120","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-binary-cnns-for-landmark","slug":"hierarchical-binary-cnns-for-landmark","title":"Hierarchical binary CNNs for landmark localization with limited resources","date":"2018-08-14","arxiv_id":"1808.04803","repositories_listed":1,"syntology":null},{"url":"/paper/skeletracks-automatic-separation-of","slug":"skeletracks-automatic-separation-of","title":"Skeletracks: automatic separation of overlapping fission tracks in apatite and muscovite using image processing","date":"2018-06-13","arxiv_id":"1806.05199","repositories_listed":1,"syntology":null},{"url":"/paper/tapas-tricks-to-accelerate-encrypted","slug":"tapas-tricks-to-accelerate-encrypted","title":"TAPAS: Tricks to Accelerate (encrypted) Prediction As a Service","date":"2018-06-09","arxiv_id":"1806.03461","repositories_listed":1,"syntology":null},{"url":"/paper/document-enhancement-using-visibility","slug":"document-enhancement-using-visibility","title":"Document Enhancement Using Visibility Detection","date":"2018-06-01","arxiv_id":null,"repositories_listed":1,"syntology":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/discrete-factorization-machines-for-fast","slug":"discrete-factorization-machines-for-fast","title":"Discrete Factorization Machines for Fast Feature-based Recommendation","date":"2018-05-06","arxiv_id":"1805.02232","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-binary-networks-optimizing-for","slug":"hybrid-binary-networks-optimizing-for","title":"Hybrid Binary Networks: Optimizing for Accuracy, Efficiency and Memory","date":"2018-04-11","arxiv_id":"1804.03867","repositories_listed":1,"syntology":null},{"url":"/paper/distribution-aware-binarization-of-neural","slug":"distribution-aware-binarization-of-neural","title":"Distribution-Aware Binarization of Neural Networks for Sketch Recognition","date":"2018-04-09","arxiv_id":"1804.02941","repositories_listed":1,"syntology":null},{"url":"/paper/b-dcganevaluation-of-binarized-dcgan-for-fpga","slug":"b-dcganevaluation-of-binarized-dcgan-for-fpga","title":"B-DCGAN:Evaluation of Binarized DCGAN for FPGA","date":"2018-03-29","arxiv_id":"1803.10930","repositories_listed":1,"syntology":null},{"url":"/paper/near-lossless-binarization-of-word-embeddings","slug":"near-lossless-binarization-of-word-embeddings","title":"Near-lossless Binarization of Word Embeddings","date":"2018-03-24","arxiv_id":"1803.09065","repositories_listed":1,"syntology":null},{"url":"/paper/loss-aware-weight-quantization-of-deep","slug":"loss-aware-weight-quantization-of-deep","title":"Loss-aware Weight Quantization of Deep Networks","date":"2018-02-23","arxiv_id":"1802.08635","repositories_listed":1,"syntology":null},{"url":"/paper/pdnet-semantic-segmentation-integrated-with-a","slug":"pdnet-semantic-segmentation-integrated-with-a","title":"PDNet: Semantic Segmentation integrated with a Primal-Dual Network for Document binarization","date":"2018-01-26","arxiv_id":"1801.08694","repositories_listed":1,"syntology":null},{"url":"/paper/rebnet-residual-binarized-neural-network","slug":"rebnet-residual-binarized-neural-network","title":"ReBNet: Residual Binarized Neural Network","date":"2017-11-03","arxiv_id":"1711.01243","repositories_listed":1,"syntology":null},{"url":"/paper/model-compression-as-constrained-optimization","slug":"model-compression-as-constrained-optimization","title":"Model compression as constrained optimization, with application to neural nets. Part II: quantization","date":"2017-07-13","arxiv_id":"1707.04319","repositories_listed":1,"syntology":null},{"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/loss-aware-binarization-of-deep-networks","slug":"loss-aware-binarization-of-deep-networks","title":"Loss-aware Binarization of Deep Networks","date":"2016-11-05","arxiv_id":"1611.01600","repositories_listed":1,"syntology":null},{"url":"/paper/recurrent-neural-networks-with-limited-1","slug":"recurrent-neural-networks-with-limited-1","title":"Recurrent Neural Networks With Limited Numerical Precision","date":"2016-08-24","arxiv_id":"1608.06902","repositories_listed":1,"syntology":null},{"url":null,"slug":"highly-efficient-and-effective-llms-with","title":"Highly Efficient and Effective LLMs with Multi-Boolean Architectures","date":"2025-05-28","arxiv_id":"2505.22811","repositories_listed":0,"syntology":null},{"url":null,"slug":"partial-differential-equation-system-for","title":"Partial differential equation system for binarization of degraded document images","date":"2025-03-11","arxiv_id":"2503.08017","repositories_listed":0,"syntology":null},{"url":null,"slug":"10k-is-enough-an-ultra-lightweight-binarized","title":"10K is Enough: An Ultra-Lightweight Binarized Network for Infrared Small-Target Detection","date":"2025-03-04","arxiv_id":"2503.02662","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-based-event-data-coding-a-joint","title":"Deep Learning-based Event Data Coding: A Joint Spatiotemporal and Polarity Solution","date":"2025-02-05","arxiv_id":"2502.03285","repositories_listed":0,"syntology":null},{"url":null,"slug":"hamming-attention-distillation-binarizing","title":"Hamming Attention Distillation: Binarizing Keys and Queries for Efficient Long-Context Transformers","date":"2025-02-03","arxiv_id":"2502.01770","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-interpretability-and-accuracy-in","title":"Improving Interpretability and Accuracy in Neuro-Symbolic Rule Extraction Using Class-Specific Sparse Filters","date":"2025-01-28","arxiv_id":"2501.16677","repositories_listed":0,"syntology":null},{"url":null,"slug":"explaining-categorical-feature-interactions","title":"Explaining Categorical Feature Interactions Using Graph Covariance and LLMs","date":"2025-01-24","arxiv_id":"2501.14932","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-binary-representation-learning-for","title":"Sparse Binary Representation Learning for Knowledge Tracing","date":"2025-01-17","arxiv_id":"2501.09893","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-event-driven-spiking-transformer","title":"Binary Event-Driven Spiking Transformer","date":"2025-01-10","arxiv_id":"2501.05904","repositories_listed":0,"syntology":null},{"url":null,"slug":"binarized-neural-network-for-multi-spectral","title":"Binarized Neural Network for Multi-spectral Image Fusion","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/towards-end-to-end-neuromorphic-voxel-based","slug":"towards-end-to-end-neuromorphic-voxel-based","title":"Towards End-to-End Neuromorphic Voxel-based 3D Object Reconstruction Without Physical Priors","date":"2025-01-01","arxiv_id":"2501.00741","repositories_listed":0,"syntology":null},{"url":null,"slug":"cbnn-3-party-secure-framework-for-customized","title":"CBNN: 3-Party Secure Framework for Customized Binary Neural Networks Inference","date":"2024-12-21","arxiv_id":"2412.16449","repositories_listed":0,"syntology":null},{"url":null,"slug":"beexformer-a-fast-inferencing-transformer","title":"BEExformer: A Fast Inferencing Transformer Architecture via Binarization with Multiple Early Exits","date":"2024-12-06","arxiv_id":"2412.05225","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-change-detection-in-multilingual","title":"Text Change Detection in Multilingual Documents Using Image Comparison","date":"2024-12-05","arxiv_id":"2412.04137","repositories_listed":0,"syntology":null},{"url":null,"slug":"arabic-handwritten-document-ocr-solution-with","title":"Arabic Handwritten Document OCR Solution with Binarization and Adaptive Scale Fusion Detection","date":"2024-12-02","arxiv_id":"2412.01601","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-mamba-towards-accurate-1-bit-state-space","title":"Bi-Mamba: Towards Accurate 1-Bit State Space Models","date":"2024-11-18","arxiv_id":"2411.11843","repositories_listed":0,"syntology":null}],"record_sha256":"5c904c419ccadf89890adb5081c7dc9fba2eb5356c5c3f6dd22870b8d95ace1d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}