{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P25KA4X336PCBQ672DRCNBMLZJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f7781292140e962ec79cafc1e9e2618dd054e856966ffb18ba45bab767eaacee","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-03T17:49:02Z","title_canon_sha256":"aacb20c1995f06bdaca476725172643bf18a93d2176224c3d7fe00ea52cb6000"},"schema_version":"1.0","source":{"id":"1704.00708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00708","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00708v1","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00708","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"P25KA4X336PC","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P25KA4X336PCBQ67","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P25KA4X3","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:025a96275b65c7e07132201b2cc07eb3554c4e222484f5c9e1690cfdb90add3d","target":"graph","created_at":"2026-05-18T00:47:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we develop a new framework that captures the common landscape underlying the common non-convex low-rank matrix problems including matrix sensing, matrix completion and robust PCA. In particular, we show for all above problems (including asymmetric cases): 1) all local minima are also globally optimal; 2) no high-order saddle points exists. These results explain why simple algorithms such as stochastic gradient descent have global converge, and efficiently optimize these non-convex objective functions in practice. Our framework connects and simplifies the existing analyses on opti","authors_text":"Chi Jin, Rong Ge, Yi Zheng","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-03T17:49:02Z","title":"No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00708","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:117e0034accbceeb0748e63efc940bda2bea99ab4c6be8147b34c97424c9b0a3","target":"record","created_at":"2026-05-18T00:47:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f7781292140e962ec79cafc1e9e2618dd054e856966ffb18ba45bab767eaacee","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-03T17:49:02Z","title_canon_sha256":"aacb20c1995f06bdaca476725172643bf18a93d2176224c3d7fe00ea52cb6000"},"schema_version":"1.0","source":{"id":"1704.00708","kind":"arxiv","version":1}},"canonical_sha256":"7ebaa072fbdf9e20c3dfd0e226858bca765a3ae0d9b84f0acb08da8407669e6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ebaa072fbdf9e20c3dfd0e226858bca765a3ae0d9b84f0acb08da8407669e6c","first_computed_at":"2026-05-18T00:47:21.535953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:21.535953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZQcnhBuVSjvtJypLa6y+BRZb5fh1OecfKADSyJ9eOysZlFYuJZr1gBJHV3k0l4czioQe3qJola1ib+to900eCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:21.536625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:117e0034accbceeb0748e63efc940bda2bea99ab4c6be8147b34c97424c9b0a3","sha256:025a96275b65c7e07132201b2cc07eb3554c4e222484f5c9e1690cfdb90add3d"],"state_sha256":"f692a6ae49ecc0a68e1077d1765bfab5f16a79333a76a8382a6d08024b3c02fb"}