{"total":17,"rows":[{"id":"2302.09739","title":"A Blackbox Approach to Best of Both Worlds in Bandits and Beyond","created":"2023-02-20","cited_by_count":30,"area":null},{"id":"2207.14550","title":"Best-of-Both-Worlds Algorithms for Partial Monitoring","created":"2022-07-29","cited_by_count":19,"area":null},{"id":"2310.18701","title":"Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards","created":"2023-10-28","cited_by_count":11,"area":null},{"id":"2403.00715","title":"Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds","created":"2024-03-01","cited_by_count":11,"area":null},{"id":"2410.03284","title":"uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs","created":"2024-10-04","cited_by_count":8,"area":null},{"id":"2503.00419","title":"Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update","created":"2025-03-01","cited_by_count":5,"area":null},{"id":"2506.04775","title":"Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards","created":"2025-06-05","cited_by_count":4,"area":null},{"id":"2402.07062","title":"Fast UCB-type algorithms for stochastic bandits with heavy and super heavy symmetric noise","created":"2024-02-10","cited_by_count":3,"area":null},{"id":"2502.02486","title":"Catoni Contextual Bandits are Robust to Heavy-tailed Rewards","created":"2025-02-04","cited_by_count":3,"area":null},{"id":"2506.01722","title":"When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses","created":"2025-06-02","cited_by_count":2,"area":null},{"id":"2305.06743","title":"Implicitly normalized forecaster with clipping for linear and non-linear heavy-tailed multi-armed bandits","created":"2023-05-11","cited_by_count":1,"area":null},{"id":"2505.21790","title":"Faster Rates for Private Adversarial Bandits","created":"2025-05-27","cited_by_count":1,"area":null},{"id":"2602.01295","title":"Best-of-Both-Worlds for Heavy-Tailed Markov Decision Processes","created":"2026-02-01","cited_by_count":1,"area":null},{"id":"2606.06043","title":"Adaptive Learning Rates with Surrogate Probability for Follow-the-Perturbed-Leader","created":"2026-06-04","cited_by_count":1,"area":null},{"id":"2606.14929","title":"Policy Regret for Embedding Model Routing: Contextual Bandits with Low-Rank Experts","created":"2026-06-12","cited_by_count":1,"area":null},{"id":"2310.02975","title":"$(\\epsilon, u)$-Adaptive Regret Minimization in Heavy-Tailed Bandits","created":"2023-10-04","cited_by_count":0,"area":null},{"id":"2610.14904","title":"Prediction with Expert Advice under Heavy-Tailed Losses","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}