regret bound

Rotting Infinitely Many-Armed Bandits ICML 2022 Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft Constraints ICML 2022 Safe Online Convex Optimization with Unknown Linear Safety Constraints AAAI 2022 Safety aware changepoint detection for piecewise i.i.d. bandits UAI 2022 Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost ICML 2022 Saving Stochastic Bandits from Poisoning Attacks via Limited Data Verification AAAI 2022 Scale-Free Adversarial Multi Armed Bandits ALT 2022 Scale-free Unconstrained Online Learning for Curved Losses COLT 2022 Sequential Information Design: Learning to Persuade in the Dark NeurIPS 2022 Shuffle Private Linear Contextual Bandits ICML 2022 Simultaneously Learning Stochastic and Adversarial Bandits under the Position-Based Model AAAI 2022 Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback ICML 2022 Smoothed Adversarial Linear Contextual Bandits with Knapsacks ICML 2022 Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor NeurIPS 2022 SnAKe: Bayesian Optimization with Pathwise Exploration NeurIPS 2022 Society of Agents: Regret Bounds of Concurrent Thompson Sampling NeurIPS 2022 Solving Multi-Arm Bandit Using a Few Bits of Communication AISTATS 2022 Stabilizing Q-learning with Linear Architectures for Provable Efficient Learning ICML 2022 Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function ICML 2022 Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality NeurIPS 2022 Stochastic Rising Bandits ICML 2022 Syndicated Bandits: A Framework for Auto Tuning Hyper-parameters in Contextual Bandit Algorithms NeurIPS 2022 The Importance of Non-Markovianity in Maximum State Entropy Exploration ICML 2022 The Information Geometry of Unsupervised Reinforcement Learning ICLR 2022 The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player Multi-Armed Bandits with no Communication COLT 2022