regret bound

Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit AISTATS 2019 Near-Optimal Reinforcement Learning in Dynamic Treatment Regimes NeurIPS 2019 Non-Asymptotic Gap-Dependent Regret Bounds for Tabular MDPs NeurIPS 2019 Nonparametric Contextual Bandits in Metric Spaces with Unknown Metric NeurIPS 2019 Nonstochastic Multiarmed Bandits with Unrestricted Delays NeurIPS 2019 No-Regret Bayesian Optimization with Unknown Hyperparameters JMLR 2019 No-Regret Learning in Unknown Games with Correlated Payoffs NeurIPS 2019 On Asymptotic and Finite-Time Optimality of Bayesian Predictors JMLR 2019 On First-Order Bounds, Variance and Gap-Dependent Bounds for Adversarial Bandits UAI 2019 Online Algorithm for Unsupervised Sensor Selection AISTATS 2019 Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback NeurIPS 2019 Online Control with Adversarial Disturbances ICML 2019 Online Convex Optimization in Adversarial Markov Decision Processes ICML 2019 Online EXP3 Learning in Adversarial Bandits with Delayed Feedback NeurIPS 2019 Online Learning in Kernelized Markov Decision Processes AISTATS 2019 On-Line Learning of Linear Dynamical Systems: Exponential Forgetting in Kalman Filters AAAI 2019 Online Learning to Rank with Features ICML 2019 Online Learning via the Differential Privacy Lens NeurIPS 2019 Online learning with feedback graphs and switching costs AISTATS 2019 Online learning with kernel losses ICML 2019 Online Learning with Sleeping Experts and Feedback Graphs ICML 2019 Online Linear Optimization with Sparsity Constraints ALT 2019 Online Meta-Learning ICML 2019 Online Multiclass Boosting with Bandit Feedback AISTATS 2019 Online Stochastic Shortest Path with Bandit Feedback and Unknown Transition Function NeurIPS 2019