{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:BUPG5XYQCLACMSOVP5OMJY37EW","short_pith_number":"pith:BUPG5XYQ","schema_version":"1.0","canonical_sha256":"0d1e6edf1012c02649d57f5cc4e37f25be4e547f576a37732da931eaf9e12176","source":{"kind":"arxiv","id":"2006.07253","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Model Pruning with Feedback","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniil Dmitriev, Luis Barba, Martin Jaggi, Sebastian U. Stich, Tao Lin","submitted_at":"2020-06-12T15:07:08Z","abstract_excerpt":"Deep neural networks often have millions of parameters. This can hinder their deployment to low-end devices, not only due to high memory requirements but also because of increased latency at inference. We propose a novel model compression method that generates a sparse trained model without additional overhead: by allowing (i) dynamic allocation of the sparsity pattern and (ii) incorporating feedback signal to reactivate prematurely pruned weights we obtain a performant sparse model in one single training pass (retraining is not needed, but can further improve the performance). We evaluate our"},"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":"2006.07253","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-06-12T15:07:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"617aefe6112e32c77041558f6589e26b0db2573cfed3654846799fae4f29aad9","abstract_canon_sha256":"1d7d7d5fdd61d34079afe3d3c57d50a16439501c1cfeefe54c49d5d198a58577"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:53.174893Z","signature_b64":"TBHLxNJUDXbnH+tzrsY8OnpcKjJSaMD0afsWanfjDnIqubS6hErOOAK69Kwj9e1O3pi1YKG8lB3Hb7HtMqv/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d1e6edf1012c02649d57f5cc4e37f25be4e547f576a37732da931eaf9e12176","last_reissued_at":"2026-07-05T01:09:53.174338Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:53.174338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Model Pruning with Feedback","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniil Dmitriev, Luis Barba, Martin Jaggi, Sebastian U. Stich, Tao Lin","submitted_at":"2020-06-12T15:07:08Z","abstract_excerpt":"Deep neural networks often have millions of parameters. This can hinder their deployment to low-end devices, not only due to high memory requirements but also because of increased latency at inference. We propose a novel model compression method that generates a sparse trained model without additional overhead: by allowing (i) dynamic allocation of the sparsity pattern and (ii) incorporating feedback signal to reactivate prematurely pruned weights we obtain a performant sparse model in one single training pass (retraining is not needed, but can further improve the performance). We evaluate our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.07253","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/2006.07253/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":"2006.07253","created_at":"2026-07-05T01:09:53.174398+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.07253v1","created_at":"2026-07-05T01:09:53.174398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.07253","created_at":"2026-07-05T01:09:53.174398+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUPG5XYQCLAC","created_at":"2026-07-05T01:09:53.174398+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUPG5XYQCLACMSOV","created_at":"2026-07-05T01:09:53.174398+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUPG5XYQ","created_at":"2026-07-05T01:09:53.174398+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.07189","citing_title":"Exploring Vision Neural Network Pruning via Screening Methodology","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BUPG5XYQCLACMSOVP5OMJY37EW","json":"https://pith.science/pith/BUPG5XYQCLACMSOVP5OMJY37EW.json","graph_json":"https://pith.science/api/pith-number/BUPG5XYQCLACMSOVP5OMJY37EW/graph.json","events_json":"https://pith.science/api/pith-number/BUPG5XYQCLACMSOVP5OMJY37EW/events.json","paper":"https://pith.science/paper/BUPG5XYQ"},"agent_actions":{"view_html":"https://pith.science/pith/BUPG5XYQCLACMSOVP5OMJY37EW","download_json":"https://pith.science/pith/BUPG5XYQCLACMSOVP5OMJY37EW.json","view_paper":"https://pith.science/paper/BUPG5XYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.07253&json=true","fetch_graph":"https://pith.science/api/pith-number/BUPG5XYQCLACMSOVP5OMJY37EW/graph.json","fetch_events":"https://pith.science/api/pith-number/BUPG5XYQCLACMSOVP5OMJY37EW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUPG5XYQCLACMSOVP5OMJY37EW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUPG5XYQCLACMSOVP5OMJY37EW/action/storage_attestation","attest_author":"https://pith.science/pith/BUPG5XYQCLACMSOVP5OMJY37EW/action/author_attestation","sign_citation":"https://pith.science/pith/BUPG5XYQCLACMSOVP5OMJY37EW/action/citation_signature","submit_replication":"https://pith.science/pith/BUPG5XYQCLACMSOVP5OMJY37EW/action/replication_record"}},"created_at":"2026-07-05T01:09:53.174398+00:00","updated_at":"2026-07-05T01:09:53.174398+00:00"}