{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:F5JS22K6JBF2MFH3B7YDR4VOMK","short_pith_number":"pith:F5JS22K6","schema_version":"1.0","canonical_sha256":"2f532d695e484ba614fb0ff038f2ae6289f9c523e5d46ca628c2e660aacfddd2","source":{"kind":"arxiv","id":"2205.11921","version":2},"attestation_state":"computed","paper":{"title":"Compression-aware Training of Neural Networks using Frank-Wolfe","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Christoph Spiegel, Max Zimmer, Sebastian Pokutta","submitted_at":"2022-05-24T09:29:02Z","abstract_excerpt":"Many existing Neural Network pruning approaches rely on either retraining or inducing a strong bias in order to converge to a sparse solution throughout training. A third paradigm, 'compression-aware' training, aims to obtain state-of-the-art dense models that are robust to a wide range of compression ratios using a single dense training run while also avoiding retraining. We propose a framework centered around a versatile family of norm constraints and the Stochastic Frank-Wolfe (SFW) algorithm that encourage convergence to well-performing solutions while inducing robustness towards convoluti"},"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":"2205.11921","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-24T09:29:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"dda7901eece7e92bc8bfae603b2f5d1c1d2b518dab2acd92bdf1d6f2477d87ee","abstract_canon_sha256":"4677530c541c2c22ee24fb6d1ebeb2b71ed5b3dc9022fe83eec2ca259b7b48d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:51.292232Z","signature_b64":"q3Ip/afw4EaiGfPzcjPIwN+G70rqlZU2HiU0lYwLyLlHIjXmEuuApdDsd9WE1lr60coqq30EzuqEentslmr8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f532d695e484ba614fb0ff038f2ae6289f9c523e5d46ca628c2e660aacfddd2","last_reissued_at":"2026-07-05T07:44:51.291686Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:51.291686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compression-aware Training of Neural Networks using Frank-Wolfe","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Christoph Spiegel, Max Zimmer, Sebastian Pokutta","submitted_at":"2022-05-24T09:29:02Z","abstract_excerpt":"Many existing Neural Network pruning approaches rely on either retraining or inducing a strong bias in order to converge to a sparse solution throughout training. A third paradigm, 'compression-aware' training, aims to obtain state-of-the-art dense models that are robust to a wide range of compression ratios using a single dense training run while also avoiding retraining. We propose a framework centered around a versatile family of norm constraints and the Stochastic Frank-Wolfe (SFW) algorithm that encourage convergence to well-performing solutions while inducing robustness towards convoluti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.11921","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.11921/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":"2205.11921","created_at":"2026-07-05T07:44:51.291742+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.11921v2","created_at":"2026-07-05T07:44:51.291742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.11921","created_at":"2026-07-05T07:44:51.291742+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5JS22K6JBF2","created_at":"2026-07-05T07:44:51.291742+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5JS22K6JBF2MFH3","created_at":"2026-07-05T07:44:51.291742+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5JS22K6","created_at":"2026-07-05T07:44:51.291742+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08754","citing_title":"SLORR: Simple and Efficient In-Training Low-Rank Regularization","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F5JS22K6JBF2MFH3B7YDR4VOMK","json":"https://pith.science/pith/F5JS22K6JBF2MFH3B7YDR4VOMK.json","graph_json":"https://pith.science/api/pith-number/F5JS22K6JBF2MFH3B7YDR4VOMK/graph.json","events_json":"https://pith.science/api/pith-number/F5JS22K6JBF2MFH3B7YDR4VOMK/events.json","paper":"https://pith.science/paper/F5JS22K6"},"agent_actions":{"view_html":"https://pith.science/pith/F5JS22K6JBF2MFH3B7YDR4VOMK","download_json":"https://pith.science/pith/F5JS22K6JBF2MFH3B7YDR4VOMK.json","view_paper":"https://pith.science/paper/F5JS22K6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.11921&json=true","fetch_graph":"https://pith.science/api/pith-number/F5JS22K6JBF2MFH3B7YDR4VOMK/graph.json","fetch_events":"https://pith.science/api/pith-number/F5JS22K6JBF2MFH3B7YDR4VOMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5JS22K6JBF2MFH3B7YDR4VOMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5JS22K6JBF2MFH3B7YDR4VOMK/action/storage_attestation","attest_author":"https://pith.science/pith/F5JS22K6JBF2MFH3B7YDR4VOMK/action/author_attestation","sign_citation":"https://pith.science/pith/F5JS22K6JBF2MFH3B7YDR4VOMK/action/citation_signature","submit_replication":"https://pith.science/pith/F5JS22K6JBF2MFH3B7YDR4VOMK/action/replication_record"}},"created_at":"2026-07-05T07:44:51.291742+00:00","updated_at":"2026-07-05T07:44:51.291742+00:00"}