{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GWK5P5BDCORYR3TCIXUSCSJDR2","short_pith_number":"pith:GWK5P5BD","schema_version":"1.0","canonical_sha256":"3595d7f42313a388ee6245e92149238e9527ed8437b72bff5f83f965e122781d","source":{"kind":"arxiv","id":"1904.02642","version":5},"attestation_state":"computed","paper":{"title":"Meta-Learning Acquisition Functions for Transfer Learning in Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Andreas Doerr, Christian Daniel, Frank Hutter, Kirsten Fischer, Lukas P. Fr\\\"ohlich, Michael Volpp, Stefan Falkner","submitted_at":"2019-04-04T16:27:06Z","abstract_excerpt":"Transferring knowledge across tasks to improve data-efficiency is one of the open key challenges in the field of global black-box optimization. Readily available algorithms are typically designed to be universal optimizers and, therefore, often suboptimal for specific tasks. We propose a novel transfer learning method to obtain customized optimizers within the well-established framework of Bayesian optimization, allowing our algorithm to utilize the proven generalization capabilities of Gaussian processes. Using reinforcement learning to meta-train an acquisition function (AF) on a set of rela"},"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":"1904.02642","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-04-04T16:27:06Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"836167ef63070fef5ff773eb5c3f99a50c9e2ec2d67e39cee8b00b332e93321e","abstract_canon_sha256":"728138a03e0f002b6819d3eedd9d6065ba657220e38aca71b2b39631d7cc42ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:42.787065Z","signature_b64":"l+KNJgsIvidN8B1/v2UcI42N7aCiW2LjURR6Ias8vY1EDBgYQj7b1Fu5RWpScw2ouYowfRV/Nf2U9A+PsqlbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3595d7f42313a388ee6245e92149238e9527ed8437b72bff5f83f965e122781d","last_reissued_at":"2026-07-05T00:40:42.786512Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:42.786512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Meta-Learning Acquisition Functions for Transfer Learning in Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Andreas Doerr, Christian Daniel, Frank Hutter, Kirsten Fischer, Lukas P. Fr\\\"ohlich, Michael Volpp, Stefan Falkner","submitted_at":"2019-04-04T16:27:06Z","abstract_excerpt":"Transferring knowledge across tasks to improve data-efficiency is one of the open key challenges in the field of global black-box optimization. Readily available algorithms are typically designed to be universal optimizers and, therefore, often suboptimal for specific tasks. We propose a novel transfer learning method to obtain customized optimizers within the well-established framework of Bayesian optimization, allowing our algorithm to utilize the proven generalization capabilities of Gaussian processes. Using reinforcement learning to meta-train an acquisition function (AF) on a set of rela"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02642","kind":"arxiv","version":5},"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/1904.02642/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":"1904.02642","created_at":"2026-07-05T00:40:42.786576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.02642v5","created_at":"2026-07-05T00:40:42.786576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02642","created_at":"2026-07-05T00:40:42.786576+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWK5P5BDCORY","created_at":"2026-07-05T00:40:42.786576+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWK5P5BDCORYR3TC","created_at":"2026-07-05T00:40:42.786576+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWK5P5BD","created_at":"2026-07-05T00:40:42.786576+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.25404","citing_title":"SemanticOpt: Towards LLM-Based Semantic Black-Box Optimization","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12005","citing_title":"BayMOTH: Bayesian optiMizatiOn with meTa-lookahead -- a simple approacH","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GWK5P5BDCORYR3TCIXUSCSJDR2","json":"https://pith.science/pith/GWK5P5BDCORYR3TCIXUSCSJDR2.json","graph_json":"https://pith.science/api/pith-number/GWK5P5BDCORYR3TCIXUSCSJDR2/graph.json","events_json":"https://pith.science/api/pith-number/GWK5P5BDCORYR3TCIXUSCSJDR2/events.json","paper":"https://pith.science/paper/GWK5P5BD"},"agent_actions":{"view_html":"https://pith.science/pith/GWK5P5BDCORYR3TCIXUSCSJDR2","download_json":"https://pith.science/pith/GWK5P5BDCORYR3TCIXUSCSJDR2.json","view_paper":"https://pith.science/paper/GWK5P5BD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.02642&json=true","fetch_graph":"https://pith.science/api/pith-number/GWK5P5BDCORYR3TCIXUSCSJDR2/graph.json","fetch_events":"https://pith.science/api/pith-number/GWK5P5BDCORYR3TCIXUSCSJDR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWK5P5BDCORYR3TCIXUSCSJDR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWK5P5BDCORYR3TCIXUSCSJDR2/action/storage_attestation","attest_author":"https://pith.science/pith/GWK5P5BDCORYR3TCIXUSCSJDR2/action/author_attestation","sign_citation":"https://pith.science/pith/GWK5P5BDCORYR3TCIXUSCSJDR2/action/citation_signature","submit_replication":"https://pith.science/pith/GWK5P5BDCORYR3TCIXUSCSJDR2/action/replication_record"}},"created_at":"2026-07-05T00:40:42.786576+00:00","updated_at":"2026-07-05T00:40:42.786576+00:00"}