{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IPP23PGIXC72UG566EPYMAM4BO","short_pith_number":"pith:IPP23PGI","schema_version":"1.0","canonical_sha256":"43dfadbcc8b8bfaa1bbef11f86019c0ba54afaad3a0a2d4cc769f1842aa8ddbb","source":{"kind":"arxiv","id":"1703.05487","version":2},"attestation_state":"computed","paper":{"title":"Accelerated and Inexact Soft-Impute for Large-Scale Matrix and Tensor Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"James T. Kwok, Quanming Yao","submitted_at":"2017-03-16T06:50:00Z","abstract_excerpt":"Matrix and tensor completion aim to recover a low-rank matrix / tensor from limited observations and have been commonly used in applications such as recommender systems and multi-relational data mining. A state-of-the-art matrix completion algorithm is Soft-Impute, which exploits the special \"sparse plus low-rank\" structure of the matrix iterates to allow efficient SVD in each iteration. Though Soft-Impute is a proximal algorithm, it is generally believed that acceleration destroys the special structure and is thus not useful. In this paper, we show that Soft-Impute can indeed be accelerated w"},"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":"1703.05487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-03-16T06:50:00Z","cross_cats_sorted":[],"title_canon_sha256":"3a1fd6b5b8b3c42f5531ae19131f216e6f441442b98716a545d224ad395dbd7a","abstract_canon_sha256":"bf8a353b12da5c1f9887793838c16d3a17c3411c6d3558eae0a50a95a8ce7cb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:18.781737Z","signature_b64":"0ln3pzlpPgzZvI7ZTqSn+VaqgI6v7bhefPZ4m0pY1jdDyHA7E4idYFFRUU53utf1H0uER1Kxx5j7oos5Ej2xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43dfadbcc8b8bfaa1bbef11f86019c0ba54afaad3a0a2d4cc769f1842aa8ddbb","last_reissued_at":"2026-05-18T00:07:18.781047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:18.781047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated and Inexact Soft-Impute for Large-Scale Matrix and Tensor Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"James T. Kwok, Quanming Yao","submitted_at":"2017-03-16T06:50:00Z","abstract_excerpt":"Matrix and tensor completion aim to recover a low-rank matrix / tensor from limited observations and have been commonly used in applications such as recommender systems and multi-relational data mining. A state-of-the-art matrix completion algorithm is Soft-Impute, which exploits the special \"sparse plus low-rank\" structure of the matrix iterates to allow efficient SVD in each iteration. Though Soft-Impute is a proximal algorithm, it is generally believed that acceleration destroys the special structure and is thus not useful. In this paper, we show that Soft-Impute can indeed be accelerated w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05487","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":"1703.05487","created_at":"2026-05-18T00:07:18.781142+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05487v2","created_at":"2026-05-18T00:07:18.781142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05487","created_at":"2026-05-18T00:07:18.781142+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPP23PGIXC72","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPP23PGIXC72UG56","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPP23PGI","created_at":"2026-05-18T12:31:21.493067+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/IPP23PGIXC72UG566EPYMAM4BO","json":"https://pith.science/pith/IPP23PGIXC72UG566EPYMAM4BO.json","graph_json":"https://pith.science/api/pith-number/IPP23PGIXC72UG566EPYMAM4BO/graph.json","events_json":"https://pith.science/api/pith-number/IPP23PGIXC72UG566EPYMAM4BO/events.json","paper":"https://pith.science/paper/IPP23PGI"},"agent_actions":{"view_html":"https://pith.science/pith/IPP23PGIXC72UG566EPYMAM4BO","download_json":"https://pith.science/pith/IPP23PGIXC72UG566EPYMAM4BO.json","view_paper":"https://pith.science/paper/IPP23PGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05487&json=true","fetch_graph":"https://pith.science/api/pith-number/IPP23PGIXC72UG566EPYMAM4BO/graph.json","fetch_events":"https://pith.science/api/pith-number/IPP23PGIXC72UG566EPYMAM4BO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPP23PGIXC72UG566EPYMAM4BO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPP23PGIXC72UG566EPYMAM4BO/action/storage_attestation","attest_author":"https://pith.science/pith/IPP23PGIXC72UG566EPYMAM4BO/action/author_attestation","sign_citation":"https://pith.science/pith/IPP23PGIXC72UG566EPYMAM4BO/action/citation_signature","submit_replication":"https://pith.science/pith/IPP23PGIXC72UG566EPYMAM4BO/action/replication_record"}},"created_at":"2026-05-18T00:07:18.781142+00:00","updated_at":"2026-05-18T00:07:18.781142+00:00"}