All the reviewers have praised the paper for the theoretical

We provide storage, time, and regret guarantees for our algorithm. Our regret bound is novel vs. prior work with MB has minimal tuning, and needs much less storage. Also, by using a simpler basis (step functions) we get lower storage, runtime. MB under resource constraints (i.e., on-policy settings) would be unfair. (Table 1).