{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XHWVSHY2R4MGMZJNRLXMU6JHOL","short_pith_number":"pith:XHWVSHY2","schema_version":"1.0","canonical_sha256":"b9ed591f1a8f1866652d8aeeca792772ce89b9bef540b4a38bbe19ee7c07ba36","source":{"kind":"arxiv","id":"2004.09031","version":1},"attestation_state":"computed","paper":{"title":"Learning Low-rank Deep Neural Networks via Singular Vector Orthogonality Regularization and Singular Value Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ang Li, Daniel Hu, Feng Yan, Hai Li, Huanrui Yang, Minxue Tang, Wei Wen, Yiran Chen","submitted_at":"2020-04-20T02:40:43Z","abstract_excerpt":"Modern deep neural networks (DNNs) often require high memory consumption and large computational loads. In order to deploy DNN algorithms efficiently on edge or mobile devices, a series of DNN compression algorithms have been explored, including factorization methods. Factorization methods approximate the weight matrix of a DNN layer with the multiplication of two or multiple low-rank matrices. However, it is hard to measure the ranks of DNN layers during the training process. Previous works mainly induce low-rank through implicit approximations or via costly singular value decomposition (SVD)"},"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":"2004.09031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-20T02:40:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"388ba92931b4a3b858fce57d4181cc5505bec9b817bf904ee109164a8b1cd91a","abstract_canon_sha256":"7dc079c566ac403b4f0381d1fe3a7c839d2fd844049e5994931d01b4e58f4edb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:56:12.413987Z","signature_b64":"KmEHCuUuLXz766B8cnn9QJ7oupK/i73ePuCtXcD90lw8LeuJRGGSZBAvSPacVHNuh/vybfa3PfPhylxJbTPPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9ed591f1a8f1866652d8aeeca792772ce89b9bef540b4a38bbe19ee7c07ba36","last_reissued_at":"2026-07-05T00:56:12.413505Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:56:12.413505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Low-rank Deep Neural Networks via Singular Vector Orthogonality Regularization and Singular Value Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ang Li, Daniel Hu, Feng Yan, Hai Li, Huanrui Yang, Minxue Tang, Wei Wen, Yiran Chen","submitted_at":"2020-04-20T02:40:43Z","abstract_excerpt":"Modern deep neural networks (DNNs) often require high memory consumption and large computational loads. In order to deploy DNN algorithms efficiently on edge or mobile devices, a series of DNN compression algorithms have been explored, including factorization methods. Factorization methods approximate the weight matrix of a DNN layer with the multiplication of two or multiple low-rank matrices. However, it is hard to measure the ranks of DNN layers during the training process. Previous works mainly induce low-rank through implicit approximations or via costly singular value decomposition (SVD)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.09031","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/2004.09031/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":"2004.09031","created_at":"2026-07-05T00:56:12.413564+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.09031v1","created_at":"2026-07-05T00:56:12.413564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.09031","created_at":"2026-07-05T00:56:12.413564+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHWVSHY2R4MG","created_at":"2026-07-05T00:56:12.413564+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHWVSHY2R4MGMZJN","created_at":"2026-07-05T00:56:12.413564+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHWVSHY2","created_at":"2026-07-05T00:56:12.413564+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08754","citing_title":"SLORR: Simple and Efficient In-Training Low-Rank Regularization","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2606.07098","citing_title":"SigmaScale: LLM Compression with SVD-based Low-Rank Decomposition and Learned Scaling Matrices","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2604.00733","citing_title":"Spectral Compact Training: Pre-Training Large Language Models via Permanent Truncated SVD and Stiefel QR Retraction","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XHWVSHY2R4MGMZJNRLXMU6JHOL","json":"https://pith.science/pith/XHWVSHY2R4MGMZJNRLXMU6JHOL.json","graph_json":"https://pith.science/api/pith-number/XHWVSHY2R4MGMZJNRLXMU6JHOL/graph.json","events_json":"https://pith.science/api/pith-number/XHWVSHY2R4MGMZJNRLXMU6JHOL/events.json","paper":"https://pith.science/paper/XHWVSHY2"},"agent_actions":{"view_html":"https://pith.science/pith/XHWVSHY2R4MGMZJNRLXMU6JHOL","download_json":"https://pith.science/pith/XHWVSHY2R4MGMZJNRLXMU6JHOL.json","view_paper":"https://pith.science/paper/XHWVSHY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.09031&json=true","fetch_graph":"https://pith.science/api/pith-number/XHWVSHY2R4MGMZJNRLXMU6JHOL/graph.json","fetch_events":"https://pith.science/api/pith-number/XHWVSHY2R4MGMZJNRLXMU6JHOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHWVSHY2R4MGMZJNRLXMU6JHOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHWVSHY2R4MGMZJNRLXMU6JHOL/action/storage_attestation","attest_author":"https://pith.science/pith/XHWVSHY2R4MGMZJNRLXMU6JHOL/action/author_attestation","sign_citation":"https://pith.science/pith/XHWVSHY2R4MGMZJNRLXMU6JHOL/action/citation_signature","submit_replication":"https://pith.science/pith/XHWVSHY2R4MGMZJNRLXMU6JHOL/action/replication_record"}},"created_at":"2026-07-05T00:56:12.413564+00:00","updated_at":"2026-07-05T00:56:12.413564+00:00"}