{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VWTVGWFHSZX4FBLVMSAJWDUVE7","short_pith_number":"pith:VWTVGWFH","schema_version":"1.0","canonical_sha256":"ada75358a7966fc2857564809b0e9527d369ba241c58496feaebf1b989e05e25","source":{"kind":"arxiv","id":"1012.2599","version":1},"attestation_state":"computed","paper":{"title":"A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eric Brochu, Nando de Freitas, Vlad M. Cora","submitted_at":"2010-12-12T22:53:04Z","abstract_excerpt":"We present a tutorial on Bayesian optimization, a method of finding the maximum of expensive cost functions. Bayesian optimization employs the Bayesian technique of setting a prior over the objective function and combining it with evidence to get a posterior function. This permits a utility-based selection of the next observation to make on the objective function, which must take into account both exploration (sampling from areas of high uncertainty) and exploitation (sampling areas likely to offer improvement over the current best observation). We also present two detailed extensions of Bayes"},"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":"1012.2599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-12-12T22:53:04Z","cross_cats_sorted":[],"title_canon_sha256":"64faab88ec4416d630ebb4bdcc3d6bd87d3558e169cd9ba716f6f8484d732a5f","abstract_canon_sha256":"52d5ffd44a307a522ad048d722a1da9b7d733bfbe028dac6ce5c509abc49d06b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:28.208520Z","signature_b64":"K4qqca6Am6tmzq2+sD/FyuXYPp8wokQH5nFrblA9IrnKSXtRUNglDRhew0CHMR2QieYANJYydmdUGvkHx/M4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ada75358a7966fc2857564809b0e9527d369ba241c58496feaebf1b989e05e25","last_reissued_at":"2026-05-18T04:33:28.207406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:28.207406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eric Brochu, Nando de Freitas, Vlad M. Cora","submitted_at":"2010-12-12T22:53:04Z","abstract_excerpt":"We present a tutorial on Bayesian optimization, a method of finding the maximum of expensive cost functions. Bayesian optimization employs the Bayesian technique of setting a prior over the objective function and combining it with evidence to get a posterior function. This permits a utility-based selection of the next observation to make on the objective function, which must take into account both exploration (sampling from areas of high uncertainty) and exploitation (sampling areas likely to offer improvement over the current best observation). We also present two detailed extensions of Bayes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2599","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":"1012.2599","created_at":"2026-05-18T04:33:28.207505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2599v1","created_at":"2026-05-18T04:33:28.207505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2599","created_at":"2026-05-18T04:33:28.207505+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWTVGWFHSZX4","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWTVGWFHSZX4FBLV","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWTVGWFH","created_at":"2026-05-18T12:26:15.391820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":29,"internal_anchor_count":19,"sample":[{"citing_arxiv_id":"1906.09340","citing_title":"Leveraging Reinforcement Learning Techniques for Effective Policy Adoption and Validation","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"1906.09459","citing_title":"Bayesian Optimization with Directionally Constrained Search","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"1907.05381","citing_title":"Adaptive Pricing in Insurance: Generalized Linear Models and Gaussian Process Regression Approaches","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"1907.08392","citing_title":"Automated Machine Learning in Practice: State of the Art and Recent Results","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"1907.09065","citing_title":"Accelerating Experimental Design by Incorporating Experimenter Hunches","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"1907.09695","citing_title":"Adaptive Compression-based Lifelong Learning","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2405.14657","citing_title":"Anchor-Based Heteroscedastic Noise for Preferential Bayesian Optimization","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2411.00171","citing_title":"EARL-BO: Reinforcement Learning for Multi-Step Lookahead, High-Dimensional Bayesian Optimization","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2504.03943","citing_title":"Multi-Variable Batch Bayesian Optimization in Materials Research: Synthetic Data Analysis of Noise Sensitivity and Problem Landscape Effects","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20854","citing_title":"Finite-Time Regret Analysis of Retry-Aware Bandits","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16071","citing_title":"Active Learning MPC Objective Functions from Preferences","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17976","citing_title":"Unleashing LLMs in Bayesian Optimization: Preference-Guided Framework for Scientific Discovery","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19151","citing_title":"Progressive Autonomy as Preference Learning: A Formalization of Trust Calibration for Agentic Tool Use","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19494","citing_title":"High-Throughput Bayesian Optimization of Cement-Salt Hydrates Composites for Seasonal Thermochemical Energy Storage","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19760","citing_title":"Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2507.10253","citing_title":"Optimization of a cosmic muon tomography scanner for cargo border control inspection","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2510.00044","citing_title":"Optimized Fish Locomotion using Design-by-Morphing and Bayesian Optimization","ref_index":48,"is_internal_anchor":true},{"citing_arxiv_id":"2512.07407","citing_title":"Training Language Models to Use Prolog as a Tool","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2603.23777","citing_title":"Human-in-the-Loop Pareto Optimization: Trade-off Characterization for Assist-as-Needed Training and Performance Evaluation","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03614","citing_title":"Neural Global Optimization via Iterative Refinement from Noisy Samples","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"1807.02811","citing_title":"A Tutorial on Bayesian Optimization","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27243","citing_title":"Estimating Decision Uncertainty from Preference Uncertainty: Application to Ground Vehicle Design","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08461","citing_title":"Bayesian Optimization of Crossbar-Based Compute-In-Memory System Design for Efficient DNN Inference","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20125","citing_title":"Autonomous operation of the DIAG0 diagnostic line for 6D phase-space monitoring at LCLS-II","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07863","citing_title":"ADKO: Agentic Decentralized Knowledge Optimization","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VWTVGWFHSZX4FBLVMSAJWDUVE7","json":"https://pith.science/pith/VWTVGWFHSZX4FBLVMSAJWDUVE7.json","graph_json":"https://pith.science/api/pith-number/VWTVGWFHSZX4FBLVMSAJWDUVE7/graph.json","events_json":"https://pith.science/api/pith-number/VWTVGWFHSZX4FBLVMSAJWDUVE7/events.json","paper":"https://pith.science/paper/VWTVGWFH"},"agent_actions":{"view_html":"https://pith.science/pith/VWTVGWFHSZX4FBLVMSAJWDUVE7","download_json":"https://pith.science/pith/VWTVGWFHSZX4FBLVMSAJWDUVE7.json","view_paper":"https://pith.science/paper/VWTVGWFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2599&json=true","fetch_graph":"https://pith.science/api/pith-number/VWTVGWFHSZX4FBLVMSAJWDUVE7/graph.json","fetch_events":"https://pith.science/api/pith-number/VWTVGWFHSZX4FBLVMSAJWDUVE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWTVGWFHSZX4FBLVMSAJWDUVE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWTVGWFHSZX4FBLVMSAJWDUVE7/action/storage_attestation","attest_author":"https://pith.science/pith/VWTVGWFHSZX4FBLVMSAJWDUVE7/action/author_attestation","sign_citation":"https://pith.science/pith/VWTVGWFHSZX4FBLVMSAJWDUVE7/action/citation_signature","submit_replication":"https://pith.science/pith/VWTVGWFHSZX4FBLVMSAJWDUVE7/action/replication_record"}},"created_at":"2026-05-18T04:33:28.207505+00:00","updated_at":"2026-05-18T04:33:28.207505+00:00"}