We revisit the challenge of designing online algorithms for the bandit convex
optimization problem (BCO) which are also scalable to high dimensional
problems. Hence, we consider algorithms that are \textit{projection-free},
i.e., based on the conditional gradient method whose only acce