regret bound

Nearly second-order optimality of online joint detection and estimation via one-sample update schemes AISTATS 2018 Near Optimal Exploration-Exploitation in Non-Communicating Markov Decision Processes NeurIPS 2018 Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models NeurIPS 2018 Nonstochastic Bandits with Composite Anonymous Feedback COLT 2018 Normal Bandits of Unknown Means and Variances JMLR 2018 Online Continuous Submodular Maximization AISTATS 2018 Online convex optimization for cumulative constraints NeurIPS 2018 Online Ensemble Multi-kernel Learning Adaptive to Non-stationary and Adversarial Environments AISTATS 2018 Online Improper Learning with an Approximation Oracle NeurIPS 2018 Online Kernel Selection via Incremental Sketched Kernel Alignment IJCAI 2018 Online Learning of Combinatorial Objects via Extended Formulation ALT 2018 Online learning over a finite action set with limited switching COLT 2018 Online Learning: Sufficient Statistics and the Burkholder Method COLT 2018 Online Learning with Abstention ICML 2018 Online Learning with Non-Convex Losses and Non-Stationary Regret AISTATS 2018 Online Linear Quadratic Control ICML 2018 Parallelised Bayesian Optimisation via Thompson Sampling AISTATS 2018 Practical Contextual Bandits with Regression Oracles ICML 2018 Problem Dependent Reinforcement Learning Bounds Which Can Identify Bandit Structure in MDPs ICML 2018 Profitable Bandits ACML 2018 Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity ICML 2018 Refining the Confidence Level for Optimistic Bandit Strategies JMLR 2018 Regional Multi-Armed Bandits AISTATS 2018 Regret bounds for meta Bayesian optimization with an unknown Gaussian process prior NeurIPS 2018 Regret Bounds for Online Portfolio Selection with a Cardinality Constraint NeurIPS 2018