regret bound

Cooperative Stochastic Bandits with Asynchronous Agents and Constrained Feedback NeurIPS 2021 CORe: Capitalizing On Rewards in Bandit Exploration UAI 2021 Corralling Stochastic Bandit Algorithms AISTATS 2021 Corruption-robust exploration in episodic reinforcement learning COLT 2021 DART: Adaptive Accept Reject Algorithm for Non-Linear Combinatorial Bandits AAAI 2021 Data driven semi-supervised learning NeurIPS 2021 Deciding What to Learn: A Rate-Distortion Approach ICML 2021 Decision Making Problems with Funnel Structure: A Multi-Task Learning Approach with Application to Email Marketing Campaigns AISTATS 2021 DEHB: Evolutionary Hyberband for Scalable, Robust and Efficient Hyperparameter Optimization IJCAI 2021 Differentially Private Monotone Submodular Maximization Under Matroid and Knapsack Constraints AISTATS 2021 Differentially Private Multi-Armed Bandits in the Shuffle Model NeurIPS 2021 Differentially Private Online Submodular Maximization AISTATS 2021 Disposable Linear Bandits for Online Recommendations AAAI 2021 Double Explore-then-Commit: Asymptotic Optimality and Beyond COLT 2021 Doubly Robust Thompson Sampling with Linear Payoffs NeurIPS 2021 Dynamic Balancing for Model Selection in Bandits and RL ICML 2021 Dynamic Planning and Learning under Recovering Rewards ICML 2021 Efficient Algorithms for Stochastic Repeated Second-price Auctions ALT 2021 Efficient Bandit Convex Optimization: Beyond Linear Losses COLT 2021 Efficient Online Learning for Dynamic k-Clustering ICML 2021 Efficient Reinforcement Learning in Factored MDPs with Application to Constrained RL ICLR 2021 Episodic Reinforcement Learning in Finite MDPs: Minimax Lower Bounds Revisited ALT 2021 Exact Asymptotics for Linear Quadratic Adaptive Control JMLR 2021 Expert advice problem with noisy low rank loss ACML 2021 Exploration-Exploitation in Multi-Agent Learning: Catastrophe Theory Meets Game Theory AAAI 2021