Picture for Zhaoqi Li

Zhaoqi Li

Optimal Exploration is no harder than Thompson Sampling

Add code
Oct 24, 2023
Figure 1 for Optimal Exploration is no harder than Thompson Sampling
Figure 2 for Optimal Exploration is no harder than Thompson Sampling
Figure 3 for Optimal Exploration is no harder than Thompson Sampling
Figure 4 for Optimal Exploration is no harder than Thompson Sampling
Viaarxiv icon

Instance-optimal PAC Algorithms for Contextual Bandits

Jul 05, 2022
Figure 1 for Instance-optimal PAC Algorithms for Contextual Bandits
Viaarxiv icon

Exploration of Numerical Precision in Deep Neural Networks

May 03, 2018
Figure 1 for Exploration of Numerical Precision in Deep Neural Networks
Figure 2 for Exploration of Numerical Precision in Deep Neural Networks
Figure 3 for Exploration of Numerical Precision in Deep Neural Networks
Figure 4 for Exploration of Numerical Precision in Deep Neural Networks
Viaarxiv icon