{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XFGHHGRNLX3KOAI7SZD6DJBW4S","short_pith_number":"pith:XFGHHGRN","schema_version":"1.0","canonical_sha256":"b94c739a2d5df6a7011f9647e1a436e480f5a5e3cf549c93ce601f9e39d3505e","source":{"kind":"arxiv","id":"1611.03819","version":1},"attestation_state":"computed","paper":{"title":"Recovery Guarantee of Non-negative Matrix Factorization via Alternating Updates","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-11-11T19:13:37Z","abstract_excerpt":"Non-negative matrix factorization is a popular tool for decomposing data into feature and weight matrices under non-negativity constraints. It enjoys practical success but is poorly understood theoretically. This paper proposes an algorithm that alternates between decoding the weights and updating the features, and shows that assuming a generative model of the data, it provably recovers the ground-truth under fairly mild conditions. In particular, its only essential requirement on features is linear independence. Furthermore, the algorithm uses ReLU to exploit the non-negativity for decoding t"},"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":"1611.03819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-11T19:13:37Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"22721ff745708bfb0423decca6ec693235403b59c9c1ee97b69e2dcef7c66bf3","abstract_canon_sha256":"3ed417a4d32ecfb4fd86b21dbab9d9ac6b521133d56941f73e25d46268c80ad5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:18.218830Z","signature_b64":"PEnN+o9TgVCrZZGYNHdhQFMrGWRF4DwgcRiHG1F/htSTtSDvlsoX+IdycNDM0Iyo59F+oTywLRmSpOQBDjvIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b94c739a2d5df6a7011f9647e1a436e480f5a5e3cf549c93ce601f9e39d3505e","last_reissued_at":"2026-05-18T00:59:18.218239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:18.218239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recovery Guarantee of Non-negative Matrix Factorization via Alternating Updates","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-11-11T19:13:37Z","abstract_excerpt":"Non-negative matrix factorization is a popular tool for decomposing data into feature and weight matrices under non-negativity constraints. It enjoys practical success but is poorly understood theoretically. This paper proposes an algorithm that alternates between decoding the weights and updating the features, and shows that assuming a generative model of the data, it provably recovers the ground-truth under fairly mild conditions. In particular, its only essential requirement on features is linear independence. Furthermore, the algorithm uses ReLU to exploit the non-negativity for decoding t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03819","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":"1611.03819","created_at":"2026-05-18T00:59:18.218336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.03819v1","created_at":"2026-05-18T00:59:18.218336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03819","created_at":"2026-05-18T00:59:18.218336+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFGHHGRNLX3K","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFGHHGRNLX3KOAI7","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFGHHGRN","created_at":"2026-05-18T12:30:51.357362+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/XFGHHGRNLX3KOAI7SZD6DJBW4S","json":"https://pith.science/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S.json","graph_json":"https://pith.science/api/pith-number/XFGHHGRNLX3KOAI7SZD6DJBW4S/graph.json","events_json":"https://pith.science/api/pith-number/XFGHHGRNLX3KOAI7SZD6DJBW4S/events.json","paper":"https://pith.science/paper/XFGHHGRN"},"agent_actions":{"view_html":"https://pith.science/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S","download_json":"https://pith.science/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S.json","view_paper":"https://pith.science/paper/XFGHHGRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.03819&json=true","fetch_graph":"https://pith.science/api/pith-number/XFGHHGRNLX3KOAI7SZD6DJBW4S/graph.json","fetch_events":"https://pith.science/api/pith-number/XFGHHGRNLX3KOAI7SZD6DJBW4S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S/action/storage_attestation","attest_author":"https://pith.science/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S/action/author_attestation","sign_citation":"https://pith.science/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S/action/citation_signature","submit_replication":"https://pith.science/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S/action/replication_record"}},"created_at":"2026-05-18T00:59:18.218336+00:00","updated_at":"2026-05-18T00:59:18.218336+00:00"}