{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6TU24P7OW43T6QXEHCCMXCDXTJ","short_pith_number":"pith:6TU24P7O","schema_version":"1.0","canonical_sha256":"f4e9ae3feeb7373f42e43884cb88779a74cf55e11f30ad627631242d9ec8de42","source":{"kind":"arxiv","id":"2607.18652","version":1},"attestation_state":"computed","paper":{"title":"The Price of Hidden Curvature: An $\\widetilde{\\Omega} (d^{5/4} \\sqrt{T})$ Lower Bound for Bandit Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Nived Rajaraman","submitted_at":"2026-07-21T02:44:33Z","abstract_excerpt":"We establish a $\\widetilde\\Omega(d^{5/4}\\sqrt T)$ lower bound on the minimax expected regret of stochastic bandit convex optimization of $1$-Lipschitz functions on the Euclidean ball. This presents the first nontrivial regret lower bound that grows faster than $d\\sqrt{T}$ for this problem, establishing that stochastic bandit convex optimization is fundamentally harder than linear bandits.\n  The hard class of convex functions we construct takes the following form in dimension $2d$: for an action $a = (a^1,a^2) \\in \\mathbb{B}^{2d}_2$, each function is the scaled soft maximum of a \"tube\", $r^{-1}"},"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":"2607.18652","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-07-21T02:44:33Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"f13188ac1c7d7a5b940066d59460e22bb2a2eff7390df9d1a66fbb1e9615f1cf","abstract_canon_sha256":"e857a282657573ba9e90cd643b8288c39050deba26663d72e205adde4d03eef7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T00:22:58.602482Z","signature_b64":"X8JAcLMUrbDHNbH4GTAN1RMkhyzu6OvnOIwLVr+mcIwqmO0gfvyPVxjj6wT2hd7o+DmWRObglzRD0xOG2625Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4e9ae3feeb7373f42e43884cb88779a74cf55e11f30ad627631242d9ec8de42","last_reissued_at":"2026-07-22T00:22:58.601658Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T00:22:58.601658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Price of Hidden Curvature: An $\\widetilde{\\Omega} (d^{5/4} \\sqrt{T})$ Lower Bound for Bandit Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Nived Rajaraman","submitted_at":"2026-07-21T02:44:33Z","abstract_excerpt":"We establish a $\\widetilde\\Omega(d^{5/4}\\sqrt T)$ lower bound on the minimax expected regret of stochastic bandit convex optimization of $1$-Lipschitz functions on the Euclidean ball. This presents the first nontrivial regret lower bound that grows faster than $d\\sqrt{T}$ for this problem, establishing that stochastic bandit convex optimization is fundamentally harder than linear bandits.\n  The hard class of convex functions we construct takes the following form in dimension $2d$: for an action $a = (a^1,a^2) \\in \\mathbb{B}^{2d}_2$, each function is the scaled soft maximum of a \"tube\", $r^{-1}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.18652","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/2607.18652/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":"2607.18652","created_at":"2026-07-22T00:22:58.602078+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.18652v1","created_at":"2026-07-22T00:22:58.602078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.18652","created_at":"2026-07-22T00:22:58.602078+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TU24P7OW43T","created_at":"2026-07-22T00:22:58.602078+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TU24P7OW43T6QXE","created_at":"2026-07-22T00:22:58.602078+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TU24P7O","created_at":"2026-07-22T00:22:58.602078+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/6TU24P7OW43T6QXEHCCMXCDXTJ","json":"https://pith.science/pith/6TU24P7OW43T6QXEHCCMXCDXTJ.json","graph_json":"https://pith.science/api/pith-number/6TU24P7OW43T6QXEHCCMXCDXTJ/graph.json","events_json":"https://pith.science/api/pith-number/6TU24P7OW43T6QXEHCCMXCDXTJ/events.json","paper":"https://pith.science/paper/6TU24P7O"},"agent_actions":{"view_html":"https://pith.science/pith/6TU24P7OW43T6QXEHCCMXCDXTJ","download_json":"https://pith.science/pith/6TU24P7OW43T6QXEHCCMXCDXTJ.json","view_paper":"https://pith.science/paper/6TU24P7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.18652&json=true","fetch_graph":"https://pith.science/api/pith-number/6TU24P7OW43T6QXEHCCMXCDXTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6TU24P7OW43T6QXEHCCMXCDXTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TU24P7OW43T6QXEHCCMXCDXTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TU24P7OW43T6QXEHCCMXCDXTJ/action/storage_attestation","attest_author":"https://pith.science/pith/6TU24P7OW43T6QXEHCCMXCDXTJ/action/author_attestation","sign_citation":"https://pith.science/pith/6TU24P7OW43T6QXEHCCMXCDXTJ/action/citation_signature","submit_replication":"https://pith.science/pith/6TU24P7OW43T6QXEHCCMXCDXTJ/action/replication_record"}},"created_at":"2026-07-22T00:22:58.602078+00:00","updated_at":"2026-07-22T00:22:58.602078+00:00"}