{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SJNF44F6YR4NP7Y227I6SAYLTT","short_pith_number":"pith:SJNF44F6","schema_version":"1.0","canonical_sha256":"925a5e70bec478d7ff1ad7d1e9030b9ce29e190cd936c3679de5a15697fd17e4","source":{"kind":"arxiv","id":"2203.06031","version":1},"attestation_state":"computed","paper":{"title":"Exploiting Low-Rank Tensor-Train Deep Neural Networks Based on Riemannian Gradient Descent With Illustrations of Speech Processing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.SD","eess.AS"],"primary_cat":"cs.LG","authors_text":"Chao-Han Huck Yang, Javier Tejedor, Jun Qi, Pin-Yu Chen","submitted_at":"2022-03-11T15:55:34Z","abstract_excerpt":"This work focuses on designing low complexity hybrid tensor networks by considering trade-offs between the model complexity and practical performance. Firstly, we exploit a low-rank tensor-train deep neural network (TT-DNN) to build an end-to-end deep learning pipeline, namely LR-TT-DNN. Secondly, a hybrid model combining LR-TT-DNN with a convolutional neural network (CNN), which is denoted as CNN+(LR-TT-DNN), is set up to boost the performance. Instead of randomly assigning large TT-ranks for TT-DNN, we leverage Riemannian gradient descent to determine a TT-DNN associated with small TT-ranks."},"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":"2203.06031","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-11T15:55:34Z","cross_cats_sorted":["cs.AI","cs.SD","eess.AS"],"title_canon_sha256":"d63e44c35c909585fad6c19897284400ee08b36b67d03550006793d4387c8b8b","abstract_canon_sha256":"816c53010384d327c5ae5f60619dd17a259e713ff62a0be7600742b4938a7657"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:04:12.083467Z","signature_b64":"4CZROedLbtj5UxKBfws1znqqFScWr86DFcRGn8d/cBRUFB27vw4rpfZOz2Bm/gLHCG/joaoAf9FE259Kvq4hDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"925a5e70bec478d7ff1ad7d1e9030b9ce29e190cd936c3679de5a15697fd17e4","last_reissued_at":"2026-07-05T04:04:12.083020Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:04:12.083020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Low-Rank Tensor-Train Deep Neural Networks Based on Riemannian Gradient Descent With Illustrations of Speech Processing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.SD","eess.AS"],"primary_cat":"cs.LG","authors_text":"Chao-Han Huck Yang, Javier Tejedor, Jun Qi, Pin-Yu Chen","submitted_at":"2022-03-11T15:55:34Z","abstract_excerpt":"This work focuses on designing low complexity hybrid tensor networks by considering trade-offs between the model complexity and practical performance. Firstly, we exploit a low-rank tensor-train deep neural network (TT-DNN) to build an end-to-end deep learning pipeline, namely LR-TT-DNN. Secondly, a hybrid model combining LR-TT-DNN with a convolutional neural network (CNN), which is denoted as CNN+(LR-TT-DNN), is set up to boost the performance. Instead of randomly assigning large TT-ranks for TT-DNN, we leverage Riemannian gradient descent to determine a TT-DNN associated with small TT-ranks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.06031","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/2203.06031/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":"2203.06031","created_at":"2026-07-05T04:04:12.083083+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.06031v1","created_at":"2026-07-05T04:04:12.083083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.06031","created_at":"2026-07-05T04:04:12.083083+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJNF44F6YR4N","created_at":"2026-07-05T04:04:12.083083+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJNF44F6YR4NP7Y2","created_at":"2026-07-05T04:04:12.083083+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJNF44F6","created_at":"2026-07-05T04:04:12.083083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2309.06577","citing_title":"Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SJNF44F6YR4NP7Y227I6SAYLTT","json":"https://pith.science/pith/SJNF44F6YR4NP7Y227I6SAYLTT.json","graph_json":"https://pith.science/api/pith-number/SJNF44F6YR4NP7Y227I6SAYLTT/graph.json","events_json":"https://pith.science/api/pith-number/SJNF44F6YR4NP7Y227I6SAYLTT/events.json","paper":"https://pith.science/paper/SJNF44F6"},"agent_actions":{"view_html":"https://pith.science/pith/SJNF44F6YR4NP7Y227I6SAYLTT","download_json":"https://pith.science/pith/SJNF44F6YR4NP7Y227I6SAYLTT.json","view_paper":"https://pith.science/paper/SJNF44F6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.06031&json=true","fetch_graph":"https://pith.science/api/pith-number/SJNF44F6YR4NP7Y227I6SAYLTT/graph.json","fetch_events":"https://pith.science/api/pith-number/SJNF44F6YR4NP7Y227I6SAYLTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJNF44F6YR4NP7Y227I6SAYLTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJNF44F6YR4NP7Y227I6SAYLTT/action/storage_attestation","attest_author":"https://pith.science/pith/SJNF44F6YR4NP7Y227I6SAYLTT/action/author_attestation","sign_citation":"https://pith.science/pith/SJNF44F6YR4NP7Y227I6SAYLTT/action/citation_signature","submit_replication":"https://pith.science/pith/SJNF44F6YR4NP7Y227I6SAYLTT/action/replication_record"}},"created_at":"2026-07-05T04:04:12.083083+00:00","updated_at":"2026-07-05T04:04:12.083083+00:00"}