{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:P52PUBAZWC7HGWFBVHVRPLREU5","short_pith_number":"pith:P52PUBAZ","schema_version":"1.0","canonical_sha256":"7f74fa0419b0be7358a1a9eb17ae24a7483e628c8970915e282f4c2fea6ca8d8","source":{"kind":"arxiv","id":"1908.03463","version":1},"attestation_state":"computed","paper":{"title":"Group Pruning using a Bounded-Lp norm for Group Gating and Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chaithanya Kumar Mummadi, Dan Zhang, Thomas Brox, Tim Genewein, Volker Fischer","submitted_at":"2019-08-09T14:08:35Z","abstract_excerpt":"Deep neural networks achieve state-of-the-art results on several tasks while increasing in complexity. It has been shown that neural networks can be pruned during training by imposing sparsity inducing regularizers. In this paper, we investigate two techniques for group-wise pruning during training in order to improve network efficiency. We propose a gating factor after every convolutional layer to induce channel level sparsity, encouraging insignificant channels to become exactly zero. Further, we introduce and analyse a bounded variant of the L1 regularizer, which interpolates between L1 and"},"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":"1908.03463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-08-09T14:08:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3e1300062247994ce6c68dbe47eb544f808a631029dbfeb8ef25cf47aaed5cb5","abstract_canon_sha256":"c3455bd77cf699924461db691f4f78ba3c3db2e956eb4f9f1ec45fef35331524"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:40.164152Z","signature_b64":"IbQ8Jp8pV7X3MrnFaV6waPVaYho4zbSP+npPA/6avXv95xhYdoeuy3Pq9sHIa4lRjlcFI5KeDn7V/NfdGVtSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f74fa0419b0be7358a1a9eb17ae24a7483e628c8970915e282f4c2fea6ca8d8","last_reissued_at":"2026-07-04T23:52:40.163737Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:40.163737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group Pruning using a Bounded-Lp norm for Group Gating and Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chaithanya Kumar Mummadi, Dan Zhang, Thomas Brox, Tim Genewein, Volker Fischer","submitted_at":"2019-08-09T14:08:35Z","abstract_excerpt":"Deep neural networks achieve state-of-the-art results on several tasks while increasing in complexity. It has been shown that neural networks can be pruned during training by imposing sparsity inducing regularizers. In this paper, we investigate two techniques for group-wise pruning during training in order to improve network efficiency. We propose a gating factor after every convolutional layer to induce channel level sparsity, encouraging insignificant channels to become exactly zero. Further, we introduce and analyse a bounded variant of the L1 regularizer, which interpolates between L1 and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03463","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/1908.03463/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":"1908.03463","created_at":"2026-07-04T23:52:40.163791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03463v1","created_at":"2026-07-04T23:52:40.163791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03463","created_at":"2026-07-04T23:52:40.163791+00:00"},{"alias_kind":"pith_short_12","alias_value":"P52PUBAZWC7H","created_at":"2026-07-04T23:52:40.163791+00:00"},{"alias_kind":"pith_short_16","alias_value":"P52PUBAZWC7HGWFB","created_at":"2026-07-04T23:52:40.163791+00:00"},{"alias_kind":"pith_short_8","alias_value":"P52PUBAZ","created_at":"2026-07-04T23:52:40.163791+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/P52PUBAZWC7HGWFBVHVRPLREU5","json":"https://pith.science/pith/P52PUBAZWC7HGWFBVHVRPLREU5.json","graph_json":"https://pith.science/api/pith-number/P52PUBAZWC7HGWFBVHVRPLREU5/graph.json","events_json":"https://pith.science/api/pith-number/P52PUBAZWC7HGWFBVHVRPLREU5/events.json","paper":"https://pith.science/paper/P52PUBAZ"},"agent_actions":{"view_html":"https://pith.science/pith/P52PUBAZWC7HGWFBVHVRPLREU5","download_json":"https://pith.science/pith/P52PUBAZWC7HGWFBVHVRPLREU5.json","view_paper":"https://pith.science/paper/P52PUBAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03463&json=true","fetch_graph":"https://pith.science/api/pith-number/P52PUBAZWC7HGWFBVHVRPLREU5/graph.json","fetch_events":"https://pith.science/api/pith-number/P52PUBAZWC7HGWFBVHVRPLREU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P52PUBAZWC7HGWFBVHVRPLREU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P52PUBAZWC7HGWFBVHVRPLREU5/action/storage_attestation","attest_author":"https://pith.science/pith/P52PUBAZWC7HGWFBVHVRPLREU5/action/author_attestation","sign_citation":"https://pith.science/pith/P52PUBAZWC7HGWFBVHVRPLREU5/action/citation_signature","submit_replication":"https://pith.science/pith/P52PUBAZWC7HGWFBVHVRPLREU5/action/replication_record"}},"created_at":"2026-07-04T23:52:40.163791+00:00","updated_at":"2026-07-04T23:52:40.163791+00:00"}