{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EAIILGGS4KT44COSGDCAPFUJB3","short_pith_number":"pith:EAIILGGS","schema_version":"1.0","canonical_sha256":"20108598d2e2a7ce09d230c40796890ee7ab40ea418957a09fb30b6c23e6f506","source":{"kind":"arxiv","id":"1910.04576","version":4},"attestation_state":"computed","paper":{"title":"Trained Rank Pruning for Efficient Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Botao Wang, Hongkai Xiong, Shuai Zhang, Wei Wen, Weiyao Lin, Wenrui Dai, Yingyong Qi, Yiran Chen, Yuhui Xu, Yuxi Li","submitted_at":"2019-10-09T07:27:33Z","abstract_excerpt":"To accelerate DNNs inference, low-rank approximation has been widely adopted because of its solid theoretical rationale and efficient implementations. Several previous works attempted to directly approximate a pre-trained model by low-rank decomposition; however, small approximation errors in parameters can ripple over a large prediction loss. Apparently, it is not optimal to separate low-rank approximation from training. Unlike previous works, this paper integrates low rank approximation and regularization into the training process. We propose Trained Rank Pruning (TRP), which alternates betw"},"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":"1910.04576","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-10-09T07:27:33Z","cross_cats_sorted":[],"title_canon_sha256":"d8a6eb18d9a7cfe7567702cec40222f6ddf01392028de7e4c709585968bf0350","abstract_canon_sha256":"302ab2f27e3ba8b519380762860918d14a7567ce5bfd4101e2681d6a5468f9f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:35:33.770235Z","signature_b64":"OmBz+EIVfEpA8iCfJZulLX2xFmgg14u7T6OZEj0M/sD20MRaMi4+uu7YnmuOGLjGL3JI6ot9iO5wfSRyJmsRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20108598d2e2a7ce09d230c40796890ee7ab40ea418957a09fb30b6c23e6f506","last_reissued_at":"2026-07-05T00:35:33.769849Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:35:33.769849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trained Rank Pruning for Efficient Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Botao Wang, Hongkai Xiong, Shuai Zhang, Wei Wen, Weiyao Lin, Wenrui Dai, Yingyong Qi, Yiran Chen, Yuhui Xu, Yuxi Li","submitted_at":"2019-10-09T07:27:33Z","abstract_excerpt":"To accelerate DNNs inference, low-rank approximation has been widely adopted because of its solid theoretical rationale and efficient implementations. Several previous works attempted to directly approximate a pre-trained model by low-rank decomposition; however, small approximation errors in parameters can ripple over a large prediction loss. Apparently, it is not optimal to separate low-rank approximation from training. Unlike previous works, this paper integrates low rank approximation and regularization into the training process. We propose Trained Rank Pruning (TRP), which alternates betw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.04576","kind":"arxiv","version":4},"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/1910.04576/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":"1910.04576","created_at":"2026-07-05T00:35:33.769897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.04576v4","created_at":"2026-07-05T00:35:33.769897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.04576","created_at":"2026-07-05T00:35:33.769897+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAIILGGS4KT4","created_at":"2026-07-05T00:35:33.769897+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAIILGGS4KT44COS","created_at":"2026-07-05T00:35:33.769897+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAIILGGS","created_at":"2026-07-05T00:35:33.769897+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/EAIILGGS4KT44COSGDCAPFUJB3","json":"https://pith.science/pith/EAIILGGS4KT44COSGDCAPFUJB3.json","graph_json":"https://pith.science/api/pith-number/EAIILGGS4KT44COSGDCAPFUJB3/graph.json","events_json":"https://pith.science/api/pith-number/EAIILGGS4KT44COSGDCAPFUJB3/events.json","paper":"https://pith.science/paper/EAIILGGS"},"agent_actions":{"view_html":"https://pith.science/pith/EAIILGGS4KT44COSGDCAPFUJB3","download_json":"https://pith.science/pith/EAIILGGS4KT44COSGDCAPFUJB3.json","view_paper":"https://pith.science/paper/EAIILGGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.04576&json=true","fetch_graph":"https://pith.science/api/pith-number/EAIILGGS4KT44COSGDCAPFUJB3/graph.json","fetch_events":"https://pith.science/api/pith-number/EAIILGGS4KT44COSGDCAPFUJB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAIILGGS4KT44COSGDCAPFUJB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAIILGGS4KT44COSGDCAPFUJB3/action/storage_attestation","attest_author":"https://pith.science/pith/EAIILGGS4KT44COSGDCAPFUJB3/action/author_attestation","sign_citation":"https://pith.science/pith/EAIILGGS4KT44COSGDCAPFUJB3/action/citation_signature","submit_replication":"https://pith.science/pith/EAIILGGS4KT44COSGDCAPFUJB3/action/replication_record"}},"created_at":"2026-07-05T00:35:33.769897+00:00","updated_at":"2026-07-05T00:35:33.769897+00:00"}