{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TZRXFHR5R6ZFPQURQX7SXYVHSL","short_pith_number":"pith:TZRXFHR5","schema_version":"1.0","canonical_sha256":"9e63729e3d8fb257c29185ff2be2a792ea795ed04fb45551129ad88f56b42293","source":{"kind":"arxiv","id":"1602.02262","version":2},"attestation_state":"computed","paper":{"title":"Recovery guarantee of weighted low-rank approximation via alternating minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrej Risteski, Yingyu Liang, Yuanzhi Li","submitted_at":"2016-02-06T14:55:12Z","abstract_excerpt":"Many applications require recovering a ground truth low-rank matrix from noisy observations of the entries, which in practice is typically formulated as a weighted low-rank approximation problem and solved by non-convex optimization heuristics such as alternating minimization. In this paper, we provide provable recovery guarantee of weighted low-rank via a simple alternating minimization algorithm. In particular, for a natural class of matrices and weights and without any assumption on the noise, we bound the spectral norm of the difference between the recovered matrix and the ground truth, by"},"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":"1602.02262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-06T14:55:12Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"7473d8cf79fb9cc36a55e310b5e452096b8e093f6c8dd8a13912cb45f6652361","abstract_canon_sha256":"2c153ee46cb9a32ecbe46078fb125ca5de01904849d663bf67631b7cad8f2a74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:34.321290Z","signature_b64":"Ct13lxRJahAVFQFLErQlNZMptHP9HTSXendR5sAT2f7uQxS6Ph/DTPslRj3TO32sIyEXS4ZcVEI0LV1E6zUeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e63729e3d8fb257c29185ff2be2a792ea795ed04fb45551129ad88f56b42293","last_reissued_at":"2026-05-18T00:55:34.320869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:34.320869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recovery guarantee of weighted low-rank approximation via alternating minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrej Risteski, Yingyu Liang, Yuanzhi Li","submitted_at":"2016-02-06T14:55:12Z","abstract_excerpt":"Many applications require recovering a ground truth low-rank matrix from noisy observations of the entries, which in practice is typically formulated as a weighted low-rank approximation problem and solved by non-convex optimization heuristics such as alternating minimization. In this paper, we provide provable recovery guarantee of weighted low-rank via a simple alternating minimization algorithm. In particular, for a natural class of matrices and weights and without any assumption on the noise, we bound the spectral norm of the difference between the recovered matrix and the ground truth, by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02262","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":"1602.02262","created_at":"2026-05-18T00:55:34.320939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02262v2","created_at":"2026-05-18T00:55:34.320939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02262","created_at":"2026-05-18T00:55:34.320939+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZRXFHR5R6ZF","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZRXFHR5R6ZFPQUR","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZRXFHR5","created_at":"2026-05-18T12:30:46.583412+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/TZRXFHR5R6ZFPQURQX7SXYVHSL","json":"https://pith.science/pith/TZRXFHR5R6ZFPQURQX7SXYVHSL.json","graph_json":"https://pith.science/api/pith-number/TZRXFHR5R6ZFPQURQX7SXYVHSL/graph.json","events_json":"https://pith.science/api/pith-number/TZRXFHR5R6ZFPQURQX7SXYVHSL/events.json","paper":"https://pith.science/paper/TZRXFHR5"},"agent_actions":{"view_html":"https://pith.science/pith/TZRXFHR5R6ZFPQURQX7SXYVHSL","download_json":"https://pith.science/pith/TZRXFHR5R6ZFPQURQX7SXYVHSL.json","view_paper":"https://pith.science/paper/TZRXFHR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02262&json=true","fetch_graph":"https://pith.science/api/pith-number/TZRXFHR5R6ZFPQURQX7SXYVHSL/graph.json","fetch_events":"https://pith.science/api/pith-number/TZRXFHR5R6ZFPQURQX7SXYVHSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZRXFHR5R6ZFPQURQX7SXYVHSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZRXFHR5R6ZFPQURQX7SXYVHSL/action/storage_attestation","attest_author":"https://pith.science/pith/TZRXFHR5R6ZFPQURQX7SXYVHSL/action/author_attestation","sign_citation":"https://pith.science/pith/TZRXFHR5R6ZFPQURQX7SXYVHSL/action/citation_signature","submit_replication":"https://pith.science/pith/TZRXFHR5R6ZFPQURQX7SXYVHSL/action/replication_record"}},"created_at":"2026-05-18T00:55:34.320939+00:00","updated_at":"2026-05-18T00:55:34.320939+00:00"}