Get our free extension to see links to code for papers anywhere online!

Chrome logo  Add to Chrome

Firefox logo Add to Firefox
Picture for Tor Lattimore

Tor Lattimore
Alert button

Bandit Phase Retrieval


Jun 04, 2021
Tor Lattimore, Botao Hao

Add code
Alert button

Figure 1 for Bandit Phase Retrieval

   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Minimax Regret for Bandit Convex Optimisation of Ridge Functions


Jun 01, 2021
Tor Lattimore

Add code
Alert button

Figure 1 for Minimax Regret for Bandit Convex Optimisation of Ridge Functions
Figure 2 for Minimax Regret for Bandit Convex Optimisation of Ridge Functions
* 11 pages 
   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Information Directed Sampling for Sparse Linear Bandits


May 29, 2021
Botao Hao, Tor Lattimore, Wei Deng

Add code
Alert button

Figure 1 for Information Directed Sampling for Sparse Linear Bandits
Figure 2 for Information Directed Sampling for Sparse Linear Bandits
Figure 3 for Information Directed Sampling for Sparse Linear Bandits
Figure 4 for Information Directed Sampling for Sparse Linear Bandits

   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

On the Optimality of Batch Policy Optimization Algorithms


Apr 06, 2021
Chenjun Xiao, Yifan Wu, Tor Lattimore, Bo Dai, Jincheng Mei, Lihong Li, Csaba Szepesvari, Dale Schuurmans

Add code
Alert button

Figure 1 for On the Optimality of Batch Policy Optimization Algorithms
Figure 2 for On the Optimality of Batch Policy Optimization Algorithms
* 29 pages, 8 figures 
   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Geometric Entropic Exploration


Jan 07, 2021
Zhaohan Daniel Guo, Mohammad Gheshlaghi Azar, Alaa Saade, Shantanu Thakoor, Bilal Piot, Bernardo Avila Pires, Michal Valko, Thomas Mesnard, Tor Lattimore, Rémi Munos

Add code
Alert button

Figure 1 for Geometric Entropic Exploration
Figure 2 for Geometric Entropic Exploration
Figure 3 for Geometric Entropic Exploration
Figure 4 for Geometric Entropic Exploration

   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Asymptotically Optimal Information-Directed Sampling


Nov 11, 2020
Johannes Kirschner, Tor Lattimore, Claire Vernade, Csaba Szepesvári

Add code
Alert button

Figure 1 for Asymptotically Optimal Information-Directed Sampling
Figure 2 for Asymptotically Optimal Information-Directed Sampling
Figure 3 for Asymptotically Optimal Information-Directed Sampling
Figure 4 for Asymptotically Optimal Information-Directed Sampling

   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

High-Dimensional Sparse Linear Bandits


Nov 08, 2020
Botao Hao, Tor Lattimore, Mengdi Wang

Add code
Alert button

Figure 1 for High-Dimensional Sparse Linear Bandits
Figure 2 for High-Dimensional Sparse Linear Bandits
* Accepted by NeurIPS 2020 
   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient


Nov 08, 2020
Botao Hao, Yaqi Duan, Tor Lattimore, Csaba Szepesvári, Mengdi Wang

Add code
Alert button


   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email
<<
1
2
3
4
5
6
7
8
>>