{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QVROR4QGYQTVDUTIMLD4O5DSUL","short_pith_number":"pith:QVROR4QG","schema_version":"1.0","canonical_sha256":"8562e8f206c42751d26862c7c77472a2ebdf7ee512183948aefc66df14adae68","source":{"kind":"arxiv","id":"1611.08773","version":1},"attestation_state":"computed","paper":{"title":"Embedded Bandits for Large-Scale Black-Box Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Abdullah Al-Dujaili, S. Suresh","submitted_at":"2016-11-27T02:18:09Z","abstract_excerpt":"Random embedding has been applied with empirical success to large-scale black-box optimization problems with low effective dimensions. This paper proposes the EmbeddedHunter algorithm, which incorporates the technique in a hierarchical stochastic bandit setting, following the optimism in the face of uncertainty principle and breaking away from the multiple-run framework in which random embedding has been conventionally applied similar to stochastic black-box optimization solvers. Our proposition is motivated by the bounded mean variation in the objective value for a low-dimensional point proje"},"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":"1611.08773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-11-27T02:18:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"209399b2b441ef476e740b034ff31981ce36a3d37895a003a246bcbd9c6a8bca","abstract_canon_sha256":"bd092058235571eb4da23e04e57baa5281109f8801b8e17df0e990b5ba97a2af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:36.830495Z","signature_b64":"jwUrhzjsccPJ49vMgdRvHb6c7A4oBtdxHLoNQYscglXroKLwCcOQQerA3e6iW8qNSWSqtvi9Uqb5pN526fyaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8562e8f206c42751d26862c7c77472a2ebdf7ee512183948aefc66df14adae68","last_reissued_at":"2026-05-18T00:56:36.829790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:36.829790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedded Bandits for Large-Scale Black-Box Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Abdullah Al-Dujaili, S. Suresh","submitted_at":"2016-11-27T02:18:09Z","abstract_excerpt":"Random embedding has been applied with empirical success to large-scale black-box optimization problems with low effective dimensions. This paper proposes the EmbeddedHunter algorithm, which incorporates the technique in a hierarchical stochastic bandit setting, following the optimism in the face of uncertainty principle and breaking away from the multiple-run framework in which random embedding has been conventionally applied similar to stochastic black-box optimization solvers. Our proposition is motivated by the bounded mean variation in the objective value for a low-dimensional point proje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08773","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":"1611.08773","created_at":"2026-05-18T00:56:36.829895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08773v1","created_at":"2026-05-18T00:56:36.829895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08773","created_at":"2026-05-18T00:56:36.829895+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVROR4QGYQTV","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVROR4QGYQTVDUTI","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVROR4QG","created_at":"2026-05-18T12:30:41.710351+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/QVROR4QGYQTVDUTIMLD4O5DSUL","json":"https://pith.science/pith/QVROR4QGYQTVDUTIMLD4O5DSUL.json","graph_json":"https://pith.science/api/pith-number/QVROR4QGYQTVDUTIMLD4O5DSUL/graph.json","events_json":"https://pith.science/api/pith-number/QVROR4QGYQTVDUTIMLD4O5DSUL/events.json","paper":"https://pith.science/paper/QVROR4QG"},"agent_actions":{"view_html":"https://pith.science/pith/QVROR4QGYQTVDUTIMLD4O5DSUL","download_json":"https://pith.science/pith/QVROR4QGYQTVDUTIMLD4O5DSUL.json","view_paper":"https://pith.science/paper/QVROR4QG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08773&json=true","fetch_graph":"https://pith.science/api/pith-number/QVROR4QGYQTVDUTIMLD4O5DSUL/graph.json","fetch_events":"https://pith.science/api/pith-number/QVROR4QGYQTVDUTIMLD4O5DSUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVROR4QGYQTVDUTIMLD4O5DSUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVROR4QGYQTVDUTIMLD4O5DSUL/action/storage_attestation","attest_author":"https://pith.science/pith/QVROR4QGYQTVDUTIMLD4O5DSUL/action/author_attestation","sign_citation":"https://pith.science/pith/QVROR4QGYQTVDUTIMLD4O5DSUL/action/citation_signature","submit_replication":"https://pith.science/pith/QVROR4QGYQTVDUTIMLD4O5DSUL/action/replication_record"}},"created_at":"2026-05-18T00:56:36.829895+00:00","updated_at":"2026-05-18T00:56:36.829895+00:00"}