cumulative regret

Gaussian Process Bandit Optimization with Few Batches AISTATS 2022 Multi-Agent Multi-Armed Bandits with Limited Communication JMLR 2022 Online Learning to Transport via the Minimal Selection Principle COLT 2022 Bandits with many optimal arms NeurIPS 2021 Bias-Robust Bayesian Optimization via Dueling Bandits ICML 2021 Budgeted and Non-Budgeted Causal Bandits AISTATS 2021 Collaborative Bayesian Optimization with Fair Regret ICML 2021 Max-Utility Based Arm Selection Strategy For Sequential Query Recommendations ACML 2021 Neural Thompson Sampling ICLR 2021 Q-learning with Logarithmic Regret AISTATS 2021 Sequential prediction under log-loss and misspecification COLT 2021 Smooth Bandit Optimization: Generalization to Holder Space AISTATS 2021 Bayesian Optimization using Pseudo-Points IJCAI 2020 Laplacian-Regularized Graph Bandits: Algorithms and Theoretical Analysis AISTATS 2020 Multi-Feedback Bandit Learning with Probabilistic Contexts IJCAI 2020 Online Batch Decision-Making with High-Dimensional Covariates AISTATS 2020 Root-n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank COLT 2020 Spectral bandits JMLR 2020 The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits AISTATS 2020 Categorized Bandits NeurIPS 2019 Gain estimation of linear dynamical systems using Thompson Sampling AISTATS 2019 Adaptivity to Smoothness in X-armed bandits COLT 2018 Correlational Dueling Bandits with Application to Clinical Treatment in Large Decision Spaces IJCAI 2017 Cheap Bandits ICML 2015 Simple regret for infinitely many armed bandits ICML 2015