8ba6c657b03fc7c8dd4dff8e45defcd2-AuthorFeedback.pdf

The primary novelty in our analysis is quantifying the relationship between the algorithm sample complexity and9 the lower bound we provide. Unliketheupper bound, weagree that thelower bound isobtained using standard techniques and weacknowledge20 this fact in our manuscript. However, we believe the tight lower bound we give is an important result to be able to21 characterize optimality. Wewill36 provide further details on the computation ofλ inthe paper thanks toyour suggestion. Reviewer 4: Thank you for the careful review and giving several useful suggestions.