{"ID":2829658,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2512.11201","arxiv_id":"2512.11201","title":"Fast EXP3 Algorithms","abstract":"We point out that EXP3 can be implemented in constant time per round, propose more practical algorithms, and analyze the trade-offs between the regret bounds and time complexities of these algorithms.","short_abstract":"We point out that EXP3 can be implemented in constant time per round, propose more practical algorithms, and analyze the trade-offs between the regret bounds and time complexities of these algorithms.","url_abs":"https://arxiv.org/abs/2512.11201","url_pdf":"https://arxiv.org/pdf/2512.11201v1","authors":"[\"Ryoma Sato\",\"Shinji Ito\"]","published":"2025-12-12T01:18:32Z","proceeding":"cs.LG","tasks":"[\"cs.LG\",\"cs.AI\",\"cs.DS\"]","methods":"[]","has_code":false}