{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CSVQUC5NATT2PVFJWFNDM5G5Q6","short_pith_number":"pith:CSVQUC5N","schema_version":"1.0","canonical_sha256":"14ab0a0bad04e7a7d4a9b15a3674dd87a519a1c4c0eecb84e5974059428f31ab","source":{"kind":"arxiv","id":"1712.00424","version":1},"attestation_state":"computed","paper":{"title":"The reparameterization trick for acquisition functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Frank Hutter, James T. Wilson, Marc Peter Deisenroth, Riccardo Moriconi","submitted_at":"2017-12-01T17:32:01Z","abstract_excerpt":"Bayesian optimization is a sample-efficient approach to solving global optimization problems. Along with a surrogate model, this approach relies on theoretically motivated value heuristics (acquisition functions) to guide the search process. Maximizing acquisition functions yields the best performance; unfortunately, this ideal is difficult to achieve since optimizing acquisition functions per se is frequently non-trivial. This statement is especially true in the parallel setting, where acquisition functions are routinely non-convex, high-dimensional, and intractable. Here, we demonstrate how "},"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":"1712.00424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-01T17:32:01Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"ec97f70f68a28a450479388db290fda4364b91108b4df5e81ebfc513129dd186","abstract_canon_sha256":"4c4fa2266c8b58e4521dd3697115908c9ba512a92d1e9c9cb572fb5a50dc706f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:06.265037Z","signature_b64":"I0peDwoo0jZLp2HdXzndKpiIBFcsIch2BgCVMx9r4lTneEna5aWb7a66wn/IA6UCJCzZVE0gD/eyOAkDPaKCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14ab0a0bad04e7a7d4a9b15a3674dd87a519a1c4c0eecb84e5974059428f31ab","last_reissued_at":"2026-05-18T00:29:06.264552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:06.264552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The reparameterization trick for acquisition functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Frank Hutter, James T. Wilson, Marc Peter Deisenroth, Riccardo Moriconi","submitted_at":"2017-12-01T17:32:01Z","abstract_excerpt":"Bayesian optimization is a sample-efficient approach to solving global optimization problems. Along with a surrogate model, this approach relies on theoretically motivated value heuristics (acquisition functions) to guide the search process. Maximizing acquisition functions yields the best performance; unfortunately, this ideal is difficult to achieve since optimizing acquisition functions per se is frequently non-trivial. This statement is especially true in the parallel setting, where acquisition functions are routinely non-convex, high-dimensional, and intractable. Here, we demonstrate how "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00424","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":"1712.00424","created_at":"2026-05-18T00:29:06.264637+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.00424v1","created_at":"2026-05-18T00:29:06.264637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00424","created_at":"2026-05-18T00:29:06.264637+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSVQUC5NATT2","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSVQUC5NATT2PVFJ","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSVQUC5N","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06454","citing_title":"ORTHOBO: Orthogonal Bayesian Hyperparameter Optimization","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04578","citing_title":"Physics-informed automated surface reconstructing via low-energy electron diffraction based on Bayesian optimization","ref_index":72,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6","json":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6.json","graph_json":"https://pith.science/api/pith-number/CSVQUC5NATT2PVFJWFNDM5G5Q6/graph.json","events_json":"https://pith.science/api/pith-number/CSVQUC5NATT2PVFJWFNDM5G5Q6/events.json","paper":"https://pith.science/paper/CSVQUC5N"},"agent_actions":{"view_html":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6","download_json":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6.json","view_paper":"https://pith.science/paper/CSVQUC5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.00424&json=true","fetch_graph":"https://pith.science/api/pith-number/CSVQUC5NATT2PVFJWFNDM5G5Q6/graph.json","fetch_events":"https://pith.science/api/pith-number/CSVQUC5NATT2PVFJWFNDM5G5Q6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6/action/storage_attestation","attest_author":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6/action/author_attestation","sign_citation":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6/action/citation_signature","submit_replication":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6/action/replication_record"}},"created_at":"2026-05-18T00:29:06.264637+00:00","updated_at":"2026-05-18T00:29:06.264637+00:00"}