regret bound

Contextual bandits with concave rewards, and an application to fair ranking ICLR 2023 Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression COLT 2023 Contextual Combinatorial Bandits with Probabilistically Triggered Arms ICML 2023 Contextual Conservative Interleaving Bandits ICML 2023 Contextual Gaussian Process Bandits with Neural Networks NeurIPS 2023 Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles AISTATS 2023 Cooperative Multi-Agent Reinforcement Learning: Asynchronous Communication and Linear Function Approximation ICML 2023 Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes ICML 2023 Decentralized Randomly Distributed Multi-agent Multi-armed Bandit with Heterogeneous Rewards NeurIPS 2023 Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback ICML 2023 Delayed Bandits: When Do Intermediate Observations Help? ICML 2023 Delayed Feedback in Generalised Linear Bandits Revisited AISTATS 2023 Delayed Feedback in Kernel Bandits ICML 2023 Differentially Private and Lazy Online Convex Optimization COLT 2023 Differentially Private Episodic Reinforcement Learning with Heavy-tailed Rewards ICML 2023 Dimension Reduction in Contextual Online Learning via Nonparametric Variable Selection JMLR 2023 Discrete-Smoothness in Online Algorithms with Predictions NeurIPS 2023 Distributed Differential Privacy in Multi-Armed Bandits ICLR 2023 Distributed Projection-Free Online Learning for Smooth and Convex Losses AAAI 2023 Distributionally Robust Bayesian Optimization with φ-divergences NeurIPS 2023 Double Doubly Robust Thompson Sampling for Generalized Linear Contextual Bandits AAAI 2023 Doubly Adversarial Federated Bandits ICML 2023 Doubly Fair Dynamic Pricing AISTATS 2023 Dueling RL: Reinforcement Learning with Trajectory Preferences AISTATS 2023 Dynamical Linear Bandits ICML 2023