regret bound

Robust Contextual Bandits via Bootstrapping AAAI 2021 Robustness Guarantees for Mode Estimation with an Application to Bandits AAAI 2021 Robust Online Convex Optimization in the Presence of Outliers COLT 2021 Safe Reinforcement Learning with Linear Function Approximation ICML 2021 Sample Efficient Reinforcement Learning with REINFORCE AAAI 2021 Scalable Thompson Sampling using Sparse Gaussian Process Models NeurIPS 2021 Scheduling jobs with stochastic holding costs NeurIPS 2021 Sequential prediction under log-loss and misspecification COLT 2021 Significance of Gradient Information in Bayesian Optimization AISTATS 2021 Simple combinatorial algorithms for combinatorial bandits: corruptions and approximations UAI 2021 Single Layer Predictive Normalized Maximum Likelihood for Out-of-Distribution Detection NeurIPS 2021 Smooth Convex Optimization Using Sub-Zeroth-Order Oracles AAAI 2021 Sparsity-Agnostic Lasso Bandit ICML 2021 Stochastic bandits with groups of similar arms. NeurIPS 2021 Stochastic Bandits with Linear Constraints AISTATS 2021 Stochastic Graphical Bandits with Adversarial Corruptions AAAI 2021 Stochastic Linear Bandits Robust to Adversarial Attacks AISTATS 2021 Stochastic Multi-Armed Bandits with Control Variates NeurIPS 2021 Stochastic Multi-Armed Bandits with Unrestricted Delay Distributions ICML 2021 Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge NeurIPS 2021 Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret NeurIPS 2021 Stochastic Shortest Path with Adversarially Changing Costs IJCAI 2021 Stochastic Top-K Subset Bandits with Linear Space and Non-Linear Feedback ALT 2021 The best of both worlds: stochastic and adversarial episodic MDPs with unknown transition NeurIPS 2021 The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle NeurIPS 2021