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

Syndicated Bandits: A Framework for Auto Tuning Hyper-parameters in Contextual Bandit Algorithms NIPS 2022
Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem NIPS 2022
Safe Online Convex Optimization with Unknown Linear Safety Constraints AAAI 2022
Anytime Guarantees under Heavy-Tailed Data AAAI 2022
A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits NIPS 2022
Minimax Optimal Algorithms for Fixed-Budget Best Arm Identification NIPS 2022
When Privacy Meets Partial Information: A Refined Analysis of Differentially Private Bandits NIPS 2022
Smoothed Adversarial Linear Contextual Bandits with Knapsacks ICML 2022
Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness NIPS 2022
Best of Both Worlds Model Selection NIPS 2022
Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs NIPS 2022
Learning to Identify Top Elo Ratings: A Dueling Bandits Approach AAAI 2022
A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback NIPS 2022
Finite-time System Identification and Adaptive Control in Autoregressive Exogenous Systems L4DC 2021
Provably Sample Efficient Reinforcement Learning in Competitive Linear Quadratic Systems L4DC 2021
Reward Biased Maximum Likelihood Estimation for Reinforcement Learning L4DC 2021
DART: Adaptive Accept Reject Algorithm for Non-Linear Combinatorial Bandits AAAI 2021
Regret Bounds for Adaptive Nonlinear Control L4DC 2021
A One-Size-Fits-All Solution to Conservative Bandit Problems AAAI 2021
The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle NIPS 2021
Bandit Learning with Delayed Impact of Actions NIPS 2021
Smooth Convex Optimization Using Sub-Zeroth-Order Oracles AAAI 2021
Reward-Biased Maximum Likelihood Estimation for Linear Stochastic Bandits AAAI 2021
Generalized Linear Bandits with Local Differential Privacy NIPS 2021
Provably Efficient Reinforcement Learning for Discounted MDPs with Feature Mapping ICML 2021