{"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/loss-aware-binarization-of-deep-networks","title":"Loss-aware Binarization of Deep Networks","arxiv_id":"1611.01600","date":"2016-11-05","proceeding":null,"authors":["Lu Hou","Quanming Yao","James T. Kwok"],"abstract":"Deep neural network models, though very powerful and highly successful, are\ncomputationally expensive in terms of space and time. Recently, there have been\na number of attempts on binarizing the network weights and activations. This\ngreatly reduces the network size, and replaces the underlying multiplications\nto additions or even XNOR bit operations. However, existing binarization\nschemes are based on simple matrix approximation and ignore the effect of\nbinarization on the loss. In this paper, we propose a proximal Newton algorithm\nwith diagonal Hessian approximation that directly minimizes the loss w.r.t. the\nbinarized weights. The underlying proximal step has an efficient closed-form\nsolution, and the second-order information can be efficiently obtained from the\nsecond moments already computed by the Adam optimizer. Experiments on both\nfeedforward and recurrent networks show that the proposed loss-aware\nbinarization algorithm outperforms existing binarization schemes, and is also\nmore robust for wide and deep networks.","url_abs":"http://arxiv.org/abs/1611.01600v3","url_pdf":"http://arxiv.org/pdf/1611.01600v3.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":"loss-aware-binarization-of-deep-networks","repo_url":"https://github.com/houlu369/Loss-aware-Binarization","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"binarization","task_name":"Binarization"}],"methods":[{"method_slug":"adam","method_name":"Adam"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1611.01600","atlas_url":"https://app.syntology.ai/?focus=1611.01600","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":"1611.01600"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1611.01600\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1611.01600"},"call":"get_concepts_for_paper(arxiv_id=\"1611.01600\")"}],"by_repo":[{"repo":"houlu369/Loss-aware-Binarization","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"4f95186e8bc9a61b860c9db93787488bfa4e2f54fef1505cfded22c8cb49a804","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}