{"total":29,"rows":[{"id":"2201.11921","title":"Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Bandits","created":"2022-01-28","cited_by_count":18,"area":null},{"id":"2102.12769","title":"No-Regret Reinforcement Learning with Heavy-Tailed Rewards","created":"2021-02-25","cited_by_count":14,"area":null},{"id":"2209.13694","title":"Safe Linear Bandits over Unknown Polytopes","created":"2022-09-27","cited_by_count":14,"area":null},{"id":"2306.06836","title":"Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds","created":"2023-06-12","cited_by_count":14,"area":null},{"id":"2402.01096","title":"Trustworthy Distributed AI Systems: Robustness, Privacy, and Governance","created":"2024-02-02","cited_by_count":14,"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":"2306.11455","title":"Provably Robust Temporal Difference Learning for Heavy-Tailed Rewards","created":"2023-06-20","cited_by_count":9,"area":null},{"id":"2110.13876","title":"Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs","created":"2021-10-26","cited_by_count":8,"area":null},{"id":"2301.09680","title":"Quantum Heavy-tailed Bandits","created":"2023-01-23","cited_by_count":8,"area":null},{"id":"2303.05606","title":"Variance-aware robust reinforcement learning with linear function approximation under heavy-tailed rewards","created":"2023-03-09","cited_by_count":8,"area":null},{"id":"2404.17709","title":"Low-rank Matrix Bandits with Heavy-tailed Rewards","created":"2024-04-26","cited_by_count":7,"area":null},{"id":"2203.03186","title":"Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm","created":"2022-03-07","cited_by_count":6,"area":null},{"id":"2406.18370","title":"Learning pure quantum states (almost) without regret","created":"2024-06-26","cited_by_count":6,"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":"2410.10258","title":"Revisiting Matrix Sketching in Linear Bandits: Achieving Sublinear Regret via Dyadic Block Sketching","created":"2024-10-14","cited_by_count":4,"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":"2202.00081","title":"On solutions of the distributional Bellman equation","created":"2022-01-31","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":"2512.11580","title":"Safe Bayesian optimization across noise models via scenario programming","created":"2025-12-12","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":"2202.08302","title":"Cost-Efficient Distributed Learning via Combinatorial Multi-Armed Bandits","created":"2022-02-16","cited_by_count":0,"area":null},{"id":"2510.03798","title":"Batched Bandits with Heavy-Tailed Rewards","created":"2025-10-04","cited_by_count":0,"area":null},{"id":"2603.15596","title":"Robust and Computationally Efficient Linear Contextual Bandits under Adversarial Corruption and Heavy-Tailed Noise","created":"2026-03-16","cited_by_count":0,"area":null},{"id":"2605.09019","title":"Learning Pure Quantum States in Any Dimension (Almost) Without Regret","created":"2026-05-09","cited_by_count":0,"area":null},{"id":"2607.07304","title":"Nonlinear Bandit","created":"2026-07-08","cited_by_count":0,"area":null},{"id":"2607.23679","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","created":"2026-07-26","cited_by_count":0,"area":null},{"id":"2608.10529","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","created":"2026-08-11","cited_by_count":0,"area":null}],"next_cursor":null}