{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QBEPCHA5LZI2FGNH73AQ7V5TYY","short_pith_number":"pith:QBEPCHA5","schema_version":"1.0","canonical_sha256":"8048f11c1d5e51a299a7fec10fd7b3c6121eee0f4f10ae0a8cb41d9803771150","source":{"kind":"arxiv","id":"2302.10963","version":3},"attestation_state":"computed","paper":{"title":"Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Jianhao Ma, Salar Fattahi","submitted_at":"2023-02-21T19:47:31Z","abstract_excerpt":"We explore the local landscape of low-rank matrix recovery, focusing on reconstructing a $d_1\\times d_2$ matrix $X^\\star$ with rank $r$ from $m$ linear measurements, some potentially noisy. When the noise is distributed according to an outlier model, minimizing a nonsmooth $\\ell_1$-loss with a simple sub-gradient method can often perfectly recover the ground truth matrix $X^\\star$. Given this, a natural question is what optimization property (if any) enables such learning behavior. The most plausible answer is that the ground truth $X^\\star$ manifests as a local optimum of the loss function. I"},"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":"2302.10963","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-21T19:47:31Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4c3e66789b9fcb71e04fc0c7db03bf4daec2d8fba60fcf4e2b78da13d112e972","abstract_canon_sha256":"197a1b0f8c855d2e2590a4e3efc3ec4339a9b1cfc98053bdfc276e98b4f85e10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:12.169559Z","signature_b64":"/peIceU4yD9mYrkbgMQJ1/VNAASDLeG8trhGSDX+aQDkmy7k4MaAM0Yt14jKX+0XF9SanN0pWkTHYUbyIK1wBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8048f11c1d5e51a299a7fec10fd7b3c6121eee0f4f10ae0a8cb41d9803771150","last_reissued_at":"2026-07-05T10:44:12.169165Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:12.169165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Jianhao Ma, Salar Fattahi","submitted_at":"2023-02-21T19:47:31Z","abstract_excerpt":"We explore the local landscape of low-rank matrix recovery, focusing on reconstructing a $d_1\\times d_2$ matrix $X^\\star$ with rank $r$ from $m$ linear measurements, some potentially noisy. When the noise is distributed according to an outlier model, minimizing a nonsmooth $\\ell_1$-loss with a simple sub-gradient method can often perfectly recover the ground truth matrix $X^\\star$. Given this, a natural question is what optimization property (if any) enables such learning behavior. The most plausible answer is that the ground truth $X^\\star$ manifests as a local optimum of the loss function. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.10963","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/2302.10963/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":"2302.10963","created_at":"2026-07-05T10:44:12.169221+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.10963v3","created_at":"2026-07-05T10:44:12.169221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10963","created_at":"2026-07-05T10:44:12.169221+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBEPCHA5LZI2","created_at":"2026-07-05T10:44:12.169221+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBEPCHA5LZI2FGNH","created_at":"2026-07-05T10:44:12.169221+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBEPCHA5","created_at":"2026-07-05T10:44:12.169221+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20659","citing_title":"A High-Dimensional Statistical Theory for Convex and Nonconvex Matrix Sensing","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QBEPCHA5LZI2FGNH73AQ7V5TYY","json":"https://pith.science/pith/QBEPCHA5LZI2FGNH73AQ7V5TYY.json","graph_json":"https://pith.science/api/pith-number/QBEPCHA5LZI2FGNH73AQ7V5TYY/graph.json","events_json":"https://pith.science/api/pith-number/QBEPCHA5LZI2FGNH73AQ7V5TYY/events.json","paper":"https://pith.science/paper/QBEPCHA5"},"agent_actions":{"view_html":"https://pith.science/pith/QBEPCHA5LZI2FGNH73AQ7V5TYY","download_json":"https://pith.science/pith/QBEPCHA5LZI2FGNH73AQ7V5TYY.json","view_paper":"https://pith.science/paper/QBEPCHA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.10963&json=true","fetch_graph":"https://pith.science/api/pith-number/QBEPCHA5LZI2FGNH73AQ7V5TYY/graph.json","fetch_events":"https://pith.science/api/pith-number/QBEPCHA5LZI2FGNH73AQ7V5TYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBEPCHA5LZI2FGNH73AQ7V5TYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBEPCHA5LZI2FGNH73AQ7V5TYY/action/storage_attestation","attest_author":"https://pith.science/pith/QBEPCHA5LZI2FGNH73AQ7V5TYY/action/author_attestation","sign_citation":"https://pith.science/pith/QBEPCHA5LZI2FGNH73AQ7V5TYY/action/citation_signature","submit_replication":"https://pith.science/pith/QBEPCHA5LZI2FGNH73AQ7V5TYY/action/replication_record"}},"created_at":"2026-07-05T10:44:12.169221+00:00","updated_at":"2026-07-05T10:44:12.169221+00:00"}