{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:CRVQ3XHIWUP276T7KPOZBI26HV","short_pith_number":"pith:CRVQ3XHI","schema_version":"1.0","canonical_sha256":"146b0ddce8b51faffa7f53dd90a35e3d7f474ba37ff986a790673949334c7fec","source":{"kind":"arxiv","id":"2201.12909","version":1},"attestation_state":"computed","paper":{"title":"Scaling Gaussian Process Optimization by Evaluating a Few Unique Candidates Multiple Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alessandro Lazaric, Daniele Calandriello, Lorenzo Rosasco, Luigi Carratino, Michal Valko","submitted_at":"2022-01-30T20:42:14Z","abstract_excerpt":"Computing a Gaussian process (GP) posterior has a computational cost cubical in the number of historical points. A reformulation of the same GP posterior highlights that this complexity mainly depends on how many \\emph{unique} historical points are considered. This can have important implication in active learning settings, where the set of historical points is constructed sequentially by the learner. We show that sequential black-box optimization based on GPs (GP-Opt) can be made efficient by sticking to a candidate solution for multiple evaluation steps and switch only when necessary. Limiti"},"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":"2201.12909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-01-30T20:42:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0a8c7e1a39099f11b1bf6d6dc688abe984d5f08292041f4f251484d5ec9d8946","abstract_canon_sha256":"46651130cf0c23d5739410d068523502e1384e1e0913119cedb1db8ca5974ddf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:40.986844Z","signature_b64":"glZ3SoL1ym5OORrvc8t87zBDQXfwRAZ9M5L2MDZL8whlAURQowQRSkTqliTFyGWSmuPDxTRWuFo4gO2WUDn4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"146b0ddce8b51faffa7f53dd90a35e3d7f474ba37ff986a790673949334c7fec","last_reissued_at":"2026-07-05T03:52:40.986372Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:40.986372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling Gaussian Process Optimization by Evaluating a Few Unique Candidates Multiple Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alessandro Lazaric, Daniele Calandriello, Lorenzo Rosasco, Luigi Carratino, Michal Valko","submitted_at":"2022-01-30T20:42:14Z","abstract_excerpt":"Computing a Gaussian process (GP) posterior has a computational cost cubical in the number of historical points. A reformulation of the same GP posterior highlights that this complexity mainly depends on how many \\emph{unique} historical points are considered. This can have important implication in active learning settings, where the set of historical points is constructed sequentially by the learner. We show that sequential black-box optimization based on GPs (GP-Opt) can be made efficient by sticking to a candidate solution for multiple evaluation steps and switch only when necessary. Limiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12909","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.12909/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2201.12909","created_at":"2026-07-05T03:52:40.986431+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12909v1","created_at":"2026-07-05T03:52:40.986431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12909","created_at":"2026-07-05T03:52:40.986431+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRVQ3XHIWUP2","created_at":"2026-07-05T03:52:40.986431+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRVQ3XHIWUP276T7","created_at":"2026-07-05T03:52:40.986431+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRVQ3XHI","created_at":"2026-07-05T03:52:40.986431+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/CRVQ3XHIWUP276T7KPOZBI26HV","json":"https://pith.science/pith/CRVQ3XHIWUP276T7KPOZBI26HV.json","graph_json":"https://pith.science/api/pith-number/CRVQ3XHIWUP276T7KPOZBI26HV/graph.json","events_json":"https://pith.science/api/pith-number/CRVQ3XHIWUP276T7KPOZBI26HV/events.json","paper":"https://pith.science/paper/CRVQ3XHI"},"agent_actions":{"view_html":"https://pith.science/pith/CRVQ3XHIWUP276T7KPOZBI26HV","download_json":"https://pith.science/pith/CRVQ3XHIWUP276T7KPOZBI26HV.json","view_paper":"https://pith.science/paper/CRVQ3XHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12909&json=true","fetch_graph":"https://pith.science/api/pith-number/CRVQ3XHIWUP276T7KPOZBI26HV/graph.json","fetch_events":"https://pith.science/api/pith-number/CRVQ3XHIWUP276T7KPOZBI26HV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRVQ3XHIWUP276T7KPOZBI26HV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRVQ3XHIWUP276T7KPOZBI26HV/action/storage_attestation","attest_author":"https://pith.science/pith/CRVQ3XHIWUP276T7KPOZBI26HV/action/author_attestation","sign_citation":"https://pith.science/pith/CRVQ3XHIWUP276T7KPOZBI26HV/action/citation_signature","submit_replication":"https://pith.science/pith/CRVQ3XHIWUP276T7KPOZBI26HV/action/replication_record"}},"created_at":"2026-07-05T03:52:40.986431+00:00","updated_at":"2026-07-05T03:52:40.986431+00:00"}