Co-occurring keywords
Papers
Forced Exploration in Bandit Problems
AAAI 2024
When Is Inductive Inference Possible?
NIPS 2024
Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal
NIPS 2024
Bandits with Concave Aggregated Reward
IJCAI 2024
Bandits with Ranking Feedback
NIPS 2024
Safe Reinforcement Learning with Instantaneous Constraints: The Role of Aggressive Exploration
AAAI 2024
Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs
AAAI 2024
Achieving $\tilde{O}(1/\epsilon)$ Sample Complexity for Constrained Markov Decision Process
NIPS 2024
Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition
AISTATS 2024