regret analysis

Parallel Online Clustering of Bandits via Hedonic Game ICML 2023 Stochastic Gradient Succeeds for Bandits ICML 2023 An α-regret analysis of Adversarial Bilateral Trade NeurIPS 2022 Combinatorial Bayesian optimization with random mapping functions to convex polytopes UAI 2022 Instance Dependent Regret Analysis of Kernelized Bandits ICML 2022 Model-based RL with Optimistic Posterior Sampling: Structural Conditions and Sample Complexity NeurIPS 2022 On Kernelized Multi-Armed Bandits with Constraints NeurIPS 2022 Simple Agent, Complex Environment: Efficient Reinforcement Learning with Agent States JMLR 2022 Thompson Sampling for Bandit Learning in Matching Markets IJCAI 2022 Adversarial Linear Contextual Bandits with Graph-Structured Side Observations AAAI 2021 Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games AAAI 2021 Convex Regularization in Monte-Carlo Tree Search ICML 2021 Differentially Private Multi-Armed Bandits in the Shuffle Model NeurIPS 2021 Matrix games with bandit feedback UAI 2021 Perturbation-based Regret Analysis of Predictive Control in Linear Time Varying Systems NeurIPS 2021 Reinforcement Learning with Trajectory Feedback AAAI 2021 Reward Biased Maximum Likelihood Estimation for Reinforcement Learning L4DC 2021 Thompson sampling for Markov games with piecewise stationary opponent policies UAI 2021 Toward Optimal Solution for the Context-Attentive Bandit Problem IJCAI 2021 Tractable contextual bandits beyond realizability AISTATS 2021 Unifying Clustered and Non-stationary Bandits AISTATS 2021 Incentivized Exploration for Multi-Armed Bandits under Reward Drift AAAI 2020 Regret Bounds for Decentralized Learning in Cooperative Multi-Agent Dynamical Systems UAI 2020 Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits NeurIPS 2020 Approximations of the Restless Bandit Problem JMLR 2019