Co-occurring keywords
Papers
Bandits with Concave Aggregated Reward
IJCAI 2024
Safe Reinforcement Learning with Instantaneous Constraints: The Role of Aggressive Exploration
AAAI 2024
Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously
NIPS 2024
Think Before You Duel: Understanding Complexities of Preference Learning under Constrained Resources
AISTATS 2024
Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
AISTATS 2024
Maximizing utility in multi-agent environments by anticipating the behavior of other learners
NIPS 2024
Combinatorial Stochastic-Greedy Bandit
AAAI 2024
Forced Exploration in Bandit Problems
AAAI 2024
Sum-max Submodular Bandits
AISTATS 2024