{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AFTPANDC7BKLYUF5A2ANKPHE5N","short_pith_number":"pith:AFTPANDC","schema_version":"1.0","canonical_sha256":"0166f03462f854bc50bd0680d53ce4eb651c9c0e1b36b3b752d9fb43d0700058","source":{"kind":"arxiv","id":"1802.06286","version":2},"attestation_state":"computed","paper":{"title":"Nonconvex Matrix Factorization from Rank-One Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Cong Ma, Yuanxin Li, Yuejie Chi, Yuxin Chen","submitted_at":"2018-02-17T20:30:47Z","abstract_excerpt":"We consider the problem of recovering low-rank matrices from random rank-one measurements, which spans numerous applications including covariance sketching, phase retrieval, quantum state tomography, and learning shallow polynomial neural networks, among others. Our approach is to directly estimate the low-rank factor by minimizing a nonconvex quadratic loss function via vanilla gradient descent, following a tailored spectral initialization. When the true rank is small, this algorithm is guaranteed to converge to the ground truth (up to global ambiguity) with near-optimal sample complexity and"},"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":"1802.06286","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-17T20:30:47Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"5f4dd89244d5e0e806c1f3f4b8bac2dfc9261fb9f173aa2aa0c03c9c100e3535","abstract_canon_sha256":"5400ba44e357baf7493b648b4be47cf855dcfb36abb1dc93770127db02ba0083"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:27.906519Z","signature_b64":"duC3z4zJlgRqdd/+d0c8VWdNTMyXX91moLcU5teAr+t/irtbpOYYJu4Klkfige1gf2mNEESGaKFHFQzdxb/qDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0166f03462f854bc50bd0680d53ce4eb651c9c0e1b36b3b752d9fb43d0700058","last_reissued_at":"2026-05-17T23:59:27.905822Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:27.905822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonconvex Matrix Factorization from Rank-One Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Cong Ma, Yuanxin Li, Yuejie Chi, Yuxin Chen","submitted_at":"2018-02-17T20:30:47Z","abstract_excerpt":"We consider the problem of recovering low-rank matrices from random rank-one measurements, which spans numerous applications including covariance sketching, phase retrieval, quantum state tomography, and learning shallow polynomial neural networks, among others. Our approach is to directly estimate the low-rank factor by minimizing a nonconvex quadratic loss function via vanilla gradient descent, following a tailored spectral initialization. When the true rank is small, this algorithm is guaranteed to converge to the ground truth (up to global ambiguity) with near-optimal sample complexity and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06286","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":"1802.06286","created_at":"2026-05-17T23:59:27.905944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06286v2","created_at":"2026-05-17T23:59:27.905944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06286","created_at":"2026-05-17T23:59:27.905944+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFTPANDC7BKL","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFTPANDC7BKLYUF5","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFTPANDC","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.09547","citing_title":"Stochastic algorithms with geometric step decay converge linearly on sharp functions","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N","json":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N.json","graph_json":"https://pith.science/api/pith-number/AFTPANDC7BKLYUF5A2ANKPHE5N/graph.json","events_json":"https://pith.science/api/pith-number/AFTPANDC7BKLYUF5A2ANKPHE5N/events.json","paper":"https://pith.science/paper/AFTPANDC"},"agent_actions":{"view_html":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N","download_json":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N.json","view_paper":"https://pith.science/paper/AFTPANDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06286&json=true","fetch_graph":"https://pith.science/api/pith-number/AFTPANDC7BKLYUF5A2ANKPHE5N/graph.json","fetch_events":"https://pith.science/api/pith-number/AFTPANDC7BKLYUF5A2ANKPHE5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N/action/storage_attestation","attest_author":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N/action/author_attestation","sign_citation":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N/action/citation_signature","submit_replication":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N/action/replication_record"}},"created_at":"2026-05-17T23:59:27.905944+00:00","updated_at":"2026-05-17T23:59:27.905944+00:00"}