conftrace_

linear bandit

124 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) contextual bandit (381) stochastic optimization (1060) sample complexity (1169) thompson sampling (237) online algorithm (445) stochastic bandit (98) pure exploration (50)

Papers

Improved Pure Exploration in Linear Bandits with No-Regret Learning IJCAI 2022
Choosing Answers in Epsilon-Best-Answer Identification for Linear Bandits ICML 2022
Thompson Sampling with a Mixture Prior AISTATS 2022
Metalearning Linear Bandits by Prior Update AISTATS 2022
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds NIPS 2022
Minimax Optimal Fixed-Budget Best Arm Identification in Linear Bandits NIPS 2022
An Analysis of Ensemble Sampling NIPS 2022
Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs NIPS 2022
A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits NIPS 2022
The price of unfairness in linear bandits with biased feedback NIPS 2022
When Are Linear Stochastic Bandits Attackable? ICML 2022
Fixed-Budget Best-Arm Identification in Structured Bandits IJCAI 2022
Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits COLT 2022
Decentralized Multi-Agent Linear Bandits with Safety Constraints AAAI 2021
Stochastic Linear Bandits Robust to Adversarial Attacks AISTATS 2021
Experimental Design for Regret Minimization in Linear Bandits AISTATS 2021
Linear Bandits on Uniformly Convex Sets JMLR 2021
Dynamic Balancing for Model Selection in Bandits and RL ICML 2021
Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs NIPS 2021
Non-stationary Reinforcement Learning without Prior Knowledge: an Optimal Black-box Approach COLT 2021
Tight Regret Bounds for Infinite-armed Linear Contextual Bandits AISTATS 2021
Top-m identification for linear bandits AISTATS 2021
Problem-Complexity Adaptive Model Selection for Stochastic Linear Bandits AISTATS 2021
Stochastic Bandits with Linear Constraints AISTATS 2021
Robust Pure Exploration in Linear Bandits with Limited Budget ICML 2021