{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ABM7OPDYPDE3X5YXR7KTMWK567","short_pith_number":"pith:ABM7OPDY","schema_version":"1.0","canonical_sha256":"0059f73c7878c9bbf7178fd536595df7c3d4de9fe52cd819d37c7de91cf44ca0","source":{"kind":"arxiv","id":"1506.04389","version":2},"attestation_state":"computed","paper":{"title":"Online Matrix Factorization via Broyden Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"\\\"Omer Deniz Aky{\\i}ld{\\i}z","submitted_at":"2015-06-14T13:19:38Z","abstract_excerpt":"In this paper, we propose an online algorithm to compute matrix factorizations. Proposed algorithm updates the dictionary matrix and associated coefficients using a single observation at each time. The algorithm performs low-rank updates to dictionary matrix. We derive the algorithm by defining a simple objective function to minimize whenever an observation is arrived. We extend the algorithm further for handling missing data. We also provide a mini-batch extension which enables to compute the matrix factorization on big datasets. We demonstrate the efficiency of our algorithm on a real datase"},"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":"1506.04389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-14T13:19:38Z","cross_cats_sorted":[],"title_canon_sha256":"26e641a277d81279871335034ffcb621e88d16c9f62d0e4cf020ba5768310117","abstract_canon_sha256":"b24df0371fc1b0fc8d4c33975591fc2c7c309b4080a7c249ad9e5f048a66f6f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:48.743765Z","signature_b64":"K+2D0JVyzTUTL370HFxsZzLnJKex4K4LkxEriE6KNCRJPQ6Ad+UhQmN9F/d2URA0xCVX/O28NcPRwKEIoTXYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0059f73c7878c9bbf7178fd536595df7c3d4de9fe52cd819d37c7de91cf44ca0","last_reissued_at":"2026-05-18T01:37:48.743130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:48.743130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Matrix Factorization via Broyden Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"\\\"Omer Deniz Aky{\\i}ld{\\i}z","submitted_at":"2015-06-14T13:19:38Z","abstract_excerpt":"In this paper, we propose an online algorithm to compute matrix factorizations. Proposed algorithm updates the dictionary matrix and associated coefficients using a single observation at each time. The algorithm performs low-rank updates to dictionary matrix. We derive the algorithm by defining a simple objective function to minimize whenever an observation is arrived. We extend the algorithm further for handling missing data. We also provide a mini-batch extension which enables to compute the matrix factorization on big datasets. We demonstrate the efficiency of our algorithm on a real datase"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04389","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":"1506.04389","created_at":"2026-05-18T01:37:48.743222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04389v2","created_at":"2026-05-18T01:37:48.743222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04389","created_at":"2026-05-18T01:37:48.743222+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABM7OPDYPDE3","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABM7OPDYPDE3X5YX","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABM7OPDY","created_at":"2026-05-18T12:29:10.953037+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/ABM7OPDYPDE3X5YXR7KTMWK567","json":"https://pith.science/pith/ABM7OPDYPDE3X5YXR7KTMWK567.json","graph_json":"https://pith.science/api/pith-number/ABM7OPDYPDE3X5YXR7KTMWK567/graph.json","events_json":"https://pith.science/api/pith-number/ABM7OPDYPDE3X5YXR7KTMWK567/events.json","paper":"https://pith.science/paper/ABM7OPDY"},"agent_actions":{"view_html":"https://pith.science/pith/ABM7OPDYPDE3X5YXR7KTMWK567","download_json":"https://pith.science/pith/ABM7OPDYPDE3X5YXR7KTMWK567.json","view_paper":"https://pith.science/paper/ABM7OPDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04389&json=true","fetch_graph":"https://pith.science/api/pith-number/ABM7OPDYPDE3X5YXR7KTMWK567/graph.json","fetch_events":"https://pith.science/api/pith-number/ABM7OPDYPDE3X5YXR7KTMWK567/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABM7OPDYPDE3X5YXR7KTMWK567/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABM7OPDYPDE3X5YXR7KTMWK567/action/storage_attestation","attest_author":"https://pith.science/pith/ABM7OPDYPDE3X5YXR7KTMWK567/action/author_attestation","sign_citation":"https://pith.science/pith/ABM7OPDYPDE3X5YXR7KTMWK567/action/citation_signature","submit_replication":"https://pith.science/pith/ABM7OPDYPDE3X5YXR7KTMWK567/action/replication_record"}},"created_at":"2026-05-18T01:37:48.743222+00:00","updated_at":"2026-05-18T01:37:48.743222+00:00"}