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

Online Restless Bandits with Unobserved States ICML 2023
Short-lived High-volume Bandits ICML 2023
Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards NIPS 2023
Efficient Exploration via Epistemic-Risk-Seeking Policy Optimization ICML 2023
Trading-Off Payments and Accuracy in Online Classification with Paid Stochastic Experts ICML 2023
First- and Second-Order Bounds for Adversarial Linear Contextual Bandits NIPS 2023
Horizon-Free and Variance-Dependent Reinforcement Learning for Latent Markov Decision Processes ICML 2023
An Information-Theoretic Analysis of Nonstationary Bandit Learning ICML 2023
Federated Linear Bandits with Finite Adversarial Actions NIPS 2023
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards NIPS 2023
On Robust Streaming for Learning with Experts: Algorithms and Lower Bounds NIPS 2023
Tracking Most Significant Shifts in Nonparametric Contextual Bandits NIPS 2023
Context-lumpable stochastic bandits NIPS 2023
Stabilizing Q-learning with Linear Architectures for Provable Efficient Learning ICML 2022
Thompson Sampling Achieves $\tilde{O}(\sqrt{T})$ Regret in Linear Quadratic Control COLT 2022
A Self-Play Posterior Sampling Algorithm for Zero-Sum Markov Games ICML 2022
Nearly Optimal Policy Optimization with Stable at Any Time Guarantee ICML 2022
From Dirichlet to Rubin: Optimistic Exploration in RL without Bonuses ICML 2022
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost ICML 2022
Multi-Agent Multi-Armed Bandits with Limited Communication JMLR 2022
Improved Regret for Differentially Private Exploration in Linear MDP ICML 2022
The Importance of Non-Markovianity in Maximum State Entropy Exploration ICML 2022
Tracking Most Significant Arm Switches in Bandits COLT 2022
Learning Stochastic Shortest Path with Linear Function Approximation ICML 2022
Doubly Robust Distributionally Robust Off-Policy Evaluation and Learning ICML 2022