{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:452SWZMUKTYM5LYL6MQS5TR2SS","short_pith_number":"pith:452SWZMU","schema_version":"1.0","canonical_sha256":"e7752b659454f0ceaf0bf3212ece3a948356dc4205dc2d8bd987e46206aab613","source":{"kind":"arxiv","id":"2309.10975","version":1},"attestation_state":"computed","paper":{"title":"SPFQ: A Stochastic Algorithm and Its Error Analysis for Neural Network Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jinjie Zhang, Rayan Saab","submitted_at":"2023-09-20T00:35:16Z","abstract_excerpt":"Quantization is a widely used compression method that effectively reduces redundancies in over-parameterized neural networks. However, existing quantization techniques for deep neural networks often lack a comprehensive error analysis due to the presence of non-convex loss functions and nonlinear activations. In this paper, we propose a fast stochastic algorithm for quantizing the weights of fully trained neural networks. Our approach leverages a greedy path-following mechanism in combination with a stochastic quantizer. Its computational complexity scales only linearly with the number of weig"},"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":"2309.10975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-20T00:35:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fb6e87a5a85bd3366811e095af1744f11b744ce73b2df71ed5cc84ef7b63a72f","abstract_canon_sha256":"192636693b3edab02d1ba430dc1dcd67fd03c72721c103c530a74884af3822da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:52:29.329328Z","signature_b64":"FWuMD3zAOhvkShcRbYr3Ovjyeh16AUDk3WuPD2RLy1rU5zAN9zDnII8snPVCzWXDDARY7HL7w2IqESNOyaOyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7752b659454f0ceaf0bf3212ece3a948356dc4205dc2d8bd987e46206aab613","last_reissued_at":"2026-07-05T06:52:29.327359Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:52:29.327359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPFQ: A Stochastic Algorithm and Its Error Analysis for Neural Network Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jinjie Zhang, Rayan Saab","submitted_at":"2023-09-20T00:35:16Z","abstract_excerpt":"Quantization is a widely used compression method that effectively reduces redundancies in over-parameterized neural networks. However, existing quantization techniques for deep neural networks often lack a comprehensive error analysis due to the presence of non-convex loss functions and nonlinear activations. In this paper, we propose a fast stochastic algorithm for quantizing the weights of fully trained neural networks. Our approach leverages a greedy path-following mechanism in combination with a stochastic quantizer. Its computational complexity scales only linearly with the number of weig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.10975","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.10975/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2309.10975","created_at":"2026-07-05T06:52:29.328810+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.10975v1","created_at":"2026-07-05T06:52:29.328810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.10975","created_at":"2026-07-05T06:52:29.328810+00:00"},{"alias_kind":"pith_short_12","alias_value":"452SWZMUKTYM","created_at":"2026-07-05T06:52:29.328810+00:00"},{"alias_kind":"pith_short_16","alias_value":"452SWZMUKTYM5LYL","created_at":"2026-07-05T06:52:29.328810+00:00"},{"alias_kind":"pith_short_8","alias_value":"452SWZMU","created_at":"2026-07-05T06:52:29.328810+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01412","citing_title":"GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation","ref_index":81,"is_internal_anchor":false},{"citing_arxiv_id":"2508.04853","citing_title":"Provable Post-Training Quantization: Theoretical Analysis of OPTQ and Qronos","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/452SWZMUKTYM5LYL6MQS5TR2SS","json":"https://pith.science/pith/452SWZMUKTYM5LYL6MQS5TR2SS.json","graph_json":"https://pith.science/api/pith-number/452SWZMUKTYM5LYL6MQS5TR2SS/graph.json","events_json":"https://pith.science/api/pith-number/452SWZMUKTYM5LYL6MQS5TR2SS/events.json","paper":"https://pith.science/paper/452SWZMU"},"agent_actions":{"view_html":"https://pith.science/pith/452SWZMUKTYM5LYL6MQS5TR2SS","download_json":"https://pith.science/pith/452SWZMUKTYM5LYL6MQS5TR2SS.json","view_paper":"https://pith.science/paper/452SWZMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.10975&json=true","fetch_graph":"https://pith.science/api/pith-number/452SWZMUKTYM5LYL6MQS5TR2SS/graph.json","fetch_events":"https://pith.science/api/pith-number/452SWZMUKTYM5LYL6MQS5TR2SS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/452SWZMUKTYM5LYL6MQS5TR2SS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/452SWZMUKTYM5LYL6MQS5TR2SS/action/storage_attestation","attest_author":"https://pith.science/pith/452SWZMUKTYM5LYL6MQS5TR2SS/action/author_attestation","sign_citation":"https://pith.science/pith/452SWZMUKTYM5LYL6MQS5TR2SS/action/citation_signature","submit_replication":"https://pith.science/pith/452SWZMUKTYM5LYL6MQS5TR2SS/action/replication_record"}},"created_at":"2026-07-05T06:52:29.328810+00:00","updated_at":"2026-07-05T06:52:29.328810+00:00"}