{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OIPJMHIR7Y7J7TW66DKXTOBAKD","short_pith_number":"pith:OIPJMHIR","schema_version":"1.0","canonical_sha256":"721e961d11fe3e9fcedef0d579b82050ea92addd211789db076e11aa26f21af7","source":{"kind":"arxiv","id":"1802.05400","version":1},"attestation_state":"computed","paper":{"title":"High Dimensional Bayesian Optimization Using Dropout","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Alistair Shilton, Cheng Li, Santu Rana, Sunil Gupta, Svetha Venkatesh, Vu Nguyen","submitted_at":"2018-02-15T04:30:59Z","abstract_excerpt":"Scaling Bayesian optimization to high dimensions is challenging task as the global optimization of high-dimensional acquisition function can be expensive and often infeasible. Existing methods depend either on limited active variables or the additive form of the objective function. We propose a new method for high-dimensional Bayesian optimization, that uses a dropout strategy to optimize only a subset of variables at each iteration. We derive theoretical bounds for the regret and show how it can inform the derivation of our algorithm. We demonstrate the efficacy of our algorithms for optimiza"},"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":"1802.05400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-15T04:30:59Z","cross_cats_sorted":[],"title_canon_sha256":"a0281bc037869430e02a1b0948917a5c054b5852bea3d37afd4713008ef8af43","abstract_canon_sha256":"7838e7ccae573c690ffa2b7010e679aff0501a765b7ababb7dd53e12354e6eb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:15.788762Z","signature_b64":"IbL0yXfRgCh+b+Qat9+Edhmd8cEIB10jOeoNhUJ6gc0Hyu2op6XO1G8nwijlqvGSpHJy94eLeLkiMe4z0KN2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"721e961d11fe3e9fcedef0d579b82050ea92addd211789db076e11aa26f21af7","last_reissued_at":"2026-05-18T00:23:15.788060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:15.788060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High Dimensional Bayesian Optimization Using Dropout","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Alistair Shilton, Cheng Li, Santu Rana, Sunil Gupta, Svetha Venkatesh, Vu Nguyen","submitted_at":"2018-02-15T04:30:59Z","abstract_excerpt":"Scaling Bayesian optimization to high dimensions is challenging task as the global optimization of high-dimensional acquisition function can be expensive and often infeasible. Existing methods depend either on limited active variables or the additive form of the objective function. We propose a new method for high-dimensional Bayesian optimization, that uses a dropout strategy to optimize only a subset of variables at each iteration. We derive theoretical bounds for the regret and show how it can inform the derivation of our algorithm. We demonstrate the efficacy of our algorithms for optimiza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05400","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":""},"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":"1802.05400","created_at":"2026-05-18T00:23:15.788179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.05400v1","created_at":"2026-05-18T00:23:15.788179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05400","created_at":"2026-05-18T00:23:15.788179+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIPJMHIR7Y7J","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIPJMHIR7Y7J7TW6","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIPJMHIR","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OIPJMHIR7Y7J7TW66DKXTOBAKD","json":"https://pith.science/pith/OIPJMHIR7Y7J7TW66DKXTOBAKD.json","graph_json":"https://pith.science/api/pith-number/OIPJMHIR7Y7J7TW66DKXTOBAKD/graph.json","events_json":"https://pith.science/api/pith-number/OIPJMHIR7Y7J7TW66DKXTOBAKD/events.json","paper":"https://pith.science/paper/OIPJMHIR"},"agent_actions":{"view_html":"https://pith.science/pith/OIPJMHIR7Y7J7TW66DKXTOBAKD","download_json":"https://pith.science/pith/OIPJMHIR7Y7J7TW66DKXTOBAKD.json","view_paper":"https://pith.science/paper/OIPJMHIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.05400&json=true","fetch_graph":"https://pith.science/api/pith-number/OIPJMHIR7Y7J7TW66DKXTOBAKD/graph.json","fetch_events":"https://pith.science/api/pith-number/OIPJMHIR7Y7J7TW66DKXTOBAKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIPJMHIR7Y7J7TW66DKXTOBAKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIPJMHIR7Y7J7TW66DKXTOBAKD/action/storage_attestation","attest_author":"https://pith.science/pith/OIPJMHIR7Y7J7TW66DKXTOBAKD/action/author_attestation","sign_citation":"https://pith.science/pith/OIPJMHIR7Y7J7TW66DKXTOBAKD/action/citation_signature","submit_replication":"https://pith.science/pith/OIPJMHIR7Y7J7TW66DKXTOBAKD/action/replication_record"}},"created_at":"2026-05-18T00:23:15.788179+00:00","updated_at":"2026-05-18T00:23:15.788179+00:00"}