{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FMUA2GBASPLL3M4HQ3M4TNHSQG","short_pith_number":"pith:FMUA2GBA","schema_version":"1.0","canonical_sha256":"2b280d182093d6bdb38786d9c9b4f281b6c4a2443e37830f58f0854f8659bc4e","source":{"kind":"arxiv","id":"1611.10349","version":1},"attestation_state":"computed","paper":{"title":"Non-Convex Projected Gradient Descent for Generalized Low-Rank Tensor Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Garvesh Raskutti, Han Chen, Ming Yuan","submitted_at":"2016-11-30T20:45:23Z","abstract_excerpt":"In this paper, we consider the problem of learning high-dimensional tensor regression problems with low-rank structure. One of the core challenges associated with learning high-dimensional models is computation since the underlying optimization problems are often non-convex. While convex relaxations could lead to polynomial-time algorithms they are often slow in practice. On the other hand, limited theoretical guarantees exist for non-convex methods. In this paper we provide a general framework that provides theoretical guarantees for learning high-dimensional tensor regression models under di"},"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":"1611.10349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-30T20:45:23Z","cross_cats_sorted":[],"title_canon_sha256":"97b3eb9be0f6cca832e4b3ecb5eae995cdf759876c91d05b28d1f85eea35bbae","abstract_canon_sha256":"aad6a95fd5cd160b7dfd73d31e80ed487d7341534913b0a18ef47b1beb76235c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:10.713899Z","signature_b64":"LLpmvXXfxVOECNdBbGV8wrS25x8dIyOsrKUoNOal3uNWYSh0k42/pPZFwqCE0G1TOHoFsTYV4EovbEo4F1A8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b280d182093d6bdb38786d9c9b4f281b6c4a2443e37830f58f0854f8659bc4e","last_reissued_at":"2026-05-18T00:56:10.713461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:10.713461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Convex Projected Gradient Descent for Generalized Low-Rank Tensor Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Garvesh Raskutti, Han Chen, Ming Yuan","submitted_at":"2016-11-30T20:45:23Z","abstract_excerpt":"In this paper, we consider the problem of learning high-dimensional tensor regression problems with low-rank structure. One of the core challenges associated with learning high-dimensional models is computation since the underlying optimization problems are often non-convex. While convex relaxations could lead to polynomial-time algorithms they are often slow in practice. On the other hand, limited theoretical guarantees exist for non-convex methods. In this paper we provide a general framework that provides theoretical guarantees for learning high-dimensional tensor regression models under di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10349","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":"1611.10349","created_at":"2026-05-18T00:56:10.713528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.10349v1","created_at":"2026-05-18T00:56:10.713528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10349","created_at":"2026-05-18T00:56:10.713528+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMUA2GBASPLL","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMUA2GBASPLL3M4H","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMUA2GBA","created_at":"2026-05-18T12:30:15.759754+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/FMUA2GBASPLL3M4HQ3M4TNHSQG","json":"https://pith.science/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG.json","graph_json":"https://pith.science/api/pith-number/FMUA2GBASPLL3M4HQ3M4TNHSQG/graph.json","events_json":"https://pith.science/api/pith-number/FMUA2GBASPLL3M4HQ3M4TNHSQG/events.json","paper":"https://pith.science/paper/FMUA2GBA"},"agent_actions":{"view_html":"https://pith.science/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG","download_json":"https://pith.science/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG.json","view_paper":"https://pith.science/paper/FMUA2GBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.10349&json=true","fetch_graph":"https://pith.science/api/pith-number/FMUA2GBASPLL3M4HQ3M4TNHSQG/graph.json","fetch_events":"https://pith.science/api/pith-number/FMUA2GBASPLL3M4HQ3M4TNHSQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG/action/storage_attestation","attest_author":"https://pith.science/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG/action/author_attestation","sign_citation":"https://pith.science/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG/action/citation_signature","submit_replication":"https://pith.science/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG/action/replication_record"}},"created_at":"2026-05-18T00:56:10.713528+00:00","updated_at":"2026-05-18T00:56:10.713528+00:00"}