Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1904.00242
Cited By
v1
v2 (latest)
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits
30 March 2019
Yingkai Li
Yining Wang
Yuanshuo Zhou
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits"
19 / 19 papers shown
Title
Experimental Design for Semiparametric Bandits
Seok-Jin Kim
Gi-Soo Kim
Min-hwan Oh
23
0
0
16 Jun 2025
Contextual Online Uncertainty-Aware Preference Learning for Human Feedback
Nan Lu
Ethan X. Fang
Junwei Lu
420
0
0
27 Apr 2025
Causally Abstracted Multi-armed Bandits
Fabio Massimo Zennaro
Nicholas Bishop
Joel Dyer
Yorgos Felekis
Anisoara Calinescu
Michael Wooldridge
Theodoros Damoulas
80
3
0
26 Apr 2024
CO-BED: Information-Theoretic Contextual Optimization via Bayesian Experimental Design
Desi R. Ivanova
Joel Jennings
Tom Rainforth
Cheng Zhang
Adam Foster
100
3
0
27 Feb 2023
Variance-Dependent Regret Bounds for Linear Bandits and Reinforcement Learning: Adaptivity and Computational Efficiency
Heyang Zhao
Jiafan He
Dongruo Zhou
Tong Zhang
Quanquan Gu
101
28
0
21 Feb 2023
A Reinforcement Learning Approach in Multi-Phase Second-Price Auction Design
Rui Ai
Boxiang Lyu
Zhaoran Wang
Zhuoran Yang
Michael I. Jordan
72
3
0
19 Oct 2022
Double Doubly Robust Thompson Sampling for Generalized Linear Contextual Bandits
Wonyoung Hedge Kim
Kyungbok Lee
M. Paik
102
14
0
15 Sep 2022
A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits
Jiafan He
Tianhao Wang
Yifei Min
Quanquan Gu
FedML
99
34
0
07 Jul 2022
Asymptotic Instance-Optimal Algorithms for Interactive Decision Making
Kefan Dong
Tengyu Ma
132
9
0
06 Jun 2022
Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs
Dongruo Zhou
Quanquan Gu
120
45
0
23 May 2022
Provably Efficient Kernelized Q-Learning
Shuang Liu
H. Su
MLT
95
4
0
21 Apr 2022
Flexible and Efficient Contextual Bandits with Heterogeneous Treatment Effect Oracles
Aldo G. Carranza
Sanath Kumar Krishnamurthy
Susan Athey
50
1
0
30 Mar 2022
Truncated LinUCB for Stochastic Linear Bandits
Yanglei Song
Meng zhou
260
0
0
23 Feb 2022
Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs
Yeoneung Kim
Insoon Yang
Kwang-Sung Jun
100
38
0
05 Nov 2021
A Simple Approach for Non-stationary Linear Bandits
Peng Zhao
Lijun Zhang
Yuan Jiang
Zhi Zhou
80
85
0
09 Mar 2021
The Elliptical Potential Lemma for General Distributions with an Application to Linear Thompson Sampling
N. Hamidi
Mohsen Bayati
29
1
0
16 Feb 2021
The Elliptical Potential Lemma Revisited
Alexandra Carpentier
Claire Vernade
Yasin Abbasi-Yadkori
178
21
0
20 Oct 2020
Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension
Ruosong Wang
Ruslan Salakhutdinov
Lin F. Yang
101
55
0
21 May 2020
Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizability
D. Simchi-Levi
Yunzong Xu
OffRL
441
112
0
28 Mar 2020
1