{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3756NG4PQN6EPK2EPTZJ2FAHQE","short_pith_number":"pith:3756NG4P","schema_version":"1.0","canonical_sha256":"dffbe69b8f837c47ab447cf29d14078103ce61969e8163eeb600ad3d72612164","source":{"kind":"arxiv","id":"1702.04008","version":2},"attestation_state":"computed","paper":{"title":"Soft Weight-Sharing for Neural Network Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Edward Meeds, Karen Ullrich, Max Welling","submitted_at":"2017-02-13T22:54:18Z","abstract_excerpt":"The success of deep learning in numerous application domains created the de- sire to run and train them on mobile devices. This however, conflicts with their computationally, memory and energy intense nature, leading to a growing interest in compression. Recent work by Han et al. (2015a) propose a pipeline that involves retraining, pruning and quantization of neural network weights, obtaining state-of-the-art compression rates. In this paper, we show that competitive compression rates can be achieved by using a version of soft weight-sharing (Nowlan & Hinton, 1992). Our method achieves both 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":"1702.04008","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-13T22:54:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0de88d8b264f1051a648b9b42a5330709872f7212561586baf4efffa5f946c5c","abstract_canon_sha256":"cc8c1b34b057c51894f7d5ac46c531d5a9e1c73c81d6c0f8c8630322088bbf44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:51.586894Z","signature_b64":"omNzKjp11NbDhX+HjNxjNGIVfP3YmoxyaP1o95BUw4/Lx6LJ/vD0HDCC/JLm3kBKxHOoB5s/3DoDA7SDuIeFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dffbe69b8f837c47ab447cf29d14078103ce61969e8163eeb600ad3d72612164","last_reissued_at":"2026-05-18T00:44:51.586472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:51.586472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Soft Weight-Sharing for Neural Network Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Edward Meeds, Karen Ullrich, Max Welling","submitted_at":"2017-02-13T22:54:18Z","abstract_excerpt":"The success of deep learning in numerous application domains created the de- sire to run and train them on mobile devices. This however, conflicts with their computationally, memory and energy intense nature, leading to a growing interest in compression. Recent work by Han et al. (2015a) propose a pipeline that involves retraining, pruning and quantization of neural network weights, obtaining state-of-the-art compression rates. In this paper, we show that competitive compression rates can be achieved by using a version of soft weight-sharing (Nowlan & Hinton, 1992). Our method achieves both qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04008","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":"1702.04008","created_at":"2026-05-18T00:44:51.586534+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04008v2","created_at":"2026-05-18T00:44:51.586534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04008","created_at":"2026-05-18T00:44:51.586534+00:00"},{"alias_kind":"pith_short_12","alias_value":"3756NG4PQN6E","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3756NG4PQN6EPK2E","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3756NG4P","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.17469","citing_title":"Efficient compression of neural networks and datasets","ref_index":67,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3756NG4PQN6EPK2EPTZJ2FAHQE","json":"https://pith.science/pith/3756NG4PQN6EPK2EPTZJ2FAHQE.json","graph_json":"https://pith.science/api/pith-number/3756NG4PQN6EPK2EPTZJ2FAHQE/graph.json","events_json":"https://pith.science/api/pith-number/3756NG4PQN6EPK2EPTZJ2FAHQE/events.json","paper":"https://pith.science/paper/3756NG4P"},"agent_actions":{"view_html":"https://pith.science/pith/3756NG4PQN6EPK2EPTZJ2FAHQE","download_json":"https://pith.science/pith/3756NG4PQN6EPK2EPTZJ2FAHQE.json","view_paper":"https://pith.science/paper/3756NG4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04008&json=true","fetch_graph":"https://pith.science/api/pith-number/3756NG4PQN6EPK2EPTZJ2FAHQE/graph.json","fetch_events":"https://pith.science/api/pith-number/3756NG4PQN6EPK2EPTZJ2FAHQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3756NG4PQN6EPK2EPTZJ2FAHQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3756NG4PQN6EPK2EPTZJ2FAHQE/action/storage_attestation","attest_author":"https://pith.science/pith/3756NG4PQN6EPK2EPTZJ2FAHQE/action/author_attestation","sign_citation":"https://pith.science/pith/3756NG4PQN6EPK2EPTZJ2FAHQE/action/citation_signature","submit_replication":"https://pith.science/pith/3756NG4PQN6EPK2EPTZJ2FAHQE/action/replication_record"}},"created_at":"2026-05-18T00:44:51.586534+00:00","updated_at":"2026-05-18T00:44:51.586534+00:00"}