Skip to content
conftrace_

Multi-Armed Bandits

1,327 papers

6
32
103
106
'10
'15
'20
'25

Papers

Feedback Attribution for Counterfactual Bandit Learning in Multi-Domain Spoken Language Understanding EMNLP 2021 Generalized Linear Bandits with Local Differential Privacy NeurIPS 2021 Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization NeurIPS 2021 High-dimensional Experimental Design and Kernel Bandits ICML 2021 Human-AI Collaboration with Bandit Feedback IJCAI 2021 Identification of the Generalized Condorcet Winner in Multi-dueling Bandits NeurIPS 2021 Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications COLT 2021 Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions COLT 2021 Improved Regret for Zeroth-Order Stochastic Convex Bandits COLT 2021 Information Directed Sampling for Sparse Linear Bandits NeurIPS 2021 Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits AISTATS 2021 Is Reinforcement Learning More Difficult Than Bandits? A Near-optimal Algorithm Escaping the Curse of Horizon COLT 2021 Learning from eXtreme Bandit Feedback AAAI 2021 Learning without Knowing: Unobserved Context in Continuous Transfer Reinforcement Learning L4DC 2021 Learn to Intervene: An Adaptive Learning Policy for Restless Bandits in Application to Preventive Healthcare IJCAI 2021 Lenient Regret and Good-Action Identification in Gaussian Process Bandits ICML 2021 Leveraging Good Representations in Linear Contextual Bandits ICML 2021 Linear Bandits on Uniformly Convex Sets JMLR 2021 Matrix games with bandit feedback UAI 2021 Max-Utility Based Arm Selection Strategy For Sequential Query Recommendations ACML 2021 Mean Field Equilibrium in Multi-Armed Bandit Game with Continuous Reward IJCAI 2021 Meta-Learning Effective Exploration Strategies for Contextual Bandits AAAI 2021 MFES-HB: Efficient Hyperband with Multi-Fidelity Quality Measurements AAAI 2021 Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition COLT 2021 Mirror Descent and the Information Ratio COLT 2021