{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VOKL55CGGEGTJT7ECQTBAXGCK5","short_pith_number":"pith:VOKL55CG","schema_version":"1.0","canonical_sha256":"ab94bef446310d34cfe41426105cc2575f68a2bacc43fbe7e221a8ad4f6a77c8","source":{"kind":"arxiv","id":"1905.10145","version":1},"attestation_state":"computed","paper":{"title":"Learning Low-Rank Approximation for CNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Byeongwook Kim, Dongsoo Lee, Gu-Yeon Wei, Se Jung Kwon","submitted_at":"2019-05-24T10:56:02Z","abstract_excerpt":"Low-rank approximation is an effective model compression technique to not only reduce parameter storage requirements, but to also reduce computations. For convolutional neural networks (CNNs), however, well-known low-rank approximation methods, such as Tucker or CP decomposition, result in degraded model accuracy because decomposed layers hinder training convergence. In this paper, we propose a new training technique that finds a flat minimum in the view of low-rank approximation without a decomposed structure during training. By preserving the original model structure, 2-dimensional low-rank "},"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":"1905.10145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T10:56:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ca5b20183a15ed84824cd2fb2c496cc145fd9988bb5e9c7bd6095373392dcc39","abstract_canon_sha256":"2a1e5b47de2c0d3df4da45ef0fa96c6caf98c3109302f67d734661f6f1339e08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:11.231778Z","signature_b64":"IWMrrG2NZigbBOyJpPM0fN0+8EeuejFlJp6STU6IymxNT8YMG9SIUCsTQvtcubV0YvmtoylSwQizzkFYLbJvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab94bef446310d34cfe41426105cc2575f68a2bacc43fbe7e221a8ad4f6a77c8","last_reissued_at":"2026-05-17T23:45:11.231251Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:11.231251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Low-Rank Approximation for CNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Byeongwook Kim, Dongsoo Lee, Gu-Yeon Wei, Se Jung Kwon","submitted_at":"2019-05-24T10:56:02Z","abstract_excerpt":"Low-rank approximation is an effective model compression technique to not only reduce parameter storage requirements, but to also reduce computations. For convolutional neural networks (CNNs), however, well-known low-rank approximation methods, such as Tucker or CP decomposition, result in degraded model accuracy because decomposed layers hinder training convergence. In this paper, we propose a new training technique that finds a flat minimum in the view of low-rank approximation without a decomposed structure during training. By preserving the original model structure, 2-dimensional low-rank "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10145","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":""},"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":"1905.10145","created_at":"2026-05-17T23:45:11.231349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10145v1","created_at":"2026-05-17T23:45:11.231349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10145","created_at":"2026-05-17T23:45:11.231349+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOKL55CGGEGT","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOKL55CGGEGTJT7E","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOKL55CG","created_at":"2026-05-18T12:33:30.264802+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/VOKL55CGGEGTJT7ECQTBAXGCK5","json":"https://pith.science/pith/VOKL55CGGEGTJT7ECQTBAXGCK5.json","graph_json":"https://pith.science/api/pith-number/VOKL55CGGEGTJT7ECQTBAXGCK5/graph.json","events_json":"https://pith.science/api/pith-number/VOKL55CGGEGTJT7ECQTBAXGCK5/events.json","paper":"https://pith.science/paper/VOKL55CG"},"agent_actions":{"view_html":"https://pith.science/pith/VOKL55CGGEGTJT7ECQTBAXGCK5","download_json":"https://pith.science/pith/VOKL55CGGEGTJT7ECQTBAXGCK5.json","view_paper":"https://pith.science/paper/VOKL55CG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10145&json=true","fetch_graph":"https://pith.science/api/pith-number/VOKL55CGGEGTJT7ECQTBAXGCK5/graph.json","fetch_events":"https://pith.science/api/pith-number/VOKL55CGGEGTJT7ECQTBAXGCK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOKL55CGGEGTJT7ECQTBAXGCK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOKL55CGGEGTJT7ECQTBAXGCK5/action/storage_attestation","attest_author":"https://pith.science/pith/VOKL55CGGEGTJT7ECQTBAXGCK5/action/author_attestation","sign_citation":"https://pith.science/pith/VOKL55CGGEGTJT7ECQTBAXGCK5/action/citation_signature","submit_replication":"https://pith.science/pith/VOKL55CGGEGTJT7ECQTBAXGCK5/action/replication_record"}},"created_at":"2026-05-17T23:45:11.231349+00:00","updated_at":"2026-05-17T23:45:11.231349+00:00"}