Online Algorithms

Regret Bounds for Batched Bandits AAAI 2021 Regret Bounds for Online Kernel Selection in Continuous Kernel Space AAAI 2021 Regret Minimization in Heavy-Tailed Bandits COLT 2021 Regret-optimal measurement-feedback control L4DC 2021 Reinforcement Learning with Trajectory Feedback AAAI 2021 Revisiting Smoothed Online Learning NeurIPS 2021 Reward-Biased Maximum Likelihood Estimation for Linear Stochastic Bandits AAAI 2021 Robust Bandit Learning with Imperfect Context AAAI 2021 Stochastic Dueling Bandits with Adversarial Corruption ALT 2021 Stochastic Graphical Bandits with Adversarial Corruptions AAAI 2021 Stochastic Linear Bandits Robust to Adversarial Attacks AISTATS 2021 Stochastic Multi-Armed Bandits with Unrestricted Delay Distributions ICML 2021 Stochastic Top-K Subset Bandits with Linear Space and Non-Linear Feedback ALT 2021 Testification of Condorcet Winners in dueling bandits UAI 2021 The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks ICML 2021 Tight Regret Bounds for Infinite-armed Linear Contextual Bandits AISTATS 2021 Top-k eXtreme Contextual Bandits with Arm Hierarchy ICML 2021 Top-m identification for linear bandits AISTATS 2021 Toward a General Theory of Online Selective Sampling: Trading Off Mistakes and Queries AISTATS 2021 Towards Reducing Biases in Combining Multiple Experts Online IJCAI 2021 Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits JMLR 2021 Unifying Clustered and Non-stationary Bandits AISTATS 2021 Zeroth-Order Non-Convex Learning via Hierarchical Dual Averaging ICML 2021 A Bandit Learning Algorithm and Applications to Auction Design NeurIPS 2020 A Closer Look at Small-loss Bounds for Bandits with Graph Feedback COLT 2020