To efficiently solve online problems with complicated constraints, projection-free algorithms including frank-wolfe (OFW) and its variants have received significant interest recently. However, in the general case, existing efficient only achieved regret bound of O(T^{3/4}), which is worse than projection-based algorithms, where T number decision rounds. In this paper, we study special case lear...