{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7DV7JC5MRZZCMTMIQDERQWJHS3","short_pith_number":"pith:7DV7JC5M","schema_version":"1.0","canonical_sha256":"f8ebf48bac8e72264d8880c918592796ff2bb8bf7f4e70f5c945b0aaad3b3926","source":{"kind":"arxiv","id":"1708.02455","version":2},"attestation_state":"computed","paper":{"title":"Fast Low-Rank Bayesian Matrix Completion with Hierarchical Gaussian Prior Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bing Zeng, Hongbin Li, Huiping Duan, Jun Fang, Linxiao Yang","submitted_at":"2017-08-08T11:59:10Z","abstract_excerpt":"The problem of low rank matrix completion is considered in this paper. To exploit the underlying low-rank structure of the data matrix, we propose a hierarchical Gaussian prior model, where columns of the low-rank matrix are assumed to follow a Gaussian distribution with zero mean and a common precision matrix, and a Wishart distribution is specified as a hyperprior over the precision matrix. We show that such a hierarchical Gaussian prior has the potential to encourage a low-rank solution. Based on the proposed hierarchical prior model, a variational Bayesian method is developed for matrix co"},"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":"1708.02455","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-08T11:59:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"585164ed70e74f9538a5cdfc17e69006db6fce564cfb6eec614bf7e187255df1","abstract_canon_sha256":"81ec4fd2f4687bc87af92ffcf6003b9e9a6a55cb5e5e029b1faf6726ddb909b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:31.702437Z","signature_b64":"TIo72/WDPWV+btWtLQ4uiBkji8e8jcyA4r3eWjyI2iLp3515Kada+CgmukSwWtjZreVEERdW1ikOFycg3OWIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8ebf48bac8e72264d8880c918592796ff2bb8bf7f4e70f5c945b0aaad3b3926","last_reissued_at":"2026-05-18T00:16:31.701937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:31.701937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Low-Rank Bayesian Matrix Completion with Hierarchical Gaussian Prior Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bing Zeng, Hongbin Li, Huiping Duan, Jun Fang, Linxiao Yang","submitted_at":"2017-08-08T11:59:10Z","abstract_excerpt":"The problem of low rank matrix completion is considered in this paper. To exploit the underlying low-rank structure of the data matrix, we propose a hierarchical Gaussian prior model, where columns of the low-rank matrix are assumed to follow a Gaussian distribution with zero mean and a common precision matrix, and a Wishart distribution is specified as a hyperprior over the precision matrix. We show that such a hierarchical Gaussian prior has the potential to encourage a low-rank solution. Based on the proposed hierarchical prior model, a variational Bayesian method is developed for matrix co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02455","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":"1708.02455","created_at":"2026-05-18T00:16:31.702028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02455v2","created_at":"2026-05-18T00:16:31.702028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02455","created_at":"2026-05-18T00:16:31.702028+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DV7JC5MRZZC","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DV7JC5MRZZCMTMI","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DV7JC5M","created_at":"2026-05-18T12:31:05.417338+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/7DV7JC5MRZZCMTMIQDERQWJHS3","json":"https://pith.science/pith/7DV7JC5MRZZCMTMIQDERQWJHS3.json","graph_json":"https://pith.science/api/pith-number/7DV7JC5MRZZCMTMIQDERQWJHS3/graph.json","events_json":"https://pith.science/api/pith-number/7DV7JC5MRZZCMTMIQDERQWJHS3/events.json","paper":"https://pith.science/paper/7DV7JC5M"},"agent_actions":{"view_html":"https://pith.science/pith/7DV7JC5MRZZCMTMIQDERQWJHS3","download_json":"https://pith.science/pith/7DV7JC5MRZZCMTMIQDERQWJHS3.json","view_paper":"https://pith.science/paper/7DV7JC5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02455&json=true","fetch_graph":"https://pith.science/api/pith-number/7DV7JC5MRZZCMTMIQDERQWJHS3/graph.json","fetch_events":"https://pith.science/api/pith-number/7DV7JC5MRZZCMTMIQDERQWJHS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DV7JC5MRZZCMTMIQDERQWJHS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DV7JC5MRZZCMTMIQDERQWJHS3/action/storage_attestation","attest_author":"https://pith.science/pith/7DV7JC5MRZZCMTMIQDERQWJHS3/action/author_attestation","sign_citation":"https://pith.science/pith/7DV7JC5MRZZCMTMIQDERQWJHS3/action/citation_signature","submit_replication":"https://pith.science/pith/7DV7JC5MRZZCMTMIQDERQWJHS3/action/replication_record"}},"created_at":"2026-05-18T00:16:31.702028+00:00","updated_at":"2026-05-18T00:16:31.702028+00:00"}