{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2IGN3G53W2ORAKEI2K5WPUIITJ","short_pith_number":"pith:2IGN3G53","schema_version":"1.0","canonical_sha256":"d20cdd9bbbb69d102888d2bb67d1089a6645eef49199c035069e7bb3dc855906","source":{"kind":"arxiv","id":"2310.12688","version":1},"attestation_state":"computed","paper":{"title":"Compression of Recurrent Neural Networks using Matrix Factorization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"H\\'elion du Mas des Bourboux, Lucas Maison, Thomas Courtat","submitted_at":"2023-10-19T12:35:30Z","abstract_excerpt":"Compressing neural networks is a key step when deploying models for real-time or embedded applications. Factorizing the model's matrices using low-rank approximations is a promising method for achieving compression. While it is possible to set the rank before training, this approach is neither flexible nor optimal. In this work, we propose a post-training rank-selection method called Rank-Tuning that selects a different rank for each matrix. Used in combination with training adaptations, our method achieves high compression rates with no or little performance degradation. Our numerical experim"},"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":"2310.12688","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-19T12:35:30Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"66257aea5f8a53afd29fe08dbba67d64925bda51776fc9c97e7302e9e1934312","abstract_canon_sha256":"2ff5751f6cda24b9e5efeb0a419b4178aac99de8f179d21d002ec8418cfc0493"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:02:41.450756Z","signature_b64":"EU3pLQRgz3OYUCnUJ7axZY0yzvATxoTzGHlxX1ac5BNpdzzjJ1KE7La7UvQ3RiUgwmSoj4AYAEh/QiSO/Io+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d20cdd9bbbb69d102888d2bb67d1089a6645eef49199c035069e7bb3dc855906","last_reissued_at":"2026-07-05T07:02:41.450281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:02:41.450281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compression of Recurrent Neural Networks using Matrix Factorization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"H\\'elion du Mas des Bourboux, Lucas Maison, Thomas Courtat","submitted_at":"2023-10-19T12:35:30Z","abstract_excerpt":"Compressing neural networks is a key step when deploying models for real-time or embedded applications. Factorizing the model's matrices using low-rank approximations is a promising method for achieving compression. While it is possible to set the rank before training, this approach is neither flexible nor optimal. In this work, we propose a post-training rank-selection method called Rank-Tuning that selects a different rank for each matrix. Used in combination with training adaptations, our method achieves high compression rates with no or little performance degradation. Our numerical experim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.12688","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/2310.12688/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":"2310.12688","created_at":"2026-07-05T07:02:41.450340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.12688v1","created_at":"2026-07-05T07:02:41.450340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.12688","created_at":"2026-07-05T07:02:41.450340+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IGN3G53W2OR","created_at":"2026-07-05T07:02:41.450340+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IGN3G53W2ORAKEI","created_at":"2026-07-05T07:02:41.450340+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IGN3G53","created_at":"2026-07-05T07:02:41.450340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.09428","citing_title":"On Information Geometry and Iterative Optimization in Model Compression: Operator Factorization","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2IGN3G53W2ORAKEI2K5WPUIITJ","json":"https://pith.science/pith/2IGN3G53W2ORAKEI2K5WPUIITJ.json","graph_json":"https://pith.science/api/pith-number/2IGN3G53W2ORAKEI2K5WPUIITJ/graph.json","events_json":"https://pith.science/api/pith-number/2IGN3G53W2ORAKEI2K5WPUIITJ/events.json","paper":"https://pith.science/paper/2IGN3G53"},"agent_actions":{"view_html":"https://pith.science/pith/2IGN3G53W2ORAKEI2K5WPUIITJ","download_json":"https://pith.science/pith/2IGN3G53W2ORAKEI2K5WPUIITJ.json","view_paper":"https://pith.science/paper/2IGN3G53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.12688&json=true","fetch_graph":"https://pith.science/api/pith-number/2IGN3G53W2ORAKEI2K5WPUIITJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2IGN3G53W2ORAKEI2K5WPUIITJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IGN3G53W2ORAKEI2K5WPUIITJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IGN3G53W2ORAKEI2K5WPUIITJ/action/storage_attestation","attest_author":"https://pith.science/pith/2IGN3G53W2ORAKEI2K5WPUIITJ/action/author_attestation","sign_citation":"https://pith.science/pith/2IGN3G53W2ORAKEI2K5WPUIITJ/action/citation_signature","submit_replication":"https://pith.science/pith/2IGN3G53W2ORAKEI2K5WPUIITJ/action/replication_record"}},"created_at":"2026-07-05T07:02:41.450340+00:00","updated_at":"2026-07-05T07:02:41.450340+00:00"}