{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XIJWF43SLMKODVSG3X5JMQGBEX","short_pith_number":"pith:XIJWF43S","schema_version":"1.0","canonical_sha256":"ba1362f3725b14e1d646ddfa9640c125e647f34370c6d4d119994da746050fde","source":{"kind":"arxiv","id":"1808.05779","version":3},"attestation_state":"computed","paper":{"title":"Learning to Quantize Deep Networks by Optimizing Quantization Intervals with Task Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Changkyu Choi, Changyong Son, Jae-Joon Han, Jinwoo Son, Sangil Jung, Seohyung Lee, Sung Ju Hwang, Youngjun Kwak","submitted_at":"2018-08-17T07:28:17Z","abstract_excerpt":"Reducing bit-widths of activations and weights of deep networks makes it efficient to compute and store them in memory, which is crucial in their deployments to resource-limited devices, such as mobile phones. However, decreasing bit-widths with quantization generally yields drastically degraded accuracy. To tackle this problem, we propose to learn to quantize activations and weights via a trainable quantizer that transforms and discretizes them. Specifically, we parameterize the quantization intervals and obtain their optimal values by directly minimizing the task loss of the network. This qu"},"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":"1808.05779","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-08-17T07:28:17Z","cross_cats_sorted":[],"title_canon_sha256":"79dd01ddfdd8f94c6ebcd5b8695822e536a1ace6f00eefa4b4abce832473ce6c","abstract_canon_sha256":"8643e162cc65826e8a9ed55e85c235fb2f9de4181190528c3926ef0309385dfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:08.186192Z","signature_b64":"nA7E6MBBmUMwBigjixgZB3v+p9QslNMVBk39Cgm6GaH5lpA5P+UUShh8Ga2DwTl1No2dQXVsb+e3K2b1EuP6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba1362f3725b14e1d646ddfa9640c125e647f34370c6d4d119994da746050fde","last_reissued_at":"2026-05-18T00:00:08.185618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:08.185618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Quantize Deep Networks by Optimizing Quantization Intervals with Task Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Changkyu Choi, Changyong Son, Jae-Joon Han, Jinwoo Son, Sangil Jung, Seohyung Lee, Sung Ju Hwang, Youngjun Kwak","submitted_at":"2018-08-17T07:28:17Z","abstract_excerpt":"Reducing bit-widths of activations and weights of deep networks makes it efficient to compute and store them in memory, which is crucial in their deployments to resource-limited devices, such as mobile phones. However, decreasing bit-widths with quantization generally yields drastically degraded accuracy. To tackle this problem, we propose to learn to quantize activations and weights via a trainable quantizer that transforms and discretizes them. Specifically, we parameterize the quantization intervals and obtain their optimal values by directly minimizing the task loss of the network. This qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05779","kind":"arxiv","version":3},"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":"1808.05779","created_at":"2026-05-18T00:00:08.185693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05779v3","created_at":"2026-05-18T00:00:08.185693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05779","created_at":"2026-05-18T00:00:08.185693+00:00"},{"alias_kind":"pith_short_12","alias_value":"XIJWF43SLMKO","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XIJWF43SLMKODVSG","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XIJWF43S","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05228","citing_title":"Evolutionary fine tuning of quantized convolution-based deep learning models","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XIJWF43SLMKODVSG3X5JMQGBEX","json":"https://pith.science/pith/XIJWF43SLMKODVSG3X5JMQGBEX.json","graph_json":"https://pith.science/api/pith-number/XIJWF43SLMKODVSG3X5JMQGBEX/graph.json","events_json":"https://pith.science/api/pith-number/XIJWF43SLMKODVSG3X5JMQGBEX/events.json","paper":"https://pith.science/paper/XIJWF43S"},"agent_actions":{"view_html":"https://pith.science/pith/XIJWF43SLMKODVSG3X5JMQGBEX","download_json":"https://pith.science/pith/XIJWF43SLMKODVSG3X5JMQGBEX.json","view_paper":"https://pith.science/paper/XIJWF43S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05779&json=true","fetch_graph":"https://pith.science/api/pith-number/XIJWF43SLMKODVSG3X5JMQGBEX/graph.json","fetch_events":"https://pith.science/api/pith-number/XIJWF43SLMKODVSG3X5JMQGBEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XIJWF43SLMKODVSG3X5JMQGBEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XIJWF43SLMKODVSG3X5JMQGBEX/action/storage_attestation","attest_author":"https://pith.science/pith/XIJWF43SLMKODVSG3X5JMQGBEX/action/author_attestation","sign_citation":"https://pith.science/pith/XIJWF43SLMKODVSG3X5JMQGBEX/action/citation_signature","submit_replication":"https://pith.science/pith/XIJWF43SLMKODVSG3X5JMQGBEX/action/replication_record"}},"created_at":"2026-05-18T00:00:08.185693+00:00","updated_at":"2026-05-18T00:00:08.185693+00:00"}