{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6AMI5LN2BDCRLMTM5AGJXCSTRH","short_pith_number":"pith:6AMI5LN2","schema_version":"1.0","canonical_sha256":"f0188eadba08c515b26ce80c9b8a5389df97ce49dcab1bdd13c3aebb560f3aa8","source":{"kind":"arxiv","id":"1412.6553","version":3},"attestation_state":"computed","paper":{"title":"Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Ivan Oseledets, Maksim Rakhuba, Vadim Lebedev, Victor Lempitsky, Yaroslav Ganin","submitted_at":"2014-12-19T23:02:43Z","abstract_excerpt":"We propose a simple two-step approach for speeding up convolution layers within large convolutional neural networks based on tensor decomposition and discriminative fine-tuning. Given a layer, we use non-linear least squares to compute a low-rank CP-decomposition of the 4D convolution kernel tensor into a sum of a small number of rank-one tensors. At the second step, this decomposition is used to replace the original convolutional layer with a sequence of four convolutional layers with small kernels. After such replacement, the entire network is fine-tuned on the training data using standard b"},"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":"1412.6553","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-19T23:02:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3bf0278a3a67e05ad2e0c724dfcb10ef8aa48f3bb5c1bda34e4407fceb24c1f8","abstract_canon_sha256":"31cbbf26c49bb37cd7522604938c7dfc076fdf59e3637ab12f0e3baf474e54ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:54.329197Z","signature_b64":"r4J8Qv/WH9apI3h75F2Z5wvcyzd60Mze/2rh8OOVwdNbv9ffEtGzvdlSyLSWHJ/vJ5lP4AqCTLEcSpsQBcIvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0188eadba08c515b26ce80c9b8a5389df97ce49dcab1bdd13c3aebb560f3aa8","last_reissued_at":"2026-05-18T02:17:54.328583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:54.328583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Ivan Oseledets, Maksim Rakhuba, Vadim Lebedev, Victor Lempitsky, Yaroslav Ganin","submitted_at":"2014-12-19T23:02:43Z","abstract_excerpt":"We propose a simple two-step approach for speeding up convolution layers within large convolutional neural networks based on tensor decomposition and discriminative fine-tuning. Given a layer, we use non-linear least squares to compute a low-rank CP-decomposition of the 4D convolution kernel tensor into a sum of a small number of rank-one tensors. At the second step, this decomposition is used to replace the original convolutional layer with a sequence of four convolutional layers with small kernels. After such replacement, the entire network is fine-tuned on the training data using standard b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6553","kind":"arxiv","version":3},"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":"1412.6553","created_at":"2026-05-18T02:17:54.328677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6553v3","created_at":"2026-05-18T02:17:54.328677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6553","created_at":"2026-05-18T02:17:54.328677+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AMI5LN2BDCR","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AMI5LN2BDCRLMTM","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AMI5LN2","created_at":"2026-05-18T12:28:16.859392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"1907.01522","citing_title":"Tucker Tensor Decomposition on FPGA","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2312.05821","citing_title":"ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19842","citing_title":"Fast Tensorization of Neural Networks via Slice-wise Feature Distillation","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2510.09696","citing_title":"Vanishing Contributions: A Unified Framework for Smooth and Iterative Model Compression","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"1704.04861","citing_title":"MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH","json":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH.json","graph_json":"https://pith.science/api/pith-number/6AMI5LN2BDCRLMTM5AGJXCSTRH/graph.json","events_json":"https://pith.science/api/pith-number/6AMI5LN2BDCRLMTM5AGJXCSTRH/events.json","paper":"https://pith.science/paper/6AMI5LN2"},"agent_actions":{"view_html":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH","download_json":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH.json","view_paper":"https://pith.science/paper/6AMI5LN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6553&json=true","fetch_graph":"https://pith.science/api/pith-number/6AMI5LN2BDCRLMTM5AGJXCSTRH/graph.json","fetch_events":"https://pith.science/api/pith-number/6AMI5LN2BDCRLMTM5AGJXCSTRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH/action/storage_attestation","attest_author":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH/action/author_attestation","sign_citation":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH/action/citation_signature","submit_replication":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH/action/replication_record"}},"created_at":"2026-05-18T02:17:54.328677+00:00","updated_at":"2026-05-18T02:17:54.328677+00:00"}