conftrace_

regret bound

1926 papers

Explore in graph

Also known as

RB

Co-occurring keywords

online learning (1777) multi-armed bandit (1098) contextual bandit (381) stochastic optimization (1060) reinforcement learning (4352) online algorithm (445) upper confidence bound (197) markov decision process (790) thompson sampling (237) online convex optimization (165)

Papers

Near-optimal Thompson sampling-based algorithms for differentially private stochastic bandits UAI 2022
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds NIPS 2022
Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem NIPS 2022
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms NIPS 2022
Lipschitz Bandits with Batched Feedback NIPS 2022
Uplifting Bandits NIPS 2022
Understanding the Eluder Dimension NIPS 2022
A Simple yet Universal Strategy for Online Convex Optimization ICML 2022
Adaptive Bandit Convex Optimization with Heterogeneous Curvature COLT 2022
Queue Up Your Regrets: Achieving the Dynamic Capacity Region of Multiplayer Bandits NIPS 2022
Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs NIPS 2022
Syndicated Bandits: A Framework for Auto Tuning Hyper-parameters in Contextual Bandit Algorithms NIPS 2022
Congested Bandits: Optimal Routing via Short-term Resets ICML 2022
Effective Dimension in Bandit Problems under Censorship NIPS 2022
Learning Two-Player Markov Games: Neural Function Approximation and Correlated Equilibrium NIPS 2022
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation ICML 2022
Cooperative Online Learning in Stochastic and Adversarial MDPs ICML 2022
Learning to Plan Variable Length Sequences of Actions with a Cascading Bandit Click Model of User Feedback AISTATS 2022
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP ICML 2022
Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness ICML 2022
A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits NIPS 2022
Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft Constraints ICML 2022
Thresholded Lasso Bandit ICML 2022
Minimax Regret for Partial Monitoring: Infinite Outcomes and Rustichini’s Regret COLT 2022
Batched Dueling Bandits ICML 2022