Skip to content
conftrace_

linear bandit

154 papers

Papers

Linear Bandits on Uniformly Convex Sets JMLR 2021 Near-Optimal Representation Learning for Linear Bandits and Linear RL ICML 2021 Non-stationary Reinforcement Learning without Prior Knowledge: an Optimal Black-box Approach COLT 2021 Problem-Complexity Adaptive Model Selection for Stochastic Linear Bandits AISTATS 2021 Reward-Biased Maximum Likelihood Estimation for Linear Stochastic Bandits AAAI 2021 Robust Pure Exploration in Linear Bandits with Limited Budget ICML 2021 Stochastic Bandits with Linear Constraints AISTATS 2021 Stochastic Linear Bandits Robust to Adversarial Attacks AISTATS 2021 Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge NeurIPS 2021 Tight Regret Bounds for Infinite-armed Linear Contextual Bandits AISTATS 2021 Top-m identification for linear bandits AISTATS 2021 Adaptive Exploration in Linear Contextual Bandit AISTATS 2020 Adversarial Attacks on Linear Contextual Bandits NeurIPS 2020 An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits NeurIPS 2020 A Simple Approach for Non-stationary Linear Bandits AISTATS 2020 Delay and Cooperation in Nonstochastic Linear Bandits NeurIPS 2020 Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication ICLR 2020 Efficient and robust algorithms for adversarial linear contextual bandits COLT 2020 Gamification of Pure Exploration for Linear Bandits ICML 2020 High-Dimensional Sparse Linear Bandits NeurIPS 2020 Information Directed Sampling for Linear Partial Monitoring COLT 2020 Learning with Good Feature Representations in Bandits and in RL with a Generative Model ICML 2020 Linear Bandits with Feature Feedback AAAI 2020 Linear bandits with Stochastic Delayed Feedback ICML 2020 Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs IJCAI 2020