{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EUIKIPDCB4LKNADB6D2CRT6UR7","short_pith_number":"pith:EUIKIPDC","schema_version":"1.0","canonical_sha256":"2510a43c620f16a68061f0f428cfd48fcaf50afed16e68b42d77768d04d4ac5a","source":{"kind":"arxiv","id":"1711.06989","version":1},"attestation_state":"computed","paper":{"title":"Sequential Randomized Matrix Factorization for Gaussian Processes: Efficient Predictions and Hyper-parameter Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"George S. Eskander Ekladious, Shaunak D. Bopardikar","submitted_at":"2017-11-19T09:38:33Z","abstract_excerpt":"This paper presents a sequential randomized lowrank matrix factorization approach for incrementally predicting values of an unknown function at test points using the Gaussian Processes framework. It is well-known that in the Gaussian processes framework, the computational bottlenecks are the inversion of the (regularized) kernel matrix and the computation of the hyper-parameters defining the kernel. The main contributions of this paper are two-fold. First, we formalize an approach to compute the inverse of the kernel matrix using randomized matrix factorization algorithms in a streaming scenar"},"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":"1711.06989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-19T09:38:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a836ebe49ec09442d3a66fe345ae6e6e4beabb75555e4886df1dc419c52b41c4","abstract_canon_sha256":"333e97722276650217b739647bd97c83191ee524e41c7462859752c0fe5d852a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:14.902118Z","signature_b64":"DybJq+Ip68fbIBdJBa7B7rZF+sOJKHsp4HC9z0iun/3KKpfeEmaOQNc8IOSzDQIXCED/0Ud1BPeYjsxqZiu8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2510a43c620f16a68061f0f428cfd48fcaf50afed16e68b42d77768d04d4ac5a","last_reissued_at":"2026-05-18T00:30:14.901197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:14.901197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Randomized Matrix Factorization for Gaussian Processes: Efficient Predictions and Hyper-parameter Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"George S. Eskander Ekladious, Shaunak D. Bopardikar","submitted_at":"2017-11-19T09:38:33Z","abstract_excerpt":"This paper presents a sequential randomized lowrank matrix factorization approach for incrementally predicting values of an unknown function at test points using the Gaussian Processes framework. It is well-known that in the Gaussian processes framework, the computational bottlenecks are the inversion of the (regularized) kernel matrix and the computation of the hyper-parameters defining the kernel. The main contributions of this paper are two-fold. First, we formalize an approach to compute the inverse of the kernel matrix using randomized matrix factorization algorithms in a streaming scenar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06989","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":"1711.06989","created_at":"2026-05-18T00:30:14.901372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06989v1","created_at":"2026-05-18T00:30:14.901372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06989","created_at":"2026-05-18T00:30:14.901372+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUIKIPDCB4LK","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUIKIPDCB4LKNADB","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUIKIPDC","created_at":"2026-05-18T12:31:12.930513+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/EUIKIPDCB4LKNADB6D2CRT6UR7","json":"https://pith.science/pith/EUIKIPDCB4LKNADB6D2CRT6UR7.json","graph_json":"https://pith.science/api/pith-number/EUIKIPDCB4LKNADB6D2CRT6UR7/graph.json","events_json":"https://pith.science/api/pith-number/EUIKIPDCB4LKNADB6D2CRT6UR7/events.json","paper":"https://pith.science/paper/EUIKIPDC"},"agent_actions":{"view_html":"https://pith.science/pith/EUIKIPDCB4LKNADB6D2CRT6UR7","download_json":"https://pith.science/pith/EUIKIPDCB4LKNADB6D2CRT6UR7.json","view_paper":"https://pith.science/paper/EUIKIPDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06989&json=true","fetch_graph":"https://pith.science/api/pith-number/EUIKIPDCB4LKNADB6D2CRT6UR7/graph.json","fetch_events":"https://pith.science/api/pith-number/EUIKIPDCB4LKNADB6D2CRT6UR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUIKIPDCB4LKNADB6D2CRT6UR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUIKIPDCB4LKNADB6D2CRT6UR7/action/storage_attestation","attest_author":"https://pith.science/pith/EUIKIPDCB4LKNADB6D2CRT6UR7/action/author_attestation","sign_citation":"https://pith.science/pith/EUIKIPDCB4LKNADB6D2CRT6UR7/action/citation_signature","submit_replication":"https://pith.science/pith/EUIKIPDCB4LKNADB6D2CRT6UR7/action/replication_record"}},"created_at":"2026-05-18T00:30:14.901372+00:00","updated_at":"2026-05-18T00:30:14.901372+00:00"}