{"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":"/paper/training-competitive-binary-neural-networks","title":"Training Competitive Binary Neural Networks from Scratch","arxiv_id":"1812.01965","date":"2018-12-05","proceeding":null,"authors":["Joseph Bethge","Marvin Bornstein","Adrian Loy","Haojin Yang","Christoph Meinel"],"abstract":"Convolutional neural networks have achieved astonishing results in different\napplication areas. Various methods that allow us to use these models on mobile\nand embedded devices have been proposed. Especially binary neural networks are\na promising approach for devices with low computational power. However,\ntraining accurate binary models from scratch remains a challenge. Previous work\noften uses prior knowledge from full-precision models and complex training\nstrategies. In our work, we focus on increasing the performance of binary\nneural networks without such prior knowledge and a much simpler training\nstrategy. In our experiments we show that we are able to achieve\nstate-of-the-art results on standard benchmark datasets. Further, to the best\nof our knowledge, we are the first to successfully adopt a network architecture\nwith dense connections for binary networks, which lets us improve the\nstate-of-the-art even further.","url_abs":"http://arxiv.org/abs/1812.01965v1","url_pdf":"http://arxiv.org/pdf/1812.01965v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"training-competitive-binary-neural-networks","repo_url":"https://github.com/hpi-xnor/BMXNet-v2","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"mxnet","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[],"methods":[{"method_slug":"dense-connections","method_name":"Dense Connections"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1812.01965","atlas_url":"https://app.syntology.ai/?focus=1812.01965","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1812.01965"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1812.01965\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1812.01965"},"call":"get_concepts_for_paper(arxiv_id=\"1812.01965\")"}],"by_repo":[{"repo":"hpi-xnor/BMXNet-v2","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2110.06804"],"harvested_for_calls":[{"arxiv_id":"2110.06804","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.06804"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.06804\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"546c9da338c0e62021f857afe471fdad149f25b8e94d0661e8dde24c51d6bf34","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}