Co-occurring keywords · papers mentioning both
Papers
Learning Periodic Strategies in Blocking Bandits Is as Hard as Bandits with Switching Costs
COLT 2026
The Image as Its Own Reward: Reinforcement Learning with Adversarial Reward for Image Generation
CVPR 2026
BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms
ICML 2025
Multi-agent Multi-armed Bandit Regret Complexity and Optimality
AISTATS 2025
Horizon-free Reinforcement Learning in Adversarial Linear Mixture MDPs
ICLR 2024
Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
NeurIPS 2024
Provably Efficient Reinforcement Learning for Adversarial Restless Multi-Armed Bandits with Unknown Transitions and Bandit Feedback
ICML 2024
Dynamic Regret of Adversarial Linear Mixture MDPs
NeurIPS 2023
Near-optimal Policy Optimization Algorithms for Learning Adversarial Linear Mixture MDPs
AISTATS 2022
Adaptive Discretization for Adversarial Lipschitz Bandits
COLT 2021
Regularized Policies are Reward Robust
AISTATS 2021
Improved Sleeping Bandits with Stochastic Action Sets and Adversarial Rewards
ICML 2020
Provably Efficient Exploration in Policy Optimization
ICML 2020
Large Scale Markov Decision Processes with Changing Rewards
NeurIPS 2019
Best of both worlds: Stochastic & adversarial best-arm identification
COLT 2018
The Best of Both Worlds: Stochastic and Adversarial Bandits
COLT 2012