regret bound

A Self-Play Posterior Sampling Algorithm for Zero-Sum Markov Games ICML 2022 A Sharp Memory-Regret Trade-off for Multi-Pass Streaming Bandits COLT 2022 A Simple and Optimal Policy Design for Online Learning with Safety against Heavy-tailed Risk NeurIPS 2022 A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits NeurIPS 2022 A Simple Unified Framework for High Dimensional Bandit Problems ICML 2022 A Simple yet Universal Strategy for Online Convex Optimization ICML 2022 Asymptotically-Optimal Gaussian Bandits with Side Observations ICML 2022 Augmented RBMLE-UCB Approach for Adaptive Control of Linear Quadratic Systems NeurIPS 2022 A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Bandits AAAI 2022 Bandit Learning with Joint Effect of Incentivized Sampling, Delayed Sampling Feedback, and Self-Reinforcing User Preferences ICLR 2022 Bandit Theory and Thompson Sampling-Guided Directed Evolution for Sequence Optimization NeurIPS 2022 Batch Bayesian optimisation via density-ratio estimation with guarantees NeurIPS 2022 Batch Bayesian Optimization on Permutations using the Acquisition Weighted Kernel NeurIPS 2022 Batched Dueling Bandits ICML 2022 Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms NeurIPS 2022 Bayesian Change-Point Detection for Bandit Feedback in Non-stationary Environments ACML 2022 Bayesian Optimization over Permutation Spaces AAAI 2022 Bayesian Optimization under Stochastic Delayed Feedback ICML 2022 Best of Both Worlds Model Selection NeurIPS 2022 Better Best of Both Worlds Bounds for Bandits with Switching Costs NeurIPS 2022 Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness NeurIPS 2022 Beyond No Regret: Instance-Dependent PAC Reinforcement Learning COLT 2022 Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update NeurIPS 2022 Bounded Memory Adversarial Bandits with Composite Anonymous Delayed Feedback IJCAI 2022 Can Q-learning be Improved with Advice? COLT 2022