Exploration-Exploitation

An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem NeurIPS 2022 A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs NeurIPS 2022 Anti-Concentrated Confidence Bonuses For Scalable Exploration ICLR 2022 Context Uncertainty in Contextual Bandits with Applications to Recommender Systems AAAI 2022 Field Study in Deploying Restless Multi-Armed Bandits: Assisting Non-profits in Improving Maternal and Child Health AAAI 2022 Incentivizing Combinatorial Bandit Exploration NeurIPS 2022 Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit AAAI 2022 Modeling Human Exploration Through Resource-Rational Reinforcement Learning NeurIPS 2022 Multi-Fidelity Best-Arm Identification NeurIPS 2022 Near Instance Optimal Model Selection for Pure Exploration Linear Bandits AISTATS 2022 Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments NeurIPS 2022 Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret NeurIPS 2022 Non-stationary Bandits with Knapsacks NeurIPS 2022 Open Problem: Optimal Best Arm Identification with Fixed-Budget COLT 2022 Pareto Optimal Model Selection in Linear Bandits AISTATS 2022 Planning to the Information Horizon of BAMDPs via Epistemic State Abstraction NeurIPS 2022 Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity NeurIPS 2022 Spending Thinking Time Wisely: Accelerating MCTS with Virtual Expansions NeurIPS 2022 Stochastic Goal Recognition Design Problems with Suboptimal Agents AAAI 2022 The price of unfairness in linear bandits with biased feedback NeurIPS 2022 A/B/n Testing with Control in the Presence of Subpopulations NeurIPS 2021 (Almost) Free Incentivized Exploration from Decentralized Learning Agents NeurIPS 2021 Asymptotically Optimal Information-Directed Sampling COLT 2021 A unified framework for bandit multiple testing NeurIPS 2021 Bandit Phase Retrieval NeurIPS 2021