{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:B6GYN4TXWQF52L5MPULKSKPMA4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a21480425b5caed86414b4b90e0601c91b709db6d9bf954be66265c60f465f55","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-10T22:38:21Z","title_canon_sha256":"f2247151e274a015262ba42bacb9ad1faab50c50c9bb172215ab12c2bb0daa28"},"schema_version":"1.0","source":{"id":"2402.07062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.07062","created_at":"2026-07-05T07:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"2402.07062v1","created_at":"2026-07-05T07:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07062","created_at":"2026-07-05T07:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"B6GYN4TXWQF5","created_at":"2026-07-05T07:43:43Z"},{"alias_kind":"pith_short_16","alias_value":"B6GYN4TXWQF52L5M","created_at":"2026-07-05T07:43:43Z"},{"alias_kind":"pith_short_8","alias_value":"B6GYN4TX","created_at":"2026-07-05T07:43:43Z"}],"graph_snapshots":[{"event_id":"sha256:468930f647c97715b16ac673fb9bd54647d081f74da2a84d58ce13828aac3ff2","target":"graph","created_at":"2026-07-05T07:43:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.07062/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this study, we propose a new method for constructing UCB-type algorithms for stochastic multi-armed bandits based on general convex optimization methods with an inexact oracle. We derive the regret bounds corresponding to the convergence rates of the optimization methods. We propose a new algorithm Clipped-SGD-UCB and show, both theoretically and empirically, that in the case of symmetric noise in the reward, we can achieve an $O(\\log T\\sqrt{KT\\log T})$ regret bound instead of $O\\left (T^{\\frac{1}{1+\\alpha}} K^{\\frac{\\alpha}{1+\\alpha}} \\right)$ for the case when the reward distribution sati","authors_text":"Aleksandr Katrutsa, Andrey Pudovikov, Ilgam Latypov, Yuriy Dorn","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-10T22:38:21Z","title":"Fast UCB-type algorithms for stochastic bandits with heavy and super heavy symmetric noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07062","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:141d83942c73c6b44b87efbfaf8cc0ab918e6e29132af722b52ad470ff14cce4","target":"record","created_at":"2026-07-05T07:43:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a21480425b5caed86414b4b90e0601c91b709db6d9bf954be66265c60f465f55","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-10T22:38:21Z","title_canon_sha256":"f2247151e274a015262ba42bacb9ad1faab50c50c9bb172215ab12c2bb0daa28"},"schema_version":"1.0","source":{"id":"2402.07062","kind":"arxiv","version":1}},"canonical_sha256":"0f8d86f277b40bdd2fac7d16a929ec0733bb1c50a6423b494b36d841860374d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f8d86f277b40bdd2fac7d16a929ec0733bb1c50a6423b494b36d841860374d0","first_computed_at":"2026-07-05T07:43:43.259541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:43:43.259541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5VipLK6/3BhH5GRFO9V9nv4Ya04DDPV3pyM9NslvRJEfOh0rcIGohSKjwv5WSXZHrAkz7Q6wX/pRyA+RQwOCAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:43:43.259954Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.07062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:141d83942c73c6b44b87efbfaf8cc0ab918e6e29132af722b52ad470ff14cce4","sha256:468930f647c97715b16ac673fb9bd54647d081f74da2a84d58ce13828aac3ff2"],"state_sha256":"f6cf25cca8d2fec535dae972adb14a768662d8b2cf05e2113f754c9f9eb00f4b"}