{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LK2JT7W3E6BWF5JRT3UMZBVFRO","short_pith_number":"pith:LK2JT7W3","schema_version":"1.0","canonical_sha256":"5ab499fedb278362f5319ee8cc86a58b9ce2c65d0fe3818054ddc94865fa7b10","source":{"kind":"arxiv","id":"1206.6402","version":1},"attestation_state":"computed","paper":{"title":"Parallelizing Exploration-Exploitation Tradeoffs with Gaussian Process Bandit Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Krause (ETH Zurich), Joel Burdick (California Inst. of Technology), Thomas Desautels (California Inst. of Technology)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"Can one parallelize complex exploration exploitation tradeoffs? As an example, consider the problem of optimal high-throughput experimental design, where we wish to sequentially design batches of experiments in order to simultaneously learn a surrogate function mapping stimulus to response and identify the maximum of the function. We formalize the task as a multi-armed bandit problem, where the unknown payoff function is sampled from a Gaussian process (GP), and instead of a single arm, in each round we pull a batch of several arms in parallel. We develop GP-BUCB, a principled algorithm for ch"},"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":"1206.6402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"38faa6d71cdf0ae61604fabbf76578a8b319fa3742f203f2b1b7c859f5fc8a96","abstract_canon_sha256":"3b95657e0f076dcc921ae993c0fba7e592b9aefde2596a95b39dd39633990503"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:14.425428Z","signature_b64":"NndimimZGAYHvESX8hegkVU8QZdvk9TZtdAoN1Nnc815WshtG4Gr2pHpBOCq7gQlwDafHizq6wPGk9DBbFW0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ab499fedb278362f5319ee8cc86a58b9ce2c65d0fe3818054ddc94865fa7b10","last_reissued_at":"2026-05-18T03:52:14.424657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:14.424657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallelizing Exploration-Exploitation Tradeoffs with Gaussian Process Bandit Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Krause (ETH Zurich), Joel Burdick (California Inst. of Technology), Thomas Desautels (California Inst. of Technology)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"Can one parallelize complex exploration exploitation tradeoffs? As an example, consider the problem of optimal high-throughput experimental design, where we wish to sequentially design batches of experiments in order to simultaneously learn a surrogate function mapping stimulus to response and identify the maximum of the function. We formalize the task as a multi-armed bandit problem, where the unknown payoff function is sampled from a Gaussian process (GP), and instead of a single arm, in each round we pull a batch of several arms in parallel. We develop GP-BUCB, a principled algorithm for ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6402","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":"1206.6402","created_at":"2026-05-18T03:52:14.424786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6402v1","created_at":"2026-05-18T03:52:14.424786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6402","created_at":"2026-05-18T03:52:14.424786+00:00"},{"alias_kind":"pith_short_12","alias_value":"LK2JT7W3E6BW","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LK2JT7W3E6BWF5JR","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LK2JT7W3","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17071","citing_title":"Fast, Precise Thompson Sampling for Bayesian Optimization","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LK2JT7W3E6BWF5JRT3UMZBVFRO","json":"https://pith.science/pith/LK2JT7W3E6BWF5JRT3UMZBVFRO.json","graph_json":"https://pith.science/api/pith-number/LK2JT7W3E6BWF5JRT3UMZBVFRO/graph.json","events_json":"https://pith.science/api/pith-number/LK2JT7W3E6BWF5JRT3UMZBVFRO/events.json","paper":"https://pith.science/paper/LK2JT7W3"},"agent_actions":{"view_html":"https://pith.science/pith/LK2JT7W3E6BWF5JRT3UMZBVFRO","download_json":"https://pith.science/pith/LK2JT7W3E6BWF5JRT3UMZBVFRO.json","view_paper":"https://pith.science/paper/LK2JT7W3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6402&json=true","fetch_graph":"https://pith.science/api/pith-number/LK2JT7W3E6BWF5JRT3UMZBVFRO/graph.json","fetch_events":"https://pith.science/api/pith-number/LK2JT7W3E6BWF5JRT3UMZBVFRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LK2JT7W3E6BWF5JRT3UMZBVFRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LK2JT7W3E6BWF5JRT3UMZBVFRO/action/storage_attestation","attest_author":"https://pith.science/pith/LK2JT7W3E6BWF5JRT3UMZBVFRO/action/author_attestation","sign_citation":"https://pith.science/pith/LK2JT7W3E6BWF5JRT3UMZBVFRO/action/citation_signature","submit_replication":"https://pith.science/pith/LK2JT7W3E6BWF5JRT3UMZBVFRO/action/replication_record"}},"created_at":"2026-05-18T03:52:14.424786+00:00","updated_at":"2026-05-18T03:52:14.424786+00:00"}