{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:B6GYN4TXWQF52L5MPULKSKPMA4","short_pith_number":"pith:B6GYN4TX","schema_version":"1.0","canonical_sha256":"0f8d86f277b40bdd2fac7d16a929ec0733bb1c50a6423b494b36d841860374d0","source":{"kind":"arxiv","id":"2402.07062","version":1},"attestation_state":"computed","paper":{"title":"Fast UCB-type algorithms for stochastic bandits with heavy and super heavy symmetric noise","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aleksandr Katrutsa, Andrey Pudovikov, Ilgam Latypov, Yuriy Dorn","submitted_at":"2024-02-10T22:38:21Z","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"},"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":"2402.07062","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-10T22:38:21Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"f2247151e274a015262ba42bacb9ad1faab50c50c9bb172215ab12c2bb0daa28","abstract_canon_sha256":"a21480425b5caed86414b4b90e0601c91b709db6d9bf954be66265c60f465f55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:43.259954Z","signature_b64":"5VipLK6/3BhH5GRFO9V9nv4Ya04DDPV3pyM9NslvRJEfOh0rcIGohSKjwv5WSXZHrAkz7Q6wX/pRyA+RQwOCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f8d86f277b40bdd2fac7d16a929ec0733bb1c50a6423b494b36d841860374d0","last_reissued_at":"2026-07-05T07:43:43.259541Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:43.259541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast UCB-type algorithms for stochastic bandits with heavy and super heavy symmetric noise","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aleksandr Katrutsa, Andrey Pudovikov, Ilgam Latypov, Yuriy Dorn","submitted_at":"2024-02-10T22:38:21Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07062","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/2402.07062/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":"2402.07062","created_at":"2026-07-05T07:43:43.259600+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.07062v1","created_at":"2026-07-05T07:43:43.259600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07062","created_at":"2026-07-05T07:43:43.259600+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6GYN4TXWQF5","created_at":"2026-07-05T07:43:43.259600+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6GYN4TXWQF52L5M","created_at":"2026-07-05T07:43:43.259600+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6GYN4TX","created_at":"2026-07-05T07:43:43.259600+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/B6GYN4TXWQF52L5MPULKSKPMA4","json":"https://pith.science/pith/B6GYN4TXWQF52L5MPULKSKPMA4.json","graph_json":"https://pith.science/api/pith-number/B6GYN4TXWQF52L5MPULKSKPMA4/graph.json","events_json":"https://pith.science/api/pith-number/B6GYN4TXWQF52L5MPULKSKPMA4/events.json","paper":"https://pith.science/paper/B6GYN4TX"},"agent_actions":{"view_html":"https://pith.science/pith/B6GYN4TXWQF52L5MPULKSKPMA4","download_json":"https://pith.science/pith/B6GYN4TXWQF52L5MPULKSKPMA4.json","view_paper":"https://pith.science/paper/B6GYN4TX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.07062&json=true","fetch_graph":"https://pith.science/api/pith-number/B6GYN4TXWQF52L5MPULKSKPMA4/graph.json","fetch_events":"https://pith.science/api/pith-number/B6GYN4TXWQF52L5MPULKSKPMA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6GYN4TXWQF52L5MPULKSKPMA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6GYN4TXWQF52L5MPULKSKPMA4/action/storage_attestation","attest_author":"https://pith.science/pith/B6GYN4TXWQF52L5MPULKSKPMA4/action/author_attestation","sign_citation":"https://pith.science/pith/B6GYN4TXWQF52L5MPULKSKPMA4/action/citation_signature","submit_replication":"https://pith.science/pith/B6GYN4TXWQF52L5MPULKSKPMA4/action/replication_record"}},"created_at":"2026-07-05T07:43:43.259600+00:00","updated_at":"2026-07-05T07:43:43.259600+00:00"}