{"total":30,"rows":[{"id":"2309.00814","title":"Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits","created":"2023-09-02","cited_by_count":19,"area":null},{"id":"2305.17301","title":"Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds","created":"2023-05-26","cited_by_count":15,"area":null},{"id":"2302.12370","title":"Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds","created":"2023-02-24","cited_by_count":14,"area":null},{"id":"2310.11550","title":"Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback","created":"2023-10-17","cited_by_count":13,"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":"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":"2403.05134","title":"Follow-the-Perturbed-Leader with Fr\\'{e}chet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds","created":"2024-03-08","cited_by_count":10,"area":null},{"id":"2410.12713","title":"How Does Variance Shape the Regret in Contextual Bandits?","created":"2024-10-16","cited_by_count":9,"area":null},{"id":"2305.15383","title":"On the Minimax Regret for Online Learning with Feedback Graphs","created":"2023-05-24","cited_by_count":8,"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":"2303.03272","title":"Accelerated Rates between Stochastic and Adversarial Online Convex Optimization","created":"2023-03-06","cited_by_count":7,"area":null},{"id":"2410.07533","title":"Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification","created":"2024-10-10","cited_by_count":7,"area":null},{"id":"2402.08127","title":"Efficient Contextual Bandits with Uninformed Feedback Graphs","created":"2024-02-12","cited_by_count":6,"area":null},{"id":"2307.07264","title":"On Interpolating Experts and Multi-Armed Bandits","created":"2023-07-14","cited_by_count":4,"area":null},{"id":"2402.10282","title":"Information Capacity Regret Bounds for Bandits with Mediator Feedback","created":"2024-02-15","cited_by_count":4,"area":null},{"id":"2403.03219","title":"LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits","created":"2024-03-05","cited_by_count":4,"area":null},{"id":"2402.08321","title":"Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring","created":"2024-02-13","cited_by_count":3,"area":null},{"id":"2405.20028","title":"A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $\\Theta(T^{2/3})$ and its Application to Best-of-Both-Worlds","created":"2024-05-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":"2312.16489","title":"Best-of-Both-Worlds Linear Contextual Bandits","created":"2023-12-27","cited_by_count":2,"area":null},{"id":"2505.24193","title":"Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback","created":"2025-05-30","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":"2510.17103","title":"Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback","created":"2025-10-20","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":"2502.00108","title":"Tracking Most Significant Shifts in Infinite-Armed Bandits","created":"2025-01-31","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":"2502.07514","title":"A Near-optimal, Scalable and Parallelizable Framework for Stochastic Bandits Robust to Adversarial Corruptions and Beyond","created":"2025-02-11","cited_by_count":0,"area":null},{"id":"2510.07424","title":"Best-of-Both Worlds for linear contextual bandits with paid observations","created":"2025-10-08","cited_by_count":0,"area":null},{"id":"2606.23414","title":"Leveraging Similarities in Multi-Armed Bandits","created":"2026-06-22","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}