File:IMO3 - Screenshot 2023-10-16 041956 nocaption.png

English: Simple regret of different algorithms for a fixed interaction budget ${\displaystyle T=100}$ and varying logged data size. Each experiment is averaged over 10 logged data, 10 randomly selected ${\displaystyle \theta _{\ast }}$ and 5 runs under each combination of logged data and ${\displaystyle \theta _{\ast }}$.