{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DBCKFHAFFUEB34KY27O4WFD66Q","short_pith_number":"pith:DBCKFHAF","schema_version":"1.0","canonical_sha256":"1844a29c052d081df158d7ddcb147ef40da576455f9e9d13337e3447fa625e6e","source":{"kind":"arxiv","id":"1902.04228","version":3},"attestation_state":"computed","paper":{"title":"Multi-objective Bayesian optimisation with preferences over objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alistair Shilton, Majid Abdolshah, Santu Rana, Sunil Gupta, Svetha Venkatesh","submitted_at":"2019-02-12T03:47:16Z","abstract_excerpt":"We present a multi-objective Bayesian optimisation algorithm that allows the user to express preference-order constraints on the objectives of the type \"objective A is more important than objective B\". These preferences are defined based on the stability of the obtained solutions with respect to preferred objective functions. Rather than attempting to find a representative subset of the complete Pareto front, our algorithm selects those Pareto-optimal points that satisfy these constraints. We formulate a new acquisition function based on expected improvement in dominated hypervolume (EHI) to e"},"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":"1902.04228","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-12T03:47:16Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"8b7855c6e5ccfc90ee1d8d47997ee9254c3442edd6e13b929eb2fa56d9926887","abstract_canon_sha256":"0e3ca2e0e4857ad88b5afc8e52580015a2c4e739318cd62c865ad9f65483cd90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:18:50.612840Z","signature_b64":"wtT7+wjm5nEZHrslRdevxGqHvyZXmZDB1fN6lPZZVpc4GY5k8CnDf+iPGfXo+ySMF0SdN5yzrdalinc32y6bCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1844a29c052d081df158d7ddcb147ef40da576455f9e9d13337e3447fa625e6e","last_reissued_at":"2026-07-05T00:18:50.612398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:18:50.612398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-objective Bayesian optimisation with preferences over objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alistair Shilton, Majid Abdolshah, Santu Rana, Sunil Gupta, Svetha Venkatesh","submitted_at":"2019-02-12T03:47:16Z","abstract_excerpt":"We present a multi-objective Bayesian optimisation algorithm that allows the user to express preference-order constraints on the objectives of the type \"objective A is more important than objective B\". These preferences are defined based on the stability of the obtained solutions with respect to preferred objective functions. Rather than attempting to find a representative subset of the complete Pareto front, our algorithm selects those Pareto-optimal points that satisfy these constraints. We formulate a new acquisition function based on expected improvement in dominated hypervolume (EHI) to e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04228","kind":"arxiv","version":3},"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/1902.04228/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":"1902.04228","created_at":"2026-07-05T00:18:50.612464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.04228v3","created_at":"2026-07-05T00:18:50.612464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04228","created_at":"2026-07-05T00:18:50.612464+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBCKFHAFFUEB","created_at":"2026-07-05T00:18:50.612464+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBCKFHAFFUEB34KY","created_at":"2026-07-05T00:18:50.612464+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBCKFHAF","created_at":"2026-07-05T00:18:50.612464+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.17312","citing_title":"Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DBCKFHAFFUEB34KY27O4WFD66Q","json":"https://pith.science/pith/DBCKFHAFFUEB34KY27O4WFD66Q.json","graph_json":"https://pith.science/api/pith-number/DBCKFHAFFUEB34KY27O4WFD66Q/graph.json","events_json":"https://pith.science/api/pith-number/DBCKFHAFFUEB34KY27O4WFD66Q/events.json","paper":"https://pith.science/paper/DBCKFHAF"},"agent_actions":{"view_html":"https://pith.science/pith/DBCKFHAFFUEB34KY27O4WFD66Q","download_json":"https://pith.science/pith/DBCKFHAFFUEB34KY27O4WFD66Q.json","view_paper":"https://pith.science/paper/DBCKFHAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.04228&json=true","fetch_graph":"https://pith.science/api/pith-number/DBCKFHAFFUEB34KY27O4WFD66Q/graph.json","fetch_events":"https://pith.science/api/pith-number/DBCKFHAFFUEB34KY27O4WFD66Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBCKFHAFFUEB34KY27O4WFD66Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBCKFHAFFUEB34KY27O4WFD66Q/action/storage_attestation","attest_author":"https://pith.science/pith/DBCKFHAFFUEB34KY27O4WFD66Q/action/author_attestation","sign_citation":"https://pith.science/pith/DBCKFHAFFUEB34KY27O4WFD66Q/action/citation_signature","submit_replication":"https://pith.science/pith/DBCKFHAFFUEB34KY27O4WFD66Q/action/replication_record"}},"created_at":"2026-07-05T00:18:50.612464+00:00","updated_at":"2026-07-05T00:18:50.612464+00:00"}