{"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/convolutional-neural-networks-using","title":"Convolutional Neural Networks using Logarithmic Data Representation","arxiv_id":"1603.01025","date":"2016-03-03","proceeding":null,"authors":["Daisuke Miyashita","Edward H. Lee","Boris Murmann"],"abstract":"Recent advances in convolutional neural networks have considered model\ncomplexity and hardware efficiency to enable deployment onto embedded systems\nand mobile devices. For example, it is now well-known that the arithmetic\noperations of deep networks can be encoded down to 8-bit fixed-point without\nsignificant deterioration in performance. However, further reduction in\nprecision down to as low as 3-bit fixed-point results in significant losses in\nperformance. In this paper we propose a new data representation that enables\nstate-of-the-art networks to be encoded to 3 bits with negligible loss in\nclassification performance. To perform this, we take advantage of the fact that\nthe weights and activations in a trained network naturally have non-uniform\ndistributions. Using non-uniform, base-2 logarithmic representation to encode\nweights, communicate activations, and perform dot-products enables networks to\n1) achieve higher classification accuracies than fixed-point at the same\nresolution and 2) eliminate bulky digital multipliers. Finally, we propose an\nend-to-end training procedure that uses log representation at 5-bits, which\nachieves higher final test accuracy than linear at 5-bits.","url_abs":"http://arxiv.org/abs/1603.01025v2","url_pdf":"http://arxiv.org/pdf/1603.01025v2.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":"convolutional-neural-networks-using","repo_url":"https://github.com/Enderdead/Pytorch_Quantize_impls","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"classification","task_name":"General Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1603.01025","atlas_url":"https://app.syntology.ai/?focus=1603.01025","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":"1603.01025"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1603.01025\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1603.01025"},"call":"get_concepts_for_paper(arxiv_id=\"1603.01025\")"}],"by_repo":[{"repo":"Enderdead/Pytorch_Quantize_impls","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1606.06160"],"harvested_for_calls":[{"arxiv_id":"1606.06160","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1606.06160"},"call":"get_harvested_code_for_paper(arxiv_id=\"1606.06160\")"}]}],"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":"99f0866ad0f5eb35ecc9fb379d1cac1a57cc5eb87da0579fdfb7d34b90ba405a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}