regret bound

Bayesian Optimization using Pseudo-Points IJCAI 2020 Belief-Dependent Macro-Action Discovery in POMDPs using the Value of Information NeurIPS 2020 Better Full-Matrix Regret via Parameter-Free Online Learning NeurIPS 2020 Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs NeurIPS 2020 Bisection-Based Pricing for Repeated Contextual Auctions against Strategic Buyer ICML 2020 Bounding Regret in Empirical Games AAAI 2020 Budget-Constrained Bandits over General Cost and Reward Distributions AISTATS 2020 Budgeted Online Influence Maximization ICML 2020 Byzantine Resilient Distributed Multi-Task Learning NeurIPS 2020 Choice Bandits NeurIPS 2020 Comparator-Adaptive Convex Bandits NeurIPS 2020 Conservative Exploration in Reinforcement Learning AISTATS 2020 Consistent MetaReg: Alleviating Intra-task Discrepancy for Better Meta-knowledge IJCAI 2020 Constrained Policy Improvement for Efficient Reinforcement Learning IJCAI 2020 Constrained Upper Confidence Reinforcement Learning L4DC 2020 Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting JMLR 2020 Contextual Combinatorial Volatile Multi-armed Bandit with Adaptive Discretization AISTATS 2020 Cooperative Online Learning: Keeping your Neighbors Updated ALT 2020 Coordination without communication: optimal regret in two players multi-armed bandits COLT 2020 Corruption-Tolerant Gaussian Process Bandit Optimization AISTATS 2020 Covariance-adapting algorithm for semi-bandits with application to sparse outcomes COLT 2020 Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic Optimality NeurIPS 2020 Delay and Cooperation in Nonstochastic Linear Bandits NeurIPS 2020 Differentially-Private Federated Linear Bandits NeurIPS 2020 Disagreement-Regularized Imitation Learning ICLR 2020