{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MNOGAKYAICRHLVU3H7FM6URWIN","short_pith_number":"pith:MNOGAKYA","schema_version":"1.0","canonical_sha256":"635c602b0040a275d69b3fcacf5236434f249b89789d807f6960895742771074","source":{"kind":"arxiv","id":"1910.08237","version":3},"attestation_state":"computed","paper":{"title":"Mirror Descent View for Neural Network Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kartik Gupta, Philip H. S. Torr, Puneet K. Dokania, Richard Hartley, Thalaiyasingam Ajanthan","submitted_at":"2019-10-18T03:19:21Z","abstract_excerpt":"Quantizing large Neural Networks (NN) while maintaining the performance is highly desirable for resource-limited devices due to reduced memory and time complexity. It is usually formulated as a constrained optimization problem and optimized via a modified version of gradient descent. In this work, by interpreting the continuous parameters (unconstrained) as the dual of the quantized ones, we introduce a Mirror Descent (MD) framework for NN quantization. Specifically, we provide conditions on the projections (i.e., mapping from continuous to quantized ones) which would enable us to derive valid"},"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":"1910.08237","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-18T03:19:21Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"2d69b4524003c38643b8cfd202c8f56a9f7fcccdc367f2cd02ef034dcf49038d","abstract_canon_sha256":"e740c0c934b6ee76940c2dc70b77c36accd2ecc5a1aafd88be28804ca96eb18d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:19:14.422362Z","signature_b64":"B9sQf78PzFC1e80NCBiYQk0etvqZ97hCtYz8ze8pLsuCPyU3zN5MJMQMbejfTUw0PZtiztYJKw+ferO4Au/IAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"635c602b0040a275d69b3fcacf5236434f249b89789d807f6960895742771074","last_reissued_at":"2026-07-05T02:19:14.421855Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:19:14.421855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mirror Descent View for Neural Network Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kartik Gupta, Philip H. S. Torr, Puneet K. Dokania, Richard Hartley, Thalaiyasingam Ajanthan","submitted_at":"2019-10-18T03:19:21Z","abstract_excerpt":"Quantizing large Neural Networks (NN) while maintaining the performance is highly desirable for resource-limited devices due to reduced memory and time complexity. It is usually formulated as a constrained optimization problem and optimized via a modified version of gradient descent. In this work, by interpreting the continuous parameters (unconstrained) as the dual of the quantized ones, we introduce a Mirror Descent (MD) framework for NN quantization. Specifically, we provide conditions on the projections (i.e., mapping from continuous to quantized ones) which would enable us to derive valid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.08237","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.08237/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":"1910.08237","created_at":"2026-07-05T02:19:14.421914+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.08237v3","created_at":"2026-07-05T02:19:14.421914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.08237","created_at":"2026-07-05T02:19:14.421914+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNOGAKYAICRH","created_at":"2026-07-05T02:19:14.421914+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNOGAKYAICRHLVU3","created_at":"2026-07-05T02:19:14.421914+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNOGAKYA","created_at":"2026-07-05T02:19:14.421914+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/MNOGAKYAICRHLVU3H7FM6URWIN","json":"https://pith.science/pith/MNOGAKYAICRHLVU3H7FM6URWIN.json","graph_json":"https://pith.science/api/pith-number/MNOGAKYAICRHLVU3H7FM6URWIN/graph.json","events_json":"https://pith.science/api/pith-number/MNOGAKYAICRHLVU3H7FM6URWIN/events.json","paper":"https://pith.science/paper/MNOGAKYA"},"agent_actions":{"view_html":"https://pith.science/pith/MNOGAKYAICRHLVU3H7FM6URWIN","download_json":"https://pith.science/pith/MNOGAKYAICRHLVU3H7FM6URWIN.json","view_paper":"https://pith.science/paper/MNOGAKYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.08237&json=true","fetch_graph":"https://pith.science/api/pith-number/MNOGAKYAICRHLVU3H7FM6URWIN/graph.json","fetch_events":"https://pith.science/api/pith-number/MNOGAKYAICRHLVU3H7FM6URWIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNOGAKYAICRHLVU3H7FM6URWIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNOGAKYAICRHLVU3H7FM6URWIN/action/storage_attestation","attest_author":"https://pith.science/pith/MNOGAKYAICRHLVU3H7FM6URWIN/action/author_attestation","sign_citation":"https://pith.science/pith/MNOGAKYAICRHLVU3H7FM6URWIN/action/citation_signature","submit_replication":"https://pith.science/pith/MNOGAKYAICRHLVU3H7FM6URWIN/action/replication_record"}},"created_at":"2026-07-05T02:19:14.421914+00:00","updated_at":"2026-07-05T02:19:14.421914+00:00"}