{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DBK3MF72QP3JYF7V4Z3Q75A4K6","short_pith_number":"pith:DBK3MF72","schema_version":"1.0","canonical_sha256":"1855b617fa83f69c17f5e6770ff41c57b905ec993c5cb6e07f45f83ff15d0f2a","source":{"kind":"arxiv","id":"1503.05479","version":2},"attestation_state":"computed","paper":{"title":"Interpolating Convex and Non-Convex Tensor Decompositions via the Subspace Norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Qinqing Zheng, Ryota Tomioka","submitted_at":"2015-03-18T16:45:04Z","abstract_excerpt":"We consider the problem of recovering a low-rank tensor from its noisy observation. Previous work has shown a recovery guarantee with signal to noise ratio $O(n^{\\lceil K/2 \\rceil /2})$ for recovering a $K$th order rank one tensor of size $n\\times \\cdots \\times n$ by recursive unfolding. In this paper, we first improve this bound to $O(n^{K/4})$ by a much simpler approach, but with a more careful analysis. Then we propose a new norm called the subspace norm, which is based on the Kronecker products of factors obtained by the proposed simple estimator. The imposed Kronecker structure allows us "},"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":"1503.05479","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-18T16:45:04Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"30ba9cc29718403a39886e837b63185722e960da097ecfaeaca6749185404b5a","abstract_canon_sha256":"08ff6942d2c4c3ec9a7e4898919cc8bb23249f68e9cb8fd979ed5649d2610d9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:13.344905Z","signature_b64":"c56lA/yHJwbLijqA7Mgs98EK7KlZdxNPks7yTRgW7gCzH+xNOKJpTfVXfrYJ17O3/OO4oqNAgfqNkHCsj8QAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1855b617fa83f69c17f5e6770ff41c57b905ec993c5cb6e07f45f83ff15d0f2a","last_reissued_at":"2026-05-18T01:29:13.344304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:13.344304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interpolating Convex and Non-Convex Tensor Decompositions via the Subspace Norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Qinqing Zheng, Ryota Tomioka","submitted_at":"2015-03-18T16:45:04Z","abstract_excerpt":"We consider the problem of recovering a low-rank tensor from its noisy observation. Previous work has shown a recovery guarantee with signal to noise ratio $O(n^{\\lceil K/2 \\rceil /2})$ for recovering a $K$th order rank one tensor of size $n\\times \\cdots \\times n$ by recursive unfolding. In this paper, we first improve this bound to $O(n^{K/4})$ by a much simpler approach, but with a more careful analysis. Then we propose a new norm called the subspace norm, which is based on the Kronecker products of factors obtained by the proposed simple estimator. The imposed Kronecker structure allows us "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05479","kind":"arxiv","version":2},"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":"1503.05479","created_at":"2026-05-18T01:29:13.344409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05479v2","created_at":"2026-05-18T01:29:13.344409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05479","created_at":"2026-05-18T01:29:13.344409+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBK3MF72QP3J","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBK3MF72QP3JYF7V","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBK3MF72","created_at":"2026-05-18T12:29:17.054201+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/DBK3MF72QP3JYF7V4Z3Q75A4K6","json":"https://pith.science/pith/DBK3MF72QP3JYF7V4Z3Q75A4K6.json","graph_json":"https://pith.science/api/pith-number/DBK3MF72QP3JYF7V4Z3Q75A4K6/graph.json","events_json":"https://pith.science/api/pith-number/DBK3MF72QP3JYF7V4Z3Q75A4K6/events.json","paper":"https://pith.science/paper/DBK3MF72"},"agent_actions":{"view_html":"https://pith.science/pith/DBK3MF72QP3JYF7V4Z3Q75A4K6","download_json":"https://pith.science/pith/DBK3MF72QP3JYF7V4Z3Q75A4K6.json","view_paper":"https://pith.science/paper/DBK3MF72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05479&json=true","fetch_graph":"https://pith.science/api/pith-number/DBK3MF72QP3JYF7V4Z3Q75A4K6/graph.json","fetch_events":"https://pith.science/api/pith-number/DBK3MF72QP3JYF7V4Z3Q75A4K6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBK3MF72QP3JYF7V4Z3Q75A4K6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBK3MF72QP3JYF7V4Z3Q75A4K6/action/storage_attestation","attest_author":"https://pith.science/pith/DBK3MF72QP3JYF7V4Z3Q75A4K6/action/author_attestation","sign_citation":"https://pith.science/pith/DBK3MF72QP3JYF7V4Z3Q75A4K6/action/citation_signature","submit_replication":"https://pith.science/pith/DBK3MF72QP3JYF7V4Z3Q75A4K6/action/replication_record"}},"created_at":"2026-05-18T01:29:13.344409+00:00","updated_at":"2026-05-18T01:29:13.344409+00:00"}