Co-occurring keywords · papers mentioning both
Papers
Generalized Data Distribution Iteration
ICML 2022
Planning to the Information Horizon of BAMDPs via Epistemic State Abstraction
NeurIPS 2022
Achieving Fairness in the Stochastic Multi-Armed Bandit Problem
JMLR 2021
An Efficient Algorithm For Generalized Linear Bandit: Online Stochastic Gradient Descent and Thompson Sampling
AISTATS 2021
A Probabilistic Interpretation of Self-Paced Learning with Applications to Reinforcement Learning
JMLR 2021
Bandit Quickest Changepoint Detection
NeurIPS 2021
Corralling Stochastic Bandit Algorithms
AISTATS 2021
Deciding What to Learn: A Rate-Distortion Approach
ICML 2021
Improved POMDP Tree Search Planning with Prioritized Action Branching
AAAI 2021
Adaptive Double-Exploration Tradeoff for Outlier Detection
AAAI 2020
Exploration Analysis in Finite-Horizon Turn-based Stochastic Games
UAI 2020
Learning to Plan in High Dimensions via Neural Exploration-Exploitation Trees
ICLR 2020
Linear Bandits with Feature Feedback
AAAI 2020
Multi-Player Bandits: The Adversarial Case
JMLR 2020
Regret Minimisation in Multi-Armed Bandits Using Bounded Arm Memory
AAAI 2020
Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits
NeurIPS 2020
Thompson Sampling Algorithms for Mean-Variance Bandits
ICML 2020
Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits
COLT 2020
What Can Learned Intrinsic Rewards Capture?
ICML 2020
Curriculum-guided Hindsight Experience Replay
NeurIPS 2019
Model Selection for Contextual Bandits
NeurIPS 2019
Policy Optimization with Model-Based Explorations
AAAI 2019
Reducing Exploration of Dying Arms in Mortal Bandits
UAI 2019
Contextual Bandits for Adapting Treatment in a Mouse Model of de Novo Carcinogenesis
MLHC 2018
Differentially Private Contextual Linear Bandits
NeurIPS 2018