{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:672AESRKVWGMHHT4AA4NQELMXC","short_pith_number":"pith:672AESRK","schema_version":"1.0","canonical_sha256":"f7f4024a2aad8cc39e7c0038d8116cb8953e51ec48c7bc00d57e612f2a1a65a7","source":{"kind":"arxiv","id":"2410.09640","version":3},"attestation_state":"computed","paper":{"title":"Provable Acceleration of Nesterov's Accelerated Gradient for Rectangular Matrix Factorization and Linear Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Molei Tao, Rachel Ward, Tuo Zhao, Yuqing Wang, Zhenghao Xu","submitted_at":"2024-10-12T20:33:37Z","abstract_excerpt":"We study the convergence rate of first-order methods for rectangular matrix factorization, which is a canonical nonconvex optimization problem. Specifically, given a rank-$r$ matrix $\\mathbf{A}\\in\\mathbb{R}^{m\\times n}$, we prove that gradient descent (GD) can find a pair of $\\epsilon$-optimal solutions $\\mathbf{X}_T\\in\\mathbb{R}^{m\\times d}$ and $\\mathbf{Y}_T\\in\\mathbb{R}^{n\\times d}$, where $d\\geq r$, satisfying $\\lVert\\mathbf{X}_T\\mathbf{Y}_T^\\top-\\mathbf{A}\\rVert_\\mathrm{F}\\leq\\epsilon\\lVert\\mathbf{A}\\rVert_\\mathrm{F}$ in $T=O(\\kappa^2\\log\\frac{1}{\\epsilon})$ iterations with high probabili"},"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":"2410.09640","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-12T20:33:37Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e9993385e9732d481322a2b7e3e48aff83fa3224d4b74cecd39b377095eabdc4","abstract_canon_sha256":"792a75f7a4c87a5c04849f0a20ab343e1e5276c6c8f61c9f1f73cf430a954347"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:31.161595Z","signature_b64":"wVweTVOC27D9fM2KN/9uFN4W7lZ0eXyGCzdYS0/krTPS7RxBTl3TK0jwiylxqsyT+f+osBHy0aZMzh5jlzo4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7f4024a2aad8cc39e7c0038d8116cb8953e51ec48c7bc00d57e612f2a1a65a7","last_reissued_at":"2026-07-05T09:42:31.160991Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:31.160991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable Acceleration of Nesterov's Accelerated Gradient for Rectangular Matrix Factorization and Linear Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Molei Tao, Rachel Ward, Tuo Zhao, Yuqing Wang, Zhenghao Xu","submitted_at":"2024-10-12T20:33:37Z","abstract_excerpt":"We study the convergence rate of first-order methods for rectangular matrix factorization, which is a canonical nonconvex optimization problem. Specifically, given a rank-$r$ matrix $\\mathbf{A}\\in\\mathbb{R}^{m\\times n}$, we prove that gradient descent (GD) can find a pair of $\\epsilon$-optimal solutions $\\mathbf{X}_T\\in\\mathbb{R}^{m\\times d}$ and $\\mathbf{Y}_T\\in\\mathbb{R}^{n\\times d}$, where $d\\geq r$, satisfying $\\lVert\\mathbf{X}_T\\mathbf{Y}_T^\\top-\\mathbf{A}\\rVert_\\mathrm{F}\\leq\\epsilon\\lVert\\mathbf{A}\\rVert_\\mathrm{F}$ in $T=O(\\kappa^2\\log\\frac{1}{\\epsilon})$ iterations with high probabili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.09640","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.09640/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.09640","created_at":"2026-07-05T09:42:31.161062+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.09640v3","created_at":"2026-07-05T09:42:31.161062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.09640","created_at":"2026-07-05T09:42:31.161062+00:00"},{"alias_kind":"pith_short_12","alias_value":"672AESRKVWGM","created_at":"2026-07-05T09:42:31.161062+00:00"},{"alias_kind":"pith_short_16","alias_value":"672AESRKVWGMHHT4","created_at":"2026-07-05T09:42:31.161062+00:00"},{"alias_kind":"pith_short_8","alias_value":"672AESRK","created_at":"2026-07-05T09:42:31.161062+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/672AESRKVWGMHHT4AA4NQELMXC","json":"https://pith.science/pith/672AESRKVWGMHHT4AA4NQELMXC.json","graph_json":"https://pith.science/api/pith-number/672AESRKVWGMHHT4AA4NQELMXC/graph.json","events_json":"https://pith.science/api/pith-number/672AESRKVWGMHHT4AA4NQELMXC/events.json","paper":"https://pith.science/paper/672AESRK"},"agent_actions":{"view_html":"https://pith.science/pith/672AESRKVWGMHHT4AA4NQELMXC","download_json":"https://pith.science/pith/672AESRKVWGMHHT4AA4NQELMXC.json","view_paper":"https://pith.science/paper/672AESRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.09640&json=true","fetch_graph":"https://pith.science/api/pith-number/672AESRKVWGMHHT4AA4NQELMXC/graph.json","fetch_events":"https://pith.science/api/pith-number/672AESRKVWGMHHT4AA4NQELMXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/672AESRKVWGMHHT4AA4NQELMXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/672AESRKVWGMHHT4AA4NQELMXC/action/storage_attestation","attest_author":"https://pith.science/pith/672AESRKVWGMHHT4AA4NQELMXC/action/author_attestation","sign_citation":"https://pith.science/pith/672AESRKVWGMHHT4AA4NQELMXC/action/citation_signature","submit_replication":"https://pith.science/pith/672AESRKVWGMHHT4AA4NQELMXC/action/replication_record"}},"created_at":"2026-07-05T09:42:31.161062+00:00","updated_at":"2026-07-05T09:42:31.161062+00:00"}