{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XPGUIWN4UKOW5UTMCBLJUSNK72","short_pith_number":"pith:XPGUIWN4","schema_version":"1.0","canonical_sha256":"bbcd4459bca29d6ed26c10569a49aafeb602081e076cefe4de23a265c439239e","source":{"kind":"arxiv","id":"2406.06506","version":1},"attestation_state":"computed","paper":{"title":"Online Newton Method for Bandit Convex Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Dirk van der Hoeven, Hidde Fokkema, Jack J. Mayo, Tor Lattimore","submitted_at":"2024-06-10T17:44:11Z","abstract_excerpt":"We introduce a computationally efficient algorithm for zeroth-order bandit convex optimisation and prove that in the adversarial setting its regret is at most $d^{3.5} \\sqrt{n} \\mathrm{polylog}(n, d)$ with high probability where $d$ is the dimension and $n$ is the time horizon. In the stochastic setting the bound improves to $M d^{2} \\sqrt{n} \\mathrm{polylog}(n, d)$ where $M \\in [d^{-1/2}, d^{-1 / 4}]$ is a constant that depends on the geometry of the constraint set and the desired computational properties."},"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":"2406.06506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-10T17:44:11Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b6550624da062ba01f8efd87958cce93486dc59a828dffa3b6b8bdad7790d747","abstract_canon_sha256":"c91de867f240b1cdaf9edb9ce57282450ace57a0e3f79d5e6d8e7feb13302be7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:43.352651Z","signature_b64":"YoRI6yv76IcRh8eLtEYVHLfurXMPOkVvONe3coR5+2bsm2kC+/TtkzyvJccnrdzKDPRhTCFQG47hP2IeuwCoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbcd4459bca29d6ed26c10569a49aafeb602081e076cefe4de23a265c439239e","last_reissued_at":"2026-07-05T08:29:43.352184Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:43.352184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Newton Method for Bandit Convex Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Dirk van der Hoeven, Hidde Fokkema, Jack J. Mayo, Tor Lattimore","submitted_at":"2024-06-10T17:44:11Z","abstract_excerpt":"We introduce a computationally efficient algorithm for zeroth-order bandit convex optimisation and prove that in the adversarial setting its regret is at most $d^{3.5} \\sqrt{n} \\mathrm{polylog}(n, d)$ with high probability where $d$ is the dimension and $n$ is the time horizon. In the stochastic setting the bound improves to $M d^{2} \\sqrt{n} \\mathrm{polylog}(n, d)$ where $M \\in [d^{-1/2}, d^{-1 / 4}]$ is a constant that depends on the geometry of the constraint set and the desired computational properties."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.06506","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/2406.06506/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":"2406.06506","created_at":"2026-07-05T08:29:43.352239+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.06506v1","created_at":"2026-07-05T08:29:43.352239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.06506","created_at":"2026-07-05T08:29:43.352239+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPGUIWN4UKOW","created_at":"2026-07-05T08:29:43.352239+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPGUIWN4UKOW5UTM","created_at":"2026-07-05T08:29:43.352239+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPGUIWN4","created_at":"2026-07-05T08:29:43.352239+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15411","citing_title":"Harnessing Unimodality in Semiparametric Contextual Pricing via Oracle Price Map Learning","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XPGUIWN4UKOW5UTMCBLJUSNK72","json":"https://pith.science/pith/XPGUIWN4UKOW5UTMCBLJUSNK72.json","graph_json":"https://pith.science/api/pith-number/XPGUIWN4UKOW5UTMCBLJUSNK72/graph.json","events_json":"https://pith.science/api/pith-number/XPGUIWN4UKOW5UTMCBLJUSNK72/events.json","paper":"https://pith.science/paper/XPGUIWN4"},"agent_actions":{"view_html":"https://pith.science/pith/XPGUIWN4UKOW5UTMCBLJUSNK72","download_json":"https://pith.science/pith/XPGUIWN4UKOW5UTMCBLJUSNK72.json","view_paper":"https://pith.science/paper/XPGUIWN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.06506&json=true","fetch_graph":"https://pith.science/api/pith-number/XPGUIWN4UKOW5UTMCBLJUSNK72/graph.json","fetch_events":"https://pith.science/api/pith-number/XPGUIWN4UKOW5UTMCBLJUSNK72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPGUIWN4UKOW5UTMCBLJUSNK72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPGUIWN4UKOW5UTMCBLJUSNK72/action/storage_attestation","attest_author":"https://pith.science/pith/XPGUIWN4UKOW5UTMCBLJUSNK72/action/author_attestation","sign_citation":"https://pith.science/pith/XPGUIWN4UKOW5UTMCBLJUSNK72/action/citation_signature","submit_replication":"https://pith.science/pith/XPGUIWN4UKOW5UTMCBLJUSNK72/action/replication_record"}},"created_at":"2026-07-05T08:29:43.352239+00:00","updated_at":"2026-07-05T08:29:43.352239+00:00"}