{"total":16,"rows":[{"id":"2205.13451","title":"Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback","created":"2022-05-26","cited_by_count":17,"area":null},{"id":"2312.15433","title":"Best-of-Both-Worlds Algorithms for Linear Contextual Bandits","created":"2023-12-24","cited_by_count":11,"area":null},{"id":"2405.17968","title":"Matroid Semi-Bandits in Sublinear Time","created":"2024-05-28","cited_by_count":3,"area":null},{"id":"2409.20440","title":"Optimism in the Face of Ambiguity Principle for Multi-Armed Bandits","created":"2024-09-30","cited_by_count":3,"area":null},{"id":"2508.18604","title":"Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems","created":"2025-08-26","cited_by_count":3,"area":null},{"id":"2504.07307","title":"Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problems","created":"2025-04-09","cited_by_count":2,"area":null},{"id":"2508.18768","title":"Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits","created":"2025-08-26","cited_by_count":2,"area":null},{"id":"2311.00096","title":"Bandit-Driven Batch Selection for Robust Learning under Label Noise","created":"2023-10-31","cited_by_count":1,"area":null},{"id":"2503.02758","title":"Efficient and Optimal No-Regret Caching under Partial Observation","created":"2025-03-04","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":"2506.12490","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","created":"2025-06-14","cited_by_count":1,"area":null},{"id":"2510.12152","title":"Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicality","created":"2025-10-14","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":"2510.09425","title":"Bandits with Single-Peaked Preferences and Limited Resources","created":"2025-10-10","cited_by_count":0,"area":null},{"id":"2604.09423","title":"Offline Local Search for Online Stochastic Bandits","created":"2026-04-10","cited_by_count":0,"area":null},{"id":"2610.17818","title":"Follow the Perturbed Leader for Linear Bandits: $\\sqrt{T}$ Regret over General Convex Sets","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}