{"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/haq-hardware-aware-automated-quantization","title":"HAQ: Hardware-Aware Automated Quantization with Mixed Precision","arxiv_id":"1811.08886","date":"2018-11-21","proceeding":"CVPR 2019 6","authors":["Kuan Wang","Zhijian Liu","Yujun Lin","Ji Lin","Song Han"],"abstract":"Model quantization is a widely used technique to compress and accelerate deep\nneural network (DNN) inference. Emergent DNN hardware accelerators begin to\nsupport mixed precision (1-8 bits) to further improve the computation\nefficiency, which raises a great challenge to find the optimal bitwidth for\neach layer: it requires domain experts to explore the vast design space trading\noff among accuracy, latency, energy, and model size, which is both\ntime-consuming and sub-optimal. Conventional quantization algorithm ignores the\ndifferent hardware architectures and quantizes all the layers in a uniform way.\nIn this paper, we introduce the Hardware-Aware Automated Quantization (HAQ)\nframework which leverages the reinforcement learning to automatically determine\nthe quantization policy, and we take the hardware accelerator's feedback in the\ndesign loop. Rather than relying on proxy signals such as FLOPs and model size,\nwe employ a hardware simulator to generate direct feedback signals (latency and\nenergy) to the RL agent. Compared with conventional methods, our framework is\nfully automated and can specialize the quantization policy for different neural\nnetwork architectures and hardware architectures. Our framework effectively\nreduced the latency by 1.4-1.95x and the energy consumption by 1.9x with\nnegligible loss of accuracy compared with the fixed bitwidth (8 bits)\nquantization. Our framework reveals that the optimal policies on different\nhardware architectures (i.e., edge and cloud architectures) under different\nresource constraints (i.e., latency, energy and model size) are drastically\ndifferent. We interpreted the implication of different quantization policies,\nwhich offer insights for both neural network architecture design and hardware\narchitecture design.","url_abs":"http://arxiv.org/abs/1811.08886v3","url_pdf":"http://arxiv.org/pdf/1811.08886v3.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":"haq-hardware-aware-automated-quantization","repo_url":"https://github.com/AhmadQasim/proxylessnas-dense","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"haq-hardware-aware-automated-quantization","repo_url":"https://github.com/MIT-HAN-LAB/ProxylessNAS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"haq-hardware-aware-automated-quantization","repo_url":"https://github.com/ZTao-z/ProxylessNAS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"haq-hardware-aware-automated-quantization","repo_url":"https://github.com/ito-rafael/once-for-all-2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"haq-hardware-aware-automated-quantization","repo_url":"https://github.com/mit-han-lab/ProxylessNAS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"haq-hardware-aware-automated-quantization","repo_url":"https://github.com/mit-han-lab/amc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"haq-hardware-aware-automated-quantization","repo_url":"https://github.com/mit-han-lab/once-for-all","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"haq-hardware-aware-automated-quantization","repo_url":"https://github.com/newwhitecheng/compress-all-nn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"haq-hardware-aware-automated-quantization","repo_url":"https://github.com/seulkiyeom/once-for-all","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"haq-hardware-aware-automated-quantization","repo_url":"https://github.com/songhan/DSD","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"BSD-2-Clause"}},{"paper_slug":"haq-hardware-aware-automated-quantization","repo_url":"https://github.com/songhan/SqueezeNet-Residual","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"BSD-2-Clause"}}],"tasks":[{"task_slug":"quantization","task_name":"Quantization"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.08886","atlas_url":"https://app.syntology.ai/?focus=1811.08886","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":"1811.08886"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.08886\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.08886"},"call":"get_concepts_for_paper(arxiv_id=\"1811.08886\")"}],"by_repo":[{"repo":"AhmadQasim/proxylessnas-dense","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1812.00332"],"harvested_for_calls":[{"arxiv_id":"1812.00332","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1812.00332"},"call":"get_harvested_code_for_paper(arxiv_id=\"1812.00332\")"}]},{"repo":"MIT-HAN-LAB/ProxylessNAS","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1812.00332"],"harvested_for_calls":[{"arxiv_id":"1812.00332","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1812.00332"},"call":"get_harvested_code_for_paper(arxiv_id=\"1812.00332\")"}]},{"repo":"ZTao-z/ProxylessNAS","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1812.00332"],"harvested_for_calls":[{"arxiv_id":"1812.00332","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1812.00332"},"call":"get_harvested_code_for_paper(arxiv_id=\"1812.00332\")"}]},{"repo":"ito-rafael/once-for-all-2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mit-han-lab/amc","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1802.03494"],"harvested_for_calls":[{"arxiv_id":"1802.03494","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.03494"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.03494\")"}]},{"repo":"mit-han-lab/once-for-all","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1908.09791"],"harvested_for_calls":[{"arxiv_id":"1908.09791","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1908.09791"},"call":"get_harvested_code_for_paper(arxiv_id=\"1908.09791\")"}]},{"repo":"newwhitecheng/compress-all-nn","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"seulkiyeom/once-for-all","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1908.09791"],"harvested_for_calls":[{"arxiv_id":"1908.09791","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1908.09791"},"call":"get_harvested_code_for_paper(arxiv_id=\"1908.09791\")"}]},{"repo":"songhan/DSD","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"songhan/SqueezeNet-Residual","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"b9357079d60d51463a5ca5bb139d608a58153ce8916beeffd1b49254f3c3a6a6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}