{"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/improved-training-of-binary-networks-for","title":"Improved training of binary networks for human pose estimation and image recognition","arxiv_id":"1904.05868","date":"2019-04-11","proceeding":null,"authors":["Adrian Bulat","Georgios Tzimiropoulos","Jean Kossaifi","Maja Pantic"],"abstract":"Big neural networks trained on large datasets have advanced the\nstate-of-the-art for a large variety of challenging problems, improving\nperformance by a large margin. However, under low memory and limited\ncomputational power constraints, the accuracy on the same problems drops\nconsiderable. In this paper, we propose a series of techniques that\nsignificantly improve the accuracy of binarized neural networks (i.e networks\nwhere both the features and the weights are binary). We evaluate the proposed\nimprovements on two diverse tasks: fine-grained recognition (human pose\nestimation) and large-scale image recognition (ImageNet classification).\nSpecifically, we introduce a series of novel methodological changes including:\n(a) more appropriate activation functions, (b) reverse-order initialization,\n(c) progressive quantization, and (d) network stacking and show that these\nadditions improve existing state-of-the-art network binarization techniques,\nsignificantly. Additionally, for the first time, we also investigate the extent\nto which network binarization and knowledge distillation can be combined. When\ntested on the challenging MPII dataset, our method shows a performance\nimprovement of more than 4% in absolute terms. Finally, we further validate our\nfindings by applying the proposed techniques for large-scale object recognition\non the Imagenet dataset, on which we report a reduction of error rate by 4%.","url_abs":"http://arxiv.org/abs/1904.05868v1","url_pdf":"http://arxiv.org/pdf/1904.05868v1.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":"improved-training-of-binary-networks-for","repo_url":"https://github.com/1adrianb/binary-networks-pytorch","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"binarization","task_name":"Binarization"},{"task_slug":"classification-with-binary-neural-network","task_name":"Classification with Binary Neural Network"},{"task_slug":"knowledge-distillation","task_name":"Knowledge Distillation"},{"task_slug":"object-recognition","task_name":"Object Recognition"},{"task_slug":"pose-estimation","task_name":"Pose Estimation"},{"task_slug":"quantization","task_name":"Quantization"}],"methods":[{"method_slug":"knowledge-distillation","method_name":"Knowledge Distillation"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/pose-estimation-on-mpii-human-pose","task":"Pose Estimation","dataset":"MPII Human Pose","model":"Improved Binary Network (HourGlass)","rank_in_archive_order":46,"of":46,"metrics":{"PCKh-0.5":"80.9"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.05868","atlas_url":"https://app.syntology.ai/?focus=1904.05868","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":"1904.05868"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.05868\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.05868"},"call":"get_concepts_for_paper(arxiv_id=\"1904.05868\")"}],"by_repo":[{"repo":"1adrianb/binary-networks-pytorch","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1603.05279"],"harvested_for_calls":[{"arxiv_id":"1603.05279","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1603.05279"},"call":"get_harvested_code_for_paper(arxiv_id=\"1603.05279\")"}]}],"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":"7d395b5bce13ba7bfaaa286223c5bd7d5e608fe3a6e9aa9fd20b72b42d65bf68","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}