{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SR6B7KZ4XGYG6HTHICIW5QGTBW","short_pith_number":"pith:SR6B7KZ4","schema_version":"1.0","canonical_sha256":"947c1fab3cb9b06f1e6740916ec0d30d88f429c25ee629cf9a718ed3ab3fc380","source":{"kind":"arxiv","id":"1805.06523","version":1},"attestation_state":"computed","paper":{"title":"End-to-end Learning of a Convolutional Neural Network via Deep Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mahdi Soltanolkotabi, Samet Oymak","submitted_at":"2018-05-16T20:53:21Z","abstract_excerpt":"In this paper we study the problem of learning the weights of a deep convolutional neural network. We consider a network where convolutions are carried out over non-overlapping patches with a single kernel in each layer. We develop an algorithm for simultaneously learning all the kernels from the training data. Our approach dubbed Deep Tensor Decomposition (DeepTD) is based on a rank-1 tensor decomposition. We theoretically investigate DeepTD under a realizable model for the training data where the inputs are chosen i.i.d. from a Gaussian distribution and the labels are generated according to "},"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":"1805.06523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-16T20:53:21Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"bbd11eb8028fa6668bdc300937688d5930f1902d585a76fa4ac66f597a728039","abstract_canon_sha256":"3b07046f44bdfd811a293afa2499ced0335ddaa031cc405d87be244d6a888d27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:44.176476Z","signature_b64":"h3BUsskrCe2umgMVn+G32v0j5eCg4R/XK21uiya5t8HU2aiMPCDiyJFChPfKNvaxYiMZMqk2vF8tCLka3Yp9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"947c1fab3cb9b06f1e6740916ec0d30d88f429c25ee629cf9a718ed3ab3fc380","last_reissued_at":"2026-05-18T00:15:44.175806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:44.175806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-end Learning of a Convolutional Neural Network via Deep Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mahdi Soltanolkotabi, Samet Oymak","submitted_at":"2018-05-16T20:53:21Z","abstract_excerpt":"In this paper we study the problem of learning the weights of a deep convolutional neural network. We consider a network where convolutions are carried out over non-overlapping patches with a single kernel in each layer. We develop an algorithm for simultaneously learning all the kernels from the training data. Our approach dubbed Deep Tensor Decomposition (DeepTD) is based on a rank-1 tensor decomposition. We theoretically investigate DeepTD under a realizable model for the training data where the inputs are chosen i.i.d. from a Gaussian distribution and the labels are generated according to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06523","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":"1805.06523","created_at":"2026-05-18T00:15:44.175923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06523v1","created_at":"2026-05-18T00:15:44.175923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06523","created_at":"2026-05-18T00:15:44.175923+00:00"},{"alias_kind":"pith_short_12","alias_value":"SR6B7KZ4XGYG","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SR6B7KZ4XGYG6HTH","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SR6B7KZ4","created_at":"2026-05-18T12:32:53.628368+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/SR6B7KZ4XGYG6HTHICIW5QGTBW","json":"https://pith.science/pith/SR6B7KZ4XGYG6HTHICIW5QGTBW.json","graph_json":"https://pith.science/api/pith-number/SR6B7KZ4XGYG6HTHICIW5QGTBW/graph.json","events_json":"https://pith.science/api/pith-number/SR6B7KZ4XGYG6HTHICIW5QGTBW/events.json","paper":"https://pith.science/paper/SR6B7KZ4"},"agent_actions":{"view_html":"https://pith.science/pith/SR6B7KZ4XGYG6HTHICIW5QGTBW","download_json":"https://pith.science/pith/SR6B7KZ4XGYG6HTHICIW5QGTBW.json","view_paper":"https://pith.science/paper/SR6B7KZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06523&json=true","fetch_graph":"https://pith.science/api/pith-number/SR6B7KZ4XGYG6HTHICIW5QGTBW/graph.json","fetch_events":"https://pith.science/api/pith-number/SR6B7KZ4XGYG6HTHICIW5QGTBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SR6B7KZ4XGYG6HTHICIW5QGTBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SR6B7KZ4XGYG6HTHICIW5QGTBW/action/storage_attestation","attest_author":"https://pith.science/pith/SR6B7KZ4XGYG6HTHICIW5QGTBW/action/author_attestation","sign_citation":"https://pith.science/pith/SR6B7KZ4XGYG6HTHICIW5QGTBW/action/citation_signature","submit_replication":"https://pith.science/pith/SR6B7KZ4XGYG6HTHICIW5QGTBW/action/replication_record"}},"created_at":"2026-05-18T00:15:44.175923+00:00","updated_at":"2026-05-18T00:15:44.175923+00:00"}