{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GA3IGLCPKNC4WH4DKDT3K4JVJZ","short_pith_number":"pith:GA3IGLCP","schema_version":"1.0","canonical_sha256":"3036832c4f5345cb1f8350e7b571354e7edb28a2fed236eb4200caec9177f2ca","source":{"kind":"arxiv","id":"1509.03025","version":1},"attestation_state":"computed","paper":{"title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Martin J. Wainwright, Yudong Chen","submitted_at":"2015-09-10T06:07:52Z","abstract_excerpt":"Optimization problems with rank constraints arise in many applications, including matrix regression, structured PCA, matrix completion and matrix decomposition problems. An attractive heuristic for solving such problems is to factorize the low-rank matrix, and to run projected gradient descent on the nonconvex factorized optimization problem. The goal of this problem is to provide a general theoretical framework for understanding when such methods work well, and to characterize the nature of the resulting fixed point. We provide a simple set of conditions under which projected gradient descent"},"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":"1509.03025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-10T06:07:52Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"eb7809f30e659ed621defe18a2088fc2e0cef4bc761b07cdacc6e7dde836288c","abstract_canon_sha256":"a9670f88391bd27f84dfdb1971d6e2cf5fa147a6ba7edfe0ce5ecb6184d12841"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:25.722767Z","signature_b64":"sm7o8HBTzhmL2fqFVyRsOQmuSZMS6wGLREAZyeHAoVkONa7BZpZdD4Ec87hPJawKnL9lWZjuKVO3tqo7VQUYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3036832c4f5345cb1f8350e7b571354e7edb28a2fed236eb4200caec9177f2ca","last_reissued_at":"2026-05-18T01:33:25.722115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:25.722115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Martin J. Wainwright, Yudong Chen","submitted_at":"2015-09-10T06:07:52Z","abstract_excerpt":"Optimization problems with rank constraints arise in many applications, including matrix regression, structured PCA, matrix completion and matrix decomposition problems. An attractive heuristic for solving such problems is to factorize the low-rank matrix, and to run projected gradient descent on the nonconvex factorized optimization problem. The goal of this problem is to provide a general theoretical framework for understanding when such methods work well, and to characterize the nature of the resulting fixed point. We provide a simple set of conditions under which projected gradient descent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03025","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":"1509.03025","created_at":"2026-05-18T01:33:25.722219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03025v1","created_at":"2026-05-18T01:33:25.722219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03025","created_at":"2026-05-18T01:33:25.722219+00:00"},{"alias_kind":"pith_short_12","alias_value":"GA3IGLCPKNC4","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GA3IGLCPKNC4WH4D","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GA3IGLCP","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2501.07237","citing_title":"GWT: Scalable Optimizer State Compression for Large Language Model Training","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17189","citing_title":"Sample efficient inductive matrix completion with noise and inexact side information","ref_index":134,"is_internal_anchor":true},{"citing_arxiv_id":"2403.03507","citing_title":"GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projection","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2605.05446","citing_title":"Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21905","citing_title":"Low-Rank Adaptation Redux for Large Models","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20075","citing_title":"Robust Uniform Recovery of Structured Signals from Nonlinear Observations","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ","json":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ.json","graph_json":"https://pith.science/api/pith-number/GA3IGLCPKNC4WH4DKDT3K4JVJZ/graph.json","events_json":"https://pith.science/api/pith-number/GA3IGLCPKNC4WH4DKDT3K4JVJZ/events.json","paper":"https://pith.science/paper/GA3IGLCP"},"agent_actions":{"view_html":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ","download_json":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ.json","view_paper":"https://pith.science/paper/GA3IGLCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03025&json=true","fetch_graph":"https://pith.science/api/pith-number/GA3IGLCPKNC4WH4DKDT3K4JVJZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GA3IGLCPKNC4WH4DKDT3K4JVJZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ/action/storage_attestation","attest_author":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ/action/author_attestation","sign_citation":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ/action/citation_signature","submit_replication":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ/action/replication_record"}},"created_at":"2026-05-18T01:33:25.722219+00:00","updated_at":"2026-05-18T01:33:25.722219+00:00"}