regret bound

EE-Net: Exploitation-Exploration Neural Networks in Contextual Bandits ICLR 2022 Effective Dimension in Bandit Problems under Censorship NeurIPS 2022 Efficient and Near-Optimal Smoothed Online Learning for Generalized Linear Functions NeurIPS 2022 Efficient and Optimal Fixed-Time Regret with Two Experts ALT 2022 Efficient Change-Point Detection for Tackling Piecewise-Stationary Bandits JMLR 2022 Efficient Distributionally Robust Bayesian Optimization with Worst-case Sensitivity ICML 2022 Efficient Kernelized UCB for Contextual Bandits AISTATS 2022 Efficient Methods for Online Multiclass Logistic Regression ALT 2022 Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamics COLT 2022 Efficient Projection-Free Online Convex Optimization with Membership Oracle COLT 2022 Efficient Reinforcement Learning with Prior Causal Knowledge CLeaR 2022 Encrypted Linear Contextual Bandit AISTATS 2022 ESCADA: Efficient Safety and Context Aware Dose Allocation for Precision Medicine NeurIPS 2022 Expected Improvement for Contextual Bandits NeurIPS 2022 Expected Regret and Pseudo-Regret are Equivalent When the Optimal Arm is Unique JMLR 2022 Exponential Family Model-Based Reinforcement Learning via Score Matching NeurIPS 2022 Feature and Parameter Selection in Stochastic Linear Bandits ICML 2022 Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits NeurIPS 2022 First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach ICML 2022 From Dirichlet to Rubin: Optimistic Exploration in RL without Bonuses ICML 2022 Game Redesign in No-regret Game Playing IJCAI 2022 Gap-Dependent Bounds for Two-Player Markov Games AISTATS 2022 Gradient and Projection Free Distributed Online Min-Max Resource Optimization L4DC 2022 Graph Neural Network Bandits NeurIPS 2022 Greedy when Sure and Conservative when Uncertain about the Opponents ICML 2022