Skip to content
conftrace_

bandit algorithm

111 papers

Papers

Robust Tests in Online Decision-Making AAAI 2022 AutoBandit: A Meta Bandit Online Learning System IJCAI 2021 BanditMTL: Bandit-based Multi-task Learning for Text Classification ACL 2021 Epsilon Best Arm Identification in Spectral Bandits IJCAI 2021 Hybrid Regret Bounds for Combinatorial Semi-Bandits and Adversarial Linear Bandits NeurIPS 2021 Improved Regret for Zeroth-Order Stochastic Convex Bandits COLT 2021 On Information Gain and Regret Bounds in Gaussian Process Bandits AISTATS 2021 Parametric Graph for Unimodal Ranking Bandit ICML 2021 Preference-based Online Learning with Dueling Bandits: A Survey JMLR 2021 Statistical Inference with M-Estimators on Adaptively Collected Data NeurIPS 2021 Stochastic Dueling Bandits with Adversarial Corruption ALT 2021 UCB-based Algorithms for Multinomial Logistic Regression Bandits NeurIPS 2021 Analysis and Design of Thompson Sampling for Stochastic Partial Monitoring NeurIPS 2020 A Near-Optimal Change-Detection Based Algorithm for Piecewise-Stationary Combinatorial Semi-Bandits AAAI 2020 Bandit Linear Control NeurIPS 2020 Bandit Samplers for Training Graph Neural Networks NeurIPS 2020 Choice Bandits NeurIPS 2020 Efficient Contextual Bandits with Continuous Actions NeurIPS 2020 From PAC to Instance-Optimal Sample Complexity in the Plackett-Luce Model ICML 2020 Optimal Best-arm Identification in Linear Bandits NeurIPS 2020 Provably Efficient Online Hyperparameter Optimization with Population-Based Bandits NeurIPS 2020 Smooth Contextual Bandits: Bridging the Parametric and Non-differentiable Regret Regimes COLT 2020 Towards Hands-Free Visual Dialog Interactive Recommendation AAAI 2020 Zeroth Order Non-convex optimization with Dueling-Choice Bandits UAI 2020 BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback UAI 2019