{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PR4ONNGFOE5JJB572UM5XLUBJF","short_pith_number":"pith:PR4ONNGF","schema_version":"1.0","canonical_sha256":"7c78e6b4c5713a9487bfd519dbae81495d3d5dd9becd020a64b220014b62bccb","source":{"kind":"arxiv","id":"1609.00951","version":3},"attestation_state":"computed","paper":{"title":"A Unified Convergence Analysis of the Multiplicative Update Algorithm for Regularized Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"math.OC","authors_text":"Renbo Zhao, Vincent Y. F. Tan","submitted_at":"2016-09-04T15:47:43Z","abstract_excerpt":"The multiplicative update (MU) algorithm has been extensively used to estimate the basis and coefficient matrices in nonnegative matrix factorization (NMF) problems under a wide range of divergences and regularizers. However, theoretical convergence guarantees have only been derived for a few special divergences without regularization. In this work, we provide a conceptually simple, self-contained, and unified proof for the convergence of the MU algorithm applied on NMF with a wide range of divergences and regularizers. Our main result shows the sequence of iterates (i.e., pairs of basis and c"},"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":"1609.00951","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-04T15:47:43Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"ecb88a34971a7d75d5a2a0b378ad058f394517231621ef59ad288ef3bf5dbe9e","abstract_canon_sha256":"0b9d46d8b0e8a8644ba31d9387ef7c0d5f26ce1691630b8144806a8bd22c17da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:51.594931Z","signature_b64":"S/f0r9x4yYATnUAVoU0HXKvPGRlUdpV4yqaUWrb/6h+8pbgemhLu0r7JbNnI9nFGRjymtKzTsZD8qLe9yotSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c78e6b4c5713a9487bfd519dbae81495d3d5dd9becd020a64b220014b62bccb","last_reissued_at":"2026-05-18T00:42:51.594194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:51.594194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Convergence Analysis of the Multiplicative Update Algorithm for Regularized Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"math.OC","authors_text":"Renbo Zhao, Vincent Y. F. Tan","submitted_at":"2016-09-04T15:47:43Z","abstract_excerpt":"The multiplicative update (MU) algorithm has been extensively used to estimate the basis and coefficient matrices in nonnegative matrix factorization (NMF) problems under a wide range of divergences and regularizers. However, theoretical convergence guarantees have only been derived for a few special divergences without regularization. In this work, we provide a conceptually simple, self-contained, and unified proof for the convergence of the MU algorithm applied on NMF with a wide range of divergences and regularizers. Our main result shows the sequence of iterates (i.e., pairs of basis and c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00951","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":""},"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":"1609.00951","created_at":"2026-05-18T00:42:51.594294+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00951v3","created_at":"2026-05-18T00:42:51.594294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00951","created_at":"2026-05-18T00:42:51.594294+00:00"},{"alias_kind":"pith_short_12","alias_value":"PR4ONNGFOE5J","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PR4ONNGFOE5JJB57","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PR4ONNGF","created_at":"2026-05-18T12:30:39.010887+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/PR4ONNGFOE5JJB572UM5XLUBJF","json":"https://pith.science/pith/PR4ONNGFOE5JJB572UM5XLUBJF.json","graph_json":"https://pith.science/api/pith-number/PR4ONNGFOE5JJB572UM5XLUBJF/graph.json","events_json":"https://pith.science/api/pith-number/PR4ONNGFOE5JJB572UM5XLUBJF/events.json","paper":"https://pith.science/paper/PR4ONNGF"},"agent_actions":{"view_html":"https://pith.science/pith/PR4ONNGFOE5JJB572UM5XLUBJF","download_json":"https://pith.science/pith/PR4ONNGFOE5JJB572UM5XLUBJF.json","view_paper":"https://pith.science/paper/PR4ONNGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00951&json=true","fetch_graph":"https://pith.science/api/pith-number/PR4ONNGFOE5JJB572UM5XLUBJF/graph.json","fetch_events":"https://pith.science/api/pith-number/PR4ONNGFOE5JJB572UM5XLUBJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PR4ONNGFOE5JJB572UM5XLUBJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PR4ONNGFOE5JJB572UM5XLUBJF/action/storage_attestation","attest_author":"https://pith.science/pith/PR4ONNGFOE5JJB572UM5XLUBJF/action/author_attestation","sign_citation":"https://pith.science/pith/PR4ONNGFOE5JJB572UM5XLUBJF/action/citation_signature","submit_replication":"https://pith.science/pith/PR4ONNGFOE5JJB572UM5XLUBJF/action/replication_record"}},"created_at":"2026-05-18T00:42:51.594294+00:00","updated_at":"2026-05-18T00:42:51.594294+00:00"}