Before revision:  We show that the first algorithm, which is a generalization of 22 to the T level case, can achieve a sample complexity of O(1/\epsilon^6) by using mini-batches of samples in each iteration.
After revision:  We show that the first algorithm, which is a generalization of \mbox{%DIFAUXCMD GhaRuswan20 to the T level case, can achieve a sample complexity of O(1/\epsilon^6) by using mini-batches of samples in each iteration.