Co-occurring keywords · papers mentioning both
Papers
Dual-Mandate Patrols: Multi-Armed Bandits for Green Security
AAAI 2021
Dueling Bandits with Adversarial Sleeping
NeurIPS 2021
Dynamic Balancing for Model Selection in Bandits and RL
ICML 2021
Dynamic Planning and Learning under Recovering Rewards
ICML 2021
DynaTune: Dynamic Tensor Program Optimization in Deep Neural Network Compilation
ICLR 2021
Efficient Algorithms for Stochastic Repeated Second-price Auctions
ALT 2021
Efficient Optimal Selection for Composited Advertising Creatives with Tree Structure
AAAI 2021
Epsilon Best Arm Identification in Spectral Bandits
IJCAI 2021
Fair Algorithms for Multi-Agent Multi-Armed Bandits
NeurIPS 2021
Fair Exploration via Axiomatic Bargaining
NeurIPS 2021
Fairness of Exposure in Stochastic Bandits
ICML 2021
Federated Linear Contextual Bandits
NeurIPS 2021
Federated Multi-Armed Bandits
AAAI 2021
Federated Multi-armed Bandits with Personalization
AISTATS 2021
Fully Gap-Dependent Bounds for Multinomial Logit Bandit
AISTATS 2021
Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization
NeurIPS 2021
Hoeffding's Inequality for General Markov Chains and Its Applications to Statistical Learning
JMLR 2021
Human-AI Collaboration with Bandit Feedback
IJCAI 2021
Identification of the Generalized Condorcet Winner in Multi-dueling Bandits
NeurIPS 2021
Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions
COLT 2021
Incentivized Bandit Learning with Self-Reinforcing User Preferences
ICML 2021
Indexed Minimum Empirical Divergence for Unimodal Bandits
NeurIPS 2021
Learning Equilibria in Matching Markets from Bandit Feedback
NeurIPS 2021
Learning User Preferences in Non-Stationary Environments
AISTATS 2021
Learning without Knowing: Unobserved Context in Continuous Transfer Reinforcement Learning
L4DC 2021