regret bound

Towards Minimax Optimal Reinforcement Learning in Factored Markov Decision Processes NeurIPS 2020 Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization AAAI 2020 Trading-Off Static and Dynamic Regret in Online Least-Squares and Beyond AAAI 2020 Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits COLT 2020 Unreasonable Effectiveness of Greedy Algorithms in Multi-Armed Bandit with Many Arms NeurIPS 2020 What You See May Not Be What You Get: UCB Bandit Algorithms Robust to ε-Contamination UAI 2020 When Demands Evolve Larger and Noisier: Learning and Earning in a Growing Environment ICML 2020 Winnowing with Gradient Descent COLT 2020 Zeroth Order Non-convex optimization with Dueling-Choice Bandits UAI 2020 X-Armed Bandits: Optimizing Quantiles, CVaR and Other Risks ACML 2019 AdaLinUCB: Opportunistic Learning for Contextual Bandits IJCAI 2019 Adaptive Gradient-Based Meta-Learning Methods NeurIPS 2019 Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes COLT 2019 Adaptive Regret of Convex and Smooth Functions ICML 2019 Adaptive Scale-Invariant Online Algorithms for Learning Linear Models ICML 2019 Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization UAI 2019 Adversarial Online Learning with noise ICML 2019 A Flexible Framework for Multi-Objective Bayesian Optimization using Random Scalarizations UAI 2019 A General Framework for Multi-fidelity Bayesian Optimization with Gaussian Processes AISTATS 2019 Analysis of Thompson Sampling for Combinatorial Multi-armed Bandit with Probabilistically Triggered Arms AISTATS 2019 An Information-Theoretic Approach to Minimax Regret in Partial Monitoring COLT 2019 An Optimal Algorithm for Stochastic and Adversarial Bandits AISTATS 2019 A Practical Semi-Parametric Contextual Bandit IJCAI 2019 A Rank-1 Sketch for Matrix Multiplicative Weights COLT 2019 A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions NeurIPS 2019