{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6SZ5XA7PFTFEKWXVZ5JVSZCESF","short_pith_number":"pith:6SZ5XA7P","schema_version":"1.0","canonical_sha256":"f4b3db83ef2cca455af5cf53596444914f5f8201297b9ea3c41a207e4b37a8d3","source":{"kind":"arxiv","id":"1712.03281","version":1},"attestation_state":"computed","paper":{"title":"Fast Low-Rank Matrix Estimation without the Condition Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Chinmay Hegde, Mohammadreza Soltani","submitted_at":"2017-12-08T21:10:42Z","abstract_excerpt":"In this paper, we study the general problem of optimizing a convex function $F(L)$ over the set of $p \\times p$ matrices, subject to rank constraints on $L$. However, existing first-order methods for solving such problems either are too slow to converge, or require multiple invocations of singular value decompositions. On the other hand, factorization-based non-convex algorithms, while being much faster, require stringent assumptions on the \\emph{condition number} of the optimum. In this paper, we provide a novel algorithmic framework that achieves the best of both worlds: asymptotically as fa"},"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":"1712.03281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-08T21:10:42Z","cross_cats_sorted":[],"title_canon_sha256":"6f61b5e332136d9e6bd838392594732e5ea3de079684ead79ee013bc4c941404","abstract_canon_sha256":"ac05ff5a2ee6083d06678770c2c8c5a9f0af675b1f8982f7b0756e284811899a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:21.774851Z","signature_b64":"myEghbi6hjSPNo/pHvruahMnuUDIU1zZUYxixjfWEUdZQQUrDXXa/rCUnh83KaaKVg9P7qYiZWRci4djyJyoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4b3db83ef2cca455af5cf53596444914f5f8201297b9ea3c41a207e4b37a8d3","last_reissued_at":"2026-05-18T00:28:21.774186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:21.774186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Low-Rank Matrix Estimation without the Condition Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Chinmay Hegde, Mohammadreza Soltani","submitted_at":"2017-12-08T21:10:42Z","abstract_excerpt":"In this paper, we study the general problem of optimizing a convex function $F(L)$ over the set of $p \\times p$ matrices, subject to rank constraints on $L$. However, existing first-order methods for solving such problems either are too slow to converge, or require multiple invocations of singular value decompositions. On the other hand, factorization-based non-convex algorithms, while being much faster, require stringent assumptions on the \\emph{condition number} of the optimum. In this paper, we provide a novel algorithmic framework that achieves the best of both worlds: asymptotically as fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03281","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":"1712.03281","created_at":"2026-05-18T00:28:21.774293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03281v1","created_at":"2026-05-18T00:28:21.774293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03281","created_at":"2026-05-18T00:28:21.774293+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SZ5XA7PFTFE","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SZ5XA7PFTFEKWXV","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SZ5XA7P","created_at":"2026-05-18T12:31:03.183658+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/6SZ5XA7PFTFEKWXVZ5JVSZCESF","json":"https://pith.science/pith/6SZ5XA7PFTFEKWXVZ5JVSZCESF.json","graph_json":"https://pith.science/api/pith-number/6SZ5XA7PFTFEKWXVZ5JVSZCESF/graph.json","events_json":"https://pith.science/api/pith-number/6SZ5XA7PFTFEKWXVZ5JVSZCESF/events.json","paper":"https://pith.science/paper/6SZ5XA7P"},"agent_actions":{"view_html":"https://pith.science/pith/6SZ5XA7PFTFEKWXVZ5JVSZCESF","download_json":"https://pith.science/pith/6SZ5XA7PFTFEKWXVZ5JVSZCESF.json","view_paper":"https://pith.science/paper/6SZ5XA7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03281&json=true","fetch_graph":"https://pith.science/api/pith-number/6SZ5XA7PFTFEKWXVZ5JVSZCESF/graph.json","fetch_events":"https://pith.science/api/pith-number/6SZ5XA7PFTFEKWXVZ5JVSZCESF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SZ5XA7PFTFEKWXVZ5JVSZCESF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SZ5XA7PFTFEKWXVZ5JVSZCESF/action/storage_attestation","attest_author":"https://pith.science/pith/6SZ5XA7PFTFEKWXVZ5JVSZCESF/action/author_attestation","sign_citation":"https://pith.science/pith/6SZ5XA7PFTFEKWXVZ5JVSZCESF/action/citation_signature","submit_replication":"https://pith.science/pith/6SZ5XA7PFTFEKWXVZ5JVSZCESF/action/replication_record"}},"created_at":"2026-05-18T00:28:21.774293+00:00","updated_at":"2026-05-18T00:28:21.774293+00:00"}