{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:55IGERONLPJZKZPOC6ZDI6L5ZZ","short_pith_number":"pith:55IGERON","schema_version":"1.0","canonical_sha256":"ef506245cd5bd39565ee17b234797dce74fb9b56e0e4e0272c4365819884bcbf","source":{"kind":"arxiv","id":"2105.08195","version":2},"attestation_state":"computed","paper":{"title":"Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eytan Bakshy, Maximilian Balandat, Samuel Daulton","submitted_at":"2021-05-17T23:31:42Z","abstract_excerpt":"Optimizing multiple competing black-box objectives is a challenging problem in many fields, including science, engineering, and machine learning. Multi-objective Bayesian optimization (MOBO) is a sample-efficient approach for identifying the optimal trade-offs between the objectives. However, many existing methods perform poorly when the observations are corrupted by noise. We propose a novel acquisition function, NEHVI, that overcomes this important practical limitation by applying a Bayesian treatment to the popular expected hypervolume improvement (EHVI) criterion and integrating over this "},"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":"2105.08195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-17T23:31:42Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"99ca6f8d868524fb878ec9464c8783bc77e0e36aefae07a37196b3f8912b802d","abstract_canon_sha256":"0e823edd383369d5b41e165cca926d1f026c129de8e78dfbc9d4c64e9d6e1fdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:26:16.979473Z","signature_b64":"XBl+/ESDgPxMc2DrX9ZYfyoy39yt2K/w9s8F+zP0ycoaWxtp+YHIaABRZVbeDO+v2bu6DRsRhJ5yvJnwYANDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef506245cd5bd39565ee17b234797dce74fb9b56e0e4e0272c4365819884bcbf","last_reissued_at":"2026-07-05T03:26:16.978938Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:26:16.978938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eytan Bakshy, Maximilian Balandat, Samuel Daulton","submitted_at":"2021-05-17T23:31:42Z","abstract_excerpt":"Optimizing multiple competing black-box objectives is a challenging problem in many fields, including science, engineering, and machine learning. Multi-objective Bayesian optimization (MOBO) is a sample-efficient approach for identifying the optimal trade-offs between the objectives. However, many existing methods perform poorly when the observations are corrupted by noise. We propose a novel acquisition function, NEHVI, that overcomes this important practical limitation by applying a Bayesian treatment to the popular expected hypervolume improvement (EHVI) criterion and integrating over this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.08195","kind":"arxiv","version":2},"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/2105.08195/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":"2105.08195","created_at":"2026-07-05T03:26:16.979008+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.08195v2","created_at":"2026-07-05T03:26:16.979008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.08195","created_at":"2026-07-05T03:26:16.979008+00:00"},{"alias_kind":"pith_short_12","alias_value":"55IGERONLPJZ","created_at":"2026-07-05T03:26:16.979008+00:00"},{"alias_kind":"pith_short_16","alias_value":"55IGERONLPJZKZPO","created_at":"2026-07-05T03:26:16.979008+00:00"},{"alias_kind":"pith_short_8","alias_value":"55IGERON","created_at":"2026-07-05T03:26:16.979008+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.15954","citing_title":"MobileLLM-Flash: Latency-Guided On-Device LLM Design for Industry Scale Deployment","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ","json":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ.json","graph_json":"https://pith.science/api/pith-number/55IGERONLPJZKZPOC6ZDI6L5ZZ/graph.json","events_json":"https://pith.science/api/pith-number/55IGERONLPJZKZPOC6ZDI6L5ZZ/events.json","paper":"https://pith.science/paper/55IGERON"},"agent_actions":{"view_html":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ","download_json":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ.json","view_paper":"https://pith.science/paper/55IGERON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.08195&json=true","fetch_graph":"https://pith.science/api/pith-number/55IGERONLPJZKZPOC6ZDI6L5ZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/55IGERONLPJZKZPOC6ZDI6L5ZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ/action/storage_attestation","attest_author":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ/action/author_attestation","sign_citation":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ/action/citation_signature","submit_replication":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ/action/replication_record"}},"created_at":"2026-07-05T03:26:16.979008+00:00","updated_at":"2026-07-05T03:26:16.979008+00:00"}