{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:34QEHLSHHX2LRPJRWVINOGVPVB","short_pith_number":"pith:34QEHLSH","schema_version":"1.0","canonical_sha256":"df2043ae473df4b8bd31b550d71aafa86950edbd4c088aa2d3bde037e477a00c","source":{"kind":"arxiv","id":"2605.22191","version":1},"attestation_state":"computed","paper":{"title":"Bandit Convex Optimization with Gradient Prediction Adaptivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Adarsh Barik, Shuche Wang, Vincent Y. F. Tan","submitted_at":"2026-05-21T08:57:38Z","abstract_excerpt":"Bandit convex optimization (BCO) is a fundamental online learning framework with partial feedback, where the learner observes only the loss incurred at the chosen decision point in each round. In this work, we investigate whether optimistic gradient predictions can improve worst-case regret guarantees in a prediction-adaptive manner. Specifically, given gradient predictions $m_t$, we seek regret bounds that scale with the cumulative prediction error $S_T=\\sum_{t=1}^T \\|\\nabla f_t(x_t)-m_t\\|^2.$ We first establish a negative result: under the single-point feedback protocol, an unavoidable $\\Ome"},"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":"2605.22191","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-21T08:57:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"37f7413008feafee877d2c72201124f1760e4f862736812fa39817c1292d3ef9","abstract_canon_sha256":"d9c97106b643960eb93906f6fefd9f0f8e03d59eb4814988bda0423ec986d876"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:31.091530Z","signature_b64":"GJpnk1obzDpY8BUWHJIn9fJxtiF+69nz8+FIg5/NiZlB+qaxkudi7B+lDjzH7dH8Vofboq1FTN6ZPBS9qYX3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df2043ae473df4b8bd31b550d71aafa86950edbd4c088aa2d3bde037e477a00c","last_reissued_at":"2026-05-22T01:04:31.090782Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:31.090782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bandit Convex Optimization with Gradient Prediction Adaptivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Adarsh Barik, Shuche Wang, Vincent Y. F. Tan","submitted_at":"2026-05-21T08:57:38Z","abstract_excerpt":"Bandit convex optimization (BCO) is a fundamental online learning framework with partial feedback, where the learner observes only the loss incurred at the chosen decision point in each round. In this work, we investigate whether optimistic gradient predictions can improve worst-case regret guarantees in a prediction-adaptive manner. Specifically, given gradient predictions $m_t$, we seek regret bounds that scale with the cumulative prediction error $S_T=\\sum_{t=1}^T \\|\\nabla f_t(x_t)-m_t\\|^2.$ We first establish a negative result: under the single-point feedback protocol, an unavoidable $\\Ome"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22191","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/2605.22191/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":"2605.22191","created_at":"2026-05-22T01:04:31.090918+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22191v1","created_at":"2026-05-22T01:04:31.090918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22191","created_at":"2026-05-22T01:04:31.090918+00:00"},{"alias_kind":"pith_short_12","alias_value":"34QEHLSHHX2L","created_at":"2026-05-22T01:04:31.090918+00:00"},{"alias_kind":"pith_short_16","alias_value":"34QEHLSHHX2LRPJR","created_at":"2026-05-22T01:04:31.090918+00:00"},{"alias_kind":"pith_short_8","alias_value":"34QEHLSH","created_at":"2026-05-22T01:04:31.090918+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/34QEHLSHHX2LRPJRWVINOGVPVB","json":"https://pith.science/pith/34QEHLSHHX2LRPJRWVINOGVPVB.json","graph_json":"https://pith.science/api/pith-number/34QEHLSHHX2LRPJRWVINOGVPVB/graph.json","events_json":"https://pith.science/api/pith-number/34QEHLSHHX2LRPJRWVINOGVPVB/events.json","paper":"https://pith.science/paper/34QEHLSH"},"agent_actions":{"view_html":"https://pith.science/pith/34QEHLSHHX2LRPJRWVINOGVPVB","download_json":"https://pith.science/pith/34QEHLSHHX2LRPJRWVINOGVPVB.json","view_paper":"https://pith.science/paper/34QEHLSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22191&json=true","fetch_graph":"https://pith.science/api/pith-number/34QEHLSHHX2LRPJRWVINOGVPVB/graph.json","fetch_events":"https://pith.science/api/pith-number/34QEHLSHHX2LRPJRWVINOGVPVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34QEHLSHHX2LRPJRWVINOGVPVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34QEHLSHHX2LRPJRWVINOGVPVB/action/storage_attestation","attest_author":"https://pith.science/pith/34QEHLSHHX2LRPJRWVINOGVPVB/action/author_attestation","sign_citation":"https://pith.science/pith/34QEHLSHHX2LRPJRWVINOGVPVB/action/citation_signature","submit_replication":"https://pith.science/pith/34QEHLSHHX2LRPJRWVINOGVPVB/action/replication_record"}},"created_at":"2026-05-22T01:04:31.090918+00:00","updated_at":"2026-05-22T01:04:31.090918+00:00"}