{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NLEXZ2CMELFRFBZVEL6C4ACFQG","short_pith_number":"pith:NLEXZ2CM","schema_version":"1.0","canonical_sha256":"6ac97ce84c22cb12873522fc2e004581a27e4879ed96c9eb99ff0ca64e7130db","source":{"kind":"arxiv","id":"2002.02820","version":1},"attestation_state":"computed","paper":{"title":"Noisy-Input Entropy Search for Efficient Robust Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Christian Daniel, Edgar D. Klenske, Julia Vinogradska, Lukas P. Fr\\\"ohlich, Melanie N. Zeilinger","submitted_at":"2020-02-07T14:48:16Z","abstract_excerpt":"We consider the problem of robust optimization within the well-established Bayesian optimization (BO) framework. While BO is intrinsically robust to noisy evaluations of the objective function, standard approaches do not consider the case of uncertainty about the input parameters. In this paper, we propose Noisy-Input Entropy Search (NES), a novel information-theoretic acquisition function that is designed to find robust optima for problems with both input and measurement noise. NES is based on the key insight that the robust objective in many cases can be modeled as a Gaussian process, howeve"},"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":"2002.02820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-07T14:48:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2f1657d4e7fa220bf0761df6b3877fac839e0d4729fb2cd06053f8663eac2460","abstract_canon_sha256":"dbb31ab8c100e9dd850e8fd287316e13a58a17e94b0572634d3b9cf6fea045a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:38:59.658466Z","signature_b64":"TQ+Oh1XlNbCRCJtfjwxBi3qiyEJq1q9roWxdoKen9giUOseQ9Z7E63YlSoz2MdsYvu54AEjCi6NC11xbpNMIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ac97ce84c22cb12873522fc2e004581a27e4879ed96c9eb99ff0ca64e7130db","last_reissued_at":"2026-07-05T00:38:59.658043Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:38:59.658043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noisy-Input Entropy Search for Efficient Robust Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Christian Daniel, Edgar D. Klenske, Julia Vinogradska, Lukas P. Fr\\\"ohlich, Melanie N. Zeilinger","submitted_at":"2020-02-07T14:48:16Z","abstract_excerpt":"We consider the problem of robust optimization within the well-established Bayesian optimization (BO) framework. While BO is intrinsically robust to noisy evaluations of the objective function, standard approaches do not consider the case of uncertainty about the input parameters. In this paper, we propose Noisy-Input Entropy Search (NES), a novel information-theoretic acquisition function that is designed to find robust optima for problems with both input and measurement noise. NES is based on the key insight that the robust objective in many cases can be modeled as a Gaussian process, howeve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.02820","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/2002.02820/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":"2002.02820","created_at":"2026-07-05T00:38:59.658103+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.02820v1","created_at":"2026-07-05T00:38:59.658103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02820","created_at":"2026-07-05T00:38:59.658103+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLEXZ2CMELFR","created_at":"2026-07-05T00:38:59.658103+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLEXZ2CMELFRFBZV","created_at":"2026-07-05T00:38:59.658103+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLEXZ2CM","created_at":"2026-07-05T00:38:59.658103+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.16272","citing_title":"Learning Explainable Dense Reward Shapes via Bayesian Optimization","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NLEXZ2CMELFRFBZVEL6C4ACFQG","json":"https://pith.science/pith/NLEXZ2CMELFRFBZVEL6C4ACFQG.json","graph_json":"https://pith.science/api/pith-number/NLEXZ2CMELFRFBZVEL6C4ACFQG/graph.json","events_json":"https://pith.science/api/pith-number/NLEXZ2CMELFRFBZVEL6C4ACFQG/events.json","paper":"https://pith.science/paper/NLEXZ2CM"},"agent_actions":{"view_html":"https://pith.science/pith/NLEXZ2CMELFRFBZVEL6C4ACFQG","download_json":"https://pith.science/pith/NLEXZ2CMELFRFBZVEL6C4ACFQG.json","view_paper":"https://pith.science/paper/NLEXZ2CM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.02820&json=true","fetch_graph":"https://pith.science/api/pith-number/NLEXZ2CMELFRFBZVEL6C4ACFQG/graph.json","fetch_events":"https://pith.science/api/pith-number/NLEXZ2CMELFRFBZVEL6C4ACFQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLEXZ2CMELFRFBZVEL6C4ACFQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLEXZ2CMELFRFBZVEL6C4ACFQG/action/storage_attestation","attest_author":"https://pith.science/pith/NLEXZ2CMELFRFBZVEL6C4ACFQG/action/author_attestation","sign_citation":"https://pith.science/pith/NLEXZ2CMELFRFBZVEL6C4ACFQG/action/citation_signature","submit_replication":"https://pith.science/pith/NLEXZ2CMELFRFBZVEL6C4ACFQG/action/replication_record"}},"created_at":"2026-07-05T00:38:59.658103+00:00","updated_at":"2026-07-05T00:38:59.658103+00:00"}