{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J4IPI4KVA5DKCVG6GTAZKURXZY","short_pith_number":"pith:J4IPI4KV","schema_version":"1.0","canonical_sha256":"4f10f471550746a154de34c1955237ce3ec826b7dea3454f69dfc8cf3afeec78","source":{"kind":"arxiv","id":"1802.08635","version":2},"attestation_state":"computed","paper":{"title":"Loss-aware Weight Quantization of Deep Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"James T. Kwok, Lu Hou","submitted_at":"2018-02-23T16:54:22Z","abstract_excerpt":"The huge size of deep networks hinders their use in small computing devices. In this paper, we consider compressing the network by weight quantization. We extend a recently proposed loss-aware weight binarization scheme to ternarization, with possibly different scaling parameters for the positive and negative weights, and m-bit (where m > 2) quantization. Experiments on feedforward and recurrent neural networks show that the proposed scheme outperforms state-of-the-art weight quantization algorithms, and is as accurate (or even more accurate) than the full-precision network."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1802.08635","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-23T16:54:22Z","cross_cats_sorted":[],"title_canon_sha256":"9f33819dacb9127ff8701d44fbc228ef5b233aea0f9be6472b89ec84d589731a","abstract_canon_sha256":"8e8e6f5cc8f32794b99ba1b712e4637ea4bfebd30efb4eee4e451dac31da99ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:15.942628Z","signature_b64":"GjEilqPUQnV0M0QX9I9VXnycFpxyRKWSn29FhTDlmLts3td68hKJggI3cMRtWWUjSuVUDD3IpvUIfwFBhCbADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f10f471550746a154de34c1955237ce3ec826b7dea3454f69dfc8cf3afeec78","last_reissued_at":"2026-05-18T00:16:15.942088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:15.942088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Loss-aware Weight Quantization of Deep Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"James T. Kwok, Lu Hou","submitted_at":"2018-02-23T16:54:22Z","abstract_excerpt":"The huge size of deep networks hinders their use in small computing devices. In this paper, we consider compressing the network by weight quantization. We extend a recently proposed loss-aware weight binarization scheme to ternarization, with possibly different scaling parameters for the positive and negative weights, and m-bit (where m > 2) quantization. Experiments on feedforward and recurrent neural networks show that the proposed scheme outperforms state-of-the-art weight quantization algorithms, and is as accurate (or even more accurate) than the full-precision network."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08635","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.08635","created_at":"2026-05-18T00:16:15.942197+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08635v2","created_at":"2026-05-18T00:16:15.942197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08635","created_at":"2026-05-18T00:16:15.942197+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4IPI4KVA5DK","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4IPI4KVA5DKCVG6","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4IPI4KV","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J4IPI4KVA5DKCVG6GTAZKURXZY","json":"https://pith.science/pith/J4IPI4KVA5DKCVG6GTAZKURXZY.json","graph_json":"https://pith.science/api/pith-number/J4IPI4KVA5DKCVG6GTAZKURXZY/graph.json","events_json":"https://pith.science/api/pith-number/J4IPI4KVA5DKCVG6GTAZKURXZY/events.json","paper":"https://pith.science/paper/J4IPI4KV"},"agent_actions":{"view_html":"https://pith.science/pith/J4IPI4KVA5DKCVG6GTAZKURXZY","download_json":"https://pith.science/pith/J4IPI4KVA5DKCVG6GTAZKURXZY.json","view_paper":"https://pith.science/paper/J4IPI4KV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08635&json=true","fetch_graph":"https://pith.science/api/pith-number/J4IPI4KVA5DKCVG6GTAZKURXZY/graph.json","fetch_events":"https://pith.science/api/pith-number/J4IPI4KVA5DKCVG6GTAZKURXZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4IPI4KVA5DKCVG6GTAZKURXZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4IPI4KVA5DKCVG6GTAZKURXZY/action/storage_attestation","attest_author":"https://pith.science/pith/J4IPI4KVA5DKCVG6GTAZKURXZY/action/author_attestation","sign_citation":"https://pith.science/pith/J4IPI4KVA5DKCVG6GTAZKURXZY/action/citation_signature","submit_replication":"https://pith.science/pith/J4IPI4KVA5DKCVG6GTAZKURXZY/action/replication_record"}},"created_at":"2026-05-18T00:16:15.942197+00:00","updated_at":"2026-05-18T00:16:15.942197+00:00"}