{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:L2PJJ44F7Z3YM5YDSN5MQC5UBA","short_pith_number":"pith:L2PJJ44F","schema_version":"1.0","canonical_sha256":"5e9e94f385fe77867703937ac80bb4080cbe6be17c6d52037cc06db9fe71761b","source":{"kind":"arxiv","id":"2303.01774","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Optimization over High-Dimensional Combinatorial Spaces via Dictionary-based Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aryan Deshwal, David Eriksson, Eytan Bakshy, Janardhan Rao Doppa, Maximilian Balandat, Sebastian Ament","submitted_at":"2023-03-03T08:31:42Z","abstract_excerpt":"We consider the problem of optimizing expensive black-box functions over high-dimensional combinatorial spaces which arises in many science, engineering, and ML applications. We use Bayesian Optimization (BO) and propose a novel surrogate modeling approach for efficiently handling a large number of binary and categorical parameters. The key idea is to select a number of discrete structures from the input space (the dictionary) and use them to define an ordinal embedding for high-dimensional combinatorial structures. This allows us to use existing Gaussian process models for continuous spaces. "},"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":"2303.01774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-03T08:31:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b09033bd12fd0608408160c941813271cb9fd256a3be777a2afbe4f3f030153d","abstract_canon_sha256":"6efe53e10b4f0491af3366a2fec58da1c013f8492ed787f88c32cc6b1630feb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:47:48.753663Z","signature_b64":"Duy2OkMMAMG6Wkz+2KDDLU/d/s3LDEpNqD8AVSSU+HMhgPLl4cn2bP+BQitmad2unLa+za4NVTVge8dmSOzwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e9e94f385fe77867703937ac80bb4080cbe6be17c6d52037cc06db9fe71761b","last_reissued_at":"2026-07-05T05:47:48.753117Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:47:48.753117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Optimization over High-Dimensional Combinatorial Spaces via Dictionary-based Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aryan Deshwal, David Eriksson, Eytan Bakshy, Janardhan Rao Doppa, Maximilian Balandat, Sebastian Ament","submitted_at":"2023-03-03T08:31:42Z","abstract_excerpt":"We consider the problem of optimizing expensive black-box functions over high-dimensional combinatorial spaces which arises in many science, engineering, and ML applications. We use Bayesian Optimization (BO) and propose a novel surrogate modeling approach for efficiently handling a large number of binary and categorical parameters. The key idea is to select a number of discrete structures from the input space (the dictionary) and use them to define an ordinal embedding for high-dimensional combinatorial structures. This allows us to use existing Gaussian process models for continuous spaces. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.01774","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/2303.01774/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":"2303.01774","created_at":"2026-07-05T05:47:48.753185+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.01774v1","created_at":"2026-07-05T05:47:48.753185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01774","created_at":"2026-07-05T05:47:48.753185+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2PJJ44F7Z3Y","created_at":"2026-07-05T05:47:48.753185+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2PJJ44F7Z3YM5YD","created_at":"2026-07-05T05:47:48.753185+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2PJJ44F","created_at":"2026-07-05T05:47:48.753185+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25241","citing_title":"Categorical Optimization with Bayesian Anchored Latent Trust Regions for Structural Design under High-Dimensional Uncertainty","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L2PJJ44F7Z3YM5YDSN5MQC5UBA","json":"https://pith.science/pith/L2PJJ44F7Z3YM5YDSN5MQC5UBA.json","graph_json":"https://pith.science/api/pith-number/L2PJJ44F7Z3YM5YDSN5MQC5UBA/graph.json","events_json":"https://pith.science/api/pith-number/L2PJJ44F7Z3YM5YDSN5MQC5UBA/events.json","paper":"https://pith.science/paper/L2PJJ44F"},"agent_actions":{"view_html":"https://pith.science/pith/L2PJJ44F7Z3YM5YDSN5MQC5UBA","download_json":"https://pith.science/pith/L2PJJ44F7Z3YM5YDSN5MQC5UBA.json","view_paper":"https://pith.science/paper/L2PJJ44F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.01774&json=true","fetch_graph":"https://pith.science/api/pith-number/L2PJJ44F7Z3YM5YDSN5MQC5UBA/graph.json","fetch_events":"https://pith.science/api/pith-number/L2PJJ44F7Z3YM5YDSN5MQC5UBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2PJJ44F7Z3YM5YDSN5MQC5UBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2PJJ44F7Z3YM5YDSN5MQC5UBA/action/storage_attestation","attest_author":"https://pith.science/pith/L2PJJ44F7Z3YM5YDSN5MQC5UBA/action/author_attestation","sign_citation":"https://pith.science/pith/L2PJJ44F7Z3YM5YDSN5MQC5UBA/action/citation_signature","submit_replication":"https://pith.science/pith/L2PJJ44F7Z3YM5YDSN5MQC5UBA/action/replication_record"}},"created_at":"2026-07-05T05:47:48.753185+00:00","updated_at":"2026-07-05T05:47:48.753185+00:00"}