{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2UYUGOCRFEWC56Y75U646ZCUPU","short_pith_number":"pith:2UYUGOCR","schema_version":"1.0","canonical_sha256":"d531433851292c2efb1fed3dcf64547d1b630a5cf94dbc40bb4a99cb51021ace","source":{"kind":"arxiv","id":"1507.06149","version":1},"attestation_state":"computed","paper":{"title":"Data-free parameter pruning for Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"R. Venkatesh Babu, Suraj Srinivas","submitted_at":"2015-07-22T12:18:21Z","abstract_excerpt":"Deep Neural nets (NNs) with millions of parameters are at the heart of many state-of-the-art computer vision systems today. However, recent works have shown that much smaller models can achieve similar levels of performance. In this work, we address the problem of pruning parameters in a trained NN model. Instead of removing individual weights one at a time as done in previous works, we remove one neuron at a time. We show how similar neurons are redundant, and propose a systematic way to remove them. Our experiments in pruning the densely connected layers show that we can remove upto 85\\% of "},"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":"1507.06149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-22T12:18:21Z","cross_cats_sorted":[],"title_canon_sha256":"fc6096e2e443c238b824ba595af541da4f6167b8229c1833e66b00bbf3c411d8","abstract_canon_sha256":"1627cd739a50e574c3cb4e386ad11a61857db7f992ad753627a2efa3f39feafc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:26.570636Z","signature_b64":"TgvDSIq7rfQsTM9mHZ8KJJ9USw88aOt//NYV4C/PVcutzFQjWSJ8TqSZ/pNCjf70gtoGLqC7jF9XBgtlsYtQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d531433851292c2efb1fed3dcf64547d1b630a5cf94dbc40bb4a99cb51021ace","last_reissued_at":"2026-05-18T01:36:26.570149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:26.570149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-free parameter pruning for Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"R. Venkatesh Babu, Suraj Srinivas","submitted_at":"2015-07-22T12:18:21Z","abstract_excerpt":"Deep Neural nets (NNs) with millions of parameters are at the heart of many state-of-the-art computer vision systems today. However, recent works have shown that much smaller models can achieve similar levels of performance. In this work, we address the problem of pruning parameters in a trained NN model. Instead of removing individual weights one at a time as done in previous works, we remove one neuron at a time. We show how similar neurons are redundant, and propose a systematic way to remove them. Our experiments in pruning the densely connected layers show that we can remove upto 85\\% of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06149","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":""},"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":"1507.06149","created_at":"2026-05-18T01:36:26.570235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06149v1","created_at":"2026-05-18T01:36:26.570235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06149","created_at":"2026-05-18T01:36:26.570235+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UYUGOCRFEWC","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UYUGOCRFEWC56Y7","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UYUGOCR","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.22767","citing_title":"TELL-TALE: Task Efficient LLMs with Task Aware Layer Elimination","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04569","citing_title":"Lightning Unified Video Editing via In-Context Sparse Attention","ref_index":294,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2UYUGOCRFEWC56Y75U646ZCUPU","json":"https://pith.science/pith/2UYUGOCRFEWC56Y75U646ZCUPU.json","graph_json":"https://pith.science/api/pith-number/2UYUGOCRFEWC56Y75U646ZCUPU/graph.json","events_json":"https://pith.science/api/pith-number/2UYUGOCRFEWC56Y75U646ZCUPU/events.json","paper":"https://pith.science/paper/2UYUGOCR"},"agent_actions":{"view_html":"https://pith.science/pith/2UYUGOCRFEWC56Y75U646ZCUPU","download_json":"https://pith.science/pith/2UYUGOCRFEWC56Y75U646ZCUPU.json","view_paper":"https://pith.science/paper/2UYUGOCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06149&json=true","fetch_graph":"https://pith.science/api/pith-number/2UYUGOCRFEWC56Y75U646ZCUPU/graph.json","fetch_events":"https://pith.science/api/pith-number/2UYUGOCRFEWC56Y75U646ZCUPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UYUGOCRFEWC56Y75U646ZCUPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UYUGOCRFEWC56Y75U646ZCUPU/action/storage_attestation","attest_author":"https://pith.science/pith/2UYUGOCRFEWC56Y75U646ZCUPU/action/author_attestation","sign_citation":"https://pith.science/pith/2UYUGOCRFEWC56Y75U646ZCUPU/action/citation_signature","submit_replication":"https://pith.science/pith/2UYUGOCRFEWC56Y75U646ZCUPU/action/replication_record"}},"created_at":"2026-05-18T01:36:26.570235+00:00","updated_at":"2026-05-18T01:36:26.570235+00:00"}