{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RJP6CA5BQGQRXWLFC5W7IFA4BY","short_pith_number":"pith:RJP6CA5B","schema_version":"1.0","canonical_sha256":"8a5fe103a181a11bd965176df4141c0e012206ff0d1c8d6a7dc9f331d060fd5f","source":{"kind":"arxiv","id":"1811.00250","version":3},"attestation_state":"computed","paper":{"title":"Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ping Liu, Yang He, Yi Yang, Zhilan Hu, Ziwei Wang","submitted_at":"2018-11-01T06:03:05Z","abstract_excerpt":"Previous works utilized ''smaller-norm-less-important'' criterion to prune filters with smaller norm values in a convolutional neural network. In this paper, we analyze this norm-based criterion and point out that its effectiveness depends on two requirements that are not always met: (1) the norm deviation of the filters should be large; (2) the minimum norm of the filters should be small. To solve this problem, we propose a novel filter pruning method, namely Filter Pruning via Geometric Median (FPGM), to compress the model regardless of those two requirements. Unlike previous methods, FPGM c"},"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":"1811.00250","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-01T06:03:05Z","cross_cats_sorted":[],"title_canon_sha256":"8bdb6ff75116a700b47c391e000d340ba9f922f437dc0758f16de8845ecdd702","abstract_canon_sha256":"b9a1f82e91936c3835f9680de52edb0d02f394315e0cbf8727576f7240227e91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:41.453276Z","signature_b64":"zk3mvYYSbQ3SodeJYXepIKXep78+At9D+2zqZqXTjhWdYcZobWhsCkiYDhXbwouBBD71l4ZAr2Aj3sqtB9u6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a5fe103a181a11bd965176df4141c0e012206ff0d1c8d6a7dc9f331d060fd5f","last_reissued_at":"2026-05-17T23:40:41.452691Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:41.452691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ping Liu, Yang He, Yi Yang, Zhilan Hu, Ziwei Wang","submitted_at":"2018-11-01T06:03:05Z","abstract_excerpt":"Previous works utilized ''smaller-norm-less-important'' criterion to prune filters with smaller norm values in a convolutional neural network. In this paper, we analyze this norm-based criterion and point out that its effectiveness depends on two requirements that are not always met: (1) the norm deviation of the filters should be large; (2) the minimum norm of the filters should be small. To solve this problem, we propose a novel filter pruning method, namely Filter Pruning via Geometric Median (FPGM), to compress the model regardless of those two requirements. Unlike previous methods, FPGM c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00250","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":""},"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":"1811.00250","created_at":"2026-05-17T23:40:41.452793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.00250v3","created_at":"2026-05-17T23:40:41.452793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00250","created_at":"2026-05-17T23:40:41.452793+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJP6CA5BQGQR","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJP6CA5BQGQRXWLF","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJP6CA5B","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"1906.10337","citing_title":"COP: Customized Deep Model Compression via Regularized Correlation-Based Filter-Level Pruning","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"1907.00593","citing_title":"Weight Normalization based Quantization for Deep Neural Network Compression","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"1907.06572","citing_title":"Deep network as memory space: complexity, generalization, disentangled representation and interpretability","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2510.09696","citing_title":"Vanishing Contributions: A Unified Framework for Smooth and Iterative Model Compression","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RJP6CA5BQGQRXWLFC5W7IFA4BY","json":"https://pith.science/pith/RJP6CA5BQGQRXWLFC5W7IFA4BY.json","graph_json":"https://pith.science/api/pith-number/RJP6CA5BQGQRXWLFC5W7IFA4BY/graph.json","events_json":"https://pith.science/api/pith-number/RJP6CA5BQGQRXWLFC5W7IFA4BY/events.json","paper":"https://pith.science/paper/RJP6CA5B"},"agent_actions":{"view_html":"https://pith.science/pith/RJP6CA5BQGQRXWLFC5W7IFA4BY","download_json":"https://pith.science/pith/RJP6CA5BQGQRXWLFC5W7IFA4BY.json","view_paper":"https://pith.science/paper/RJP6CA5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.00250&json=true","fetch_graph":"https://pith.science/api/pith-number/RJP6CA5BQGQRXWLFC5W7IFA4BY/graph.json","fetch_events":"https://pith.science/api/pith-number/RJP6CA5BQGQRXWLFC5W7IFA4BY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJP6CA5BQGQRXWLFC5W7IFA4BY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJP6CA5BQGQRXWLFC5W7IFA4BY/action/storage_attestation","attest_author":"https://pith.science/pith/RJP6CA5BQGQRXWLFC5W7IFA4BY/action/author_attestation","sign_citation":"https://pith.science/pith/RJP6CA5BQGQRXWLFC5W7IFA4BY/action/citation_signature","submit_replication":"https://pith.science/pith/RJP6CA5BQGQRXWLFC5W7IFA4BY/action/replication_record"}},"created_at":"2026-05-17T23:40:41.452793+00:00","updated_at":"2026-05-17T23:40:41.452793+00:00"}