sublinear regret

Provably Efficient Black-Box Action Poisoning Attacks Against Reinforcement Learning NeurIPS 2021 Regret Bounds for Online Kernel Selection in Continuous Kernel Space AAAI 2021 Regularized Online Allocation Problems: Fairness and Beyond ICML 2021 Towards a Dimension-Free Understanding of Adaptive Linear Control COLT 2021 Bandit optimisation of functions in the Matérn kernel RKHS AISTATS 2020 Combinatorial Multi-Armed Bandits with Concave Rewards and Fairness Constraints IJCAI 2020 Contextual-Bandit Based Personalized Recommendation with Time-Varying User Interests AAAI 2020 Efficient Large-Scale Gaussian Process Bandits by Believing only Informative Actions L4DC 2020 Experimental Design for Optimization of Orthogonal Projection Pursuit Models AAAI 2020 Non-Stochastic Control with Bandit Feedback NeurIPS 2020 Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without COLT 2020 Online Learning with Continuous Variations: Dynamic Regret and Reductions AISTATS 2020 Online Learning with Vector Costs and Bandits with Knapsacks COLT 2020 Regret Minimisation in Multi-Armed Bandits Using Bounded Arm Memory AAAI 2020 Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces NeurIPS 2020 Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization AAAI 2020 A Flexible Framework for Multi-Objective Bayesian Optimization using Random Scalarizations UAI 2019 Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization NeurIPS 2019 Model-Free Linear Quadratic Control via Reduction to Expert Prediction AISTATS 2019 Myopic Posterior Sampling for Adaptive Goal Oriented Design of Experiments ICML 2019 Online Adaptive Principal Component Analysis and Its extensions ICML 2019 Projection-Free Bandit Convex Optimization AISTATS 2019 User-Specified Local Differential Privacy in Unconstrained Adaptive Online Learning NeurIPS 2019 Firing Bandits: Optimizing Crowdfunding ICML 2018 Near Optimal Exploration-Exploitation in Non-Communicating Markov Decision Processes NeurIPS 2018