← Keywords

regret analysis

73 papers

Explore in graph

Co-occurring keywords

regret bound (1918) multi-armed bandit (1091) online learning (1770) contextual bandit (379) thompson sampling (234) reinforcement learning (4122) ucb algorithm (44) online algorithm (444) stochastic gradient descent (1088) markov decision process (788)

Papers

Simple Agent, Complex Environment: Efficient Reinforcement Learning with Agent States JMLR 2022
Thompson Sampling for Bandit Learning in Matching Markets IJCAI 2022
Combinatorial Bayesian optimization with random mapping functions to convex polytopes UAI 2022
An $\alpha$-regret analysis of Adversarial Bilateral Trade NIPS 2022
Adversarial Linear Contextual Bandits with Graph-Structured Side Observations AAAI 2021
Matrix games with bandit feedback UAI 2021
Toward Optimal Solution for the Context-Attentive Bandit Problem IJCAI 2021
Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games AAAI 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
Unifying Clustered and Non-stationary Bandits AISTATS 2021
Tractable contextual bandits beyond realizability AISTATS 2021
Perturbation-based Regret Analysis of Predictive Control in Linear Time Varying Systems NIPS 2021
Differentially Private Multi-Armed Bandits in the Shuffle Model NIPS 2021
Convex Regularization in Monte-Carlo Tree Search ICML 2021
Regret Bounds for Decentralized Learning in Cooperative Multi-Agent Dynamical Systems UAI 2020
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits NIPS 2020
Incentivized Exploration for Multi-Armed Bandits under Reward Drift AAAI 2020
Leveraging Observations in Bandits: Between Risks and Benefits AAAI 2019
Approximations of the Restless Bandit Problem JMLR 2019
Manipulating a Learning Defender and Ways to Counteract NIPS 2019
Online Learning via the Differential Privacy Lens NIPS 2019
Learning with Abandonment ICML 2018
A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem NIPS 2018