This papers views high dimensional sparse bandits from an interesting data-poor angle. The discussion of lower bounds in this setting versus the standard setting is very interesting. It is interesting that the rate becomes n^{2/3} in the data poor regime and that it is matched by an explore-exploit algorithm.