Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2011.05944
Cited By
v1
v2
v3
v4 (latest)
Asymptotically Optimal Information-Directed Sampling
Annual Conference Computational Learning Theory (COLT), 2020
11 November 2020
Johannes Kirschner
Tor Lattimore
Claire Vernade
Csaba Szepesvári
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Asymptotically Optimal Information-Directed Sampling"
23 / 23 papers shown
Optimal and Practical Batched Linear Bandit Algorithm
Sanghoon Yu
Min-hwan Oh
359
1
0
11 Jul 2025
An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints
Jiahui Zhu
Kihyun Yu
Dabeen Lee
Xin Liu
Honghao Wei
262
1
0
28 May 2025
Provably Efficient Information-Directed Sampling Algorithms for Multi-Agent Reinforcement Learning
Qiaosheng Zhang
Chenjia Bai
Shuyue Hu
Zhen Wang
Xuelong Li
337
2
0
30 Apr 2024
Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
Neural Information Processing Systems (NeurIPS), 2023
Ahmadreza Moradipari
M. Pedramfar
Modjtaba Shokrian Zini
Vaneet Aggarwal
339
6
0
30 Oct 2023
Linear Partial Monitoring for Sequential Decision-Making: Algorithms, Regret Bounds and Applications
Journal of machine learning research (JMLR), 2023
Johannes Kirschner
Tor Lattimore
Andreas Krause
308
10
0
07 Feb 2023
On the Complexity of Representation Learning in Contextual Linear Bandits
International Conference on Artificial Intelligence and Statistics (AISTATS), 2022
Andrea Tirinzoni
Matteo Pirotta
A. Lazaric
258
1
0
19 Dec 2022
Risk-aware linear bandits with convex loss
International Conference on Artificial Intelligence and Statistics (AISTATS), 2022
Patrick Saux
Odalric-Ambrym Maillard
274
3
0
15 Sep 2022
Multi-Armed Bandits with Self-Information Rewards
IEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2022
Nir Weinberger
M. Yemini
149
9
0
06 Sep 2022
Non-Stationary Dynamic Pricing Via Actor-Critic Information-Directed Pricing
P. Liu
ChiHua Wang
Henghsiu Tsai
227
3
0
19 Aug 2022
On the Complexity of Adversarial Decision Making
Neural Information Processing Systems (NeurIPS), 2022
Dylan J. Foster
Alexander Rakhlin
Ayush Sekhari
Karthik Sridharan
AAML
292
32
0
27 Jun 2022
Regret Bounds for Information-Directed Reinforcement Learning
Neural Information Processing Systems (NeurIPS), 2022
Botao Hao
Tor Lattimore
OffRL
307
26
0
09 Jun 2022
Contextual Information-Directed Sampling
International Conference on Machine Learning (ICML), 2022
Botao Hao
Tor Lattimore
Chao Qin
425
19
0
22 May 2022
The price of unfairness in linear bandits with biased feedback
Neural Information Processing Systems (NeurIPS), 2022
Solenne Gaucher
Alexandra Carpentier
Christophe Giraud
FaML
339
3
0
18 Mar 2022
Truncated LinUCB for Stochastic Linear Bandits
Yanglei Song
Meng zhou
580
0
0
23 Feb 2022
Minimax Regret for Partial Monitoring: Infinite Outcomes and Rustichini's Regret
Annual Conference Computational Learning Theory (COLT), 2022
Tor Lattimore
201
17
0
22 Feb 2022
Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification
Neural Information Processing Systems (NeurIPS), 2021
Clémence Réda
Andrea Tirinzoni
Rémy Degenne
241
11
0
02 Nov 2021
The Value of Information When Deciding What to Learn
Dilip Arumugam
Benjamin Van Roy
199
17
0
26 Oct 2021
Apple Tasting Revisited: Bayesian Approaches to Partially Monitored Online Binary Classification
James A. Grant
David S. Leslie
296
4
0
29 Sep 2021
Information Directed Sampling for Sparse Linear Bandits
Neural Information Processing Systems (NeurIPS), 2021
Botao Hao
Tor Lattimore
Wei Deng
264
21
0
29 May 2021
Bias-Robust Bayesian Optimization via Dueling Bandits
International Conference on Machine Learning (ICML), 2021
Johannes Kirschner
Andreas Krause
323
12
0
25 May 2021
Reinforcement Learning, Bit by Bit
Xiuyuan Lu
Benjamin Van Roy
Vikranth Dwaracherla
M. Ibrahimi
Ian Osband
Zheng Wen
691
79
0
06 Mar 2021
An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraints
Neural Information Processing Systems (NeurIPS), 2021
Xin Liu
Bin Li
P. Shi
Lei Ying
415
59
0
10 Feb 2021
Experimental Design for Regret Minimization in Linear Bandits
International Conference on Artificial Intelligence and Statistics (AISTATS), 2020
Andrew Wagenmaker
Julian Katz-Samuels
Kevin Jamieson
446
16
0
01 Nov 2020
1
Page 1 of 1
