__ Summary and Contributions__: Authors give a minimax regret lower bound (of \Sigma(n^(2/3)))which is dimension-free for sparse linear bandits in the data-poor regime where the horizon is larger than the ambient dimension and where the feature vectors admit a well-conditioned exploration distribution. Authors also give matching upper bound and with further assumption give a stronger upper bound (of O(n^(1/2)).

__ Strengths__: 1) Authors clearly point out assumptions of previous work and current work.
2) Bound proved in the paper doesnâ€™t depend on d.

__ Weaknesses__: 1) No empirical evidence that proposed methods work. Even synthetic data experiments in the data regime proposed could have been enough to convince the importance of the paper.
2) Algorithm 1 - Explore the sparsity then commit (ESTC) has two phases. First phase looks like a pure exploration phase and second phase looks like a pure exploitation phase. How does this algorithm compare to existing similar algorithm like - [1]
3) Cmin - the minimum eigenvalue of the data matrix for an exploration distribution. Is it possible to improve dependency on Cmin in upper bound or lower bound? Can authors comment more on this?
[1] Deshmukh, Aniket Anand, et al. "Simple regret minimization for contextual bandits." arXiv preprint arXiv:1810.07371 (2018).
I am satisfied with the rebuttal and experimental simulation and I have updated my score.

__ Correctness__: Looks correct!

__ Clarity__: Well written,

__ Relation to Prior Work__: Yes.

__ Reproducibility__: Yes

__ Additional Feedback__:

__ Summary and Contributions__: The paper studies the stochastic linear bandits with high dimensional sparse features. For this problem, the paper establishes a novel n^0.66 dimension free minimax regret lower bound and complement it by an explore-then-exploit algorithm that nearly matches the established lower bound.

__ Strengths__: The paper provides a thorough investigation of the high dimensional sparse linear bandits and presents novel results that should be of interest to wide audience given the popularity of linear bandits both in theory and practice. In particular the dimension free lower bound of n^0.66 is an improvement over existing linear regret bounds for data poor regimes (i.e. dimension of feature space > time horizon).
The paper also presents fairly simple but impactful algorithms that explore the sparsity and then commit (exploit) whose performance nearly matches the established lower bounds. Some of the algorithmic design aspects like sampling from the design distribution are new for this problem setting and could be of relevance for other sparse bandit problems (for eg. sparse high dimensional generalized linear bandits). The later could be follow up work of this paper.

__ Weaknesses__: The paper could do a better job of clarifying/remarking some of the technical claims/discussions. (see comments below).
Post rebuttal: I acknowledge that I have read and taken other reviewers feedback into account the rebuttal. Based on the discussion, I am decreasing the score by 1.

__ Correctness__: Yes

__ Clarity__: The paper is very well written, though there is some room for improvement in the technical discussion.

__ Relation to Prior Work__: The paper does a good job of relating to existing literature and the contributions.

__ Reproducibility__: Yes

__ Additional Feedback__: 1. One of my concern is that there's a potential chance for mis-interpreting some of the claims made by the paper. For example, the paper claims that the established lower bound is dimension free and is better than existing linear regret for data poor regimes. However as remarked by the authors, the C_min(A) could be as bad d, in which case the regret could be linear (in settings where d > n). This makes the lower bound both dimension dependent and linear in n. The paper should have disclaimer in the abstract or the contribution sections instead of pushing till end of the technical discussion (remark 4.5)
2. I would also like the paper to discuss the relation between the minimum eigen value (and the corresponding distribution) computed by equation 4.1 and sparsity.
3. Lastly, if there are arms that are clearly not optimal but are responsible in decreasing the value of C_min(A), is there an easy way to weed them out? In similar context, what can be done when A doesn't span R^d?

__ Summary and Contributions__: This paper studies the linear bundit problem with high dimensional features. A minimax lower bound for the regret is derived at the rate of n^(2/3) in the so-called data-poor regime. A matching upper bound is derived in the same regime. Lastly, with additional assumptions, an improved bound of n^(1/2) is proved. The paper borrows techniques from high dimensional statistics.
==== update: I appreciate the clarification and the efforts to add a few simulation studies. I have bumped my rating by 1.

__ Strengths__: The paper is well written. The difference with other previous results was well articulated.

__ Weaknesses__: 1. I think the "intriguing" transition between n^2/3 and n^1/2 is an overstatement. After all, if d grows with the sample size n, then it has to be factored in. d should not be viewed as a fixed constant. Similarly, the signal level s could also be a function of d, and hence, a function of n.
2. It is interesting that in the data rich regime the author can have a regret lower bound sqrt(dn) that is sqrt(s) smaller than the standard sqrt(sdn) lower bound. Note that s may also grow with n and should not be ignored. I am not fully convinced by the tightness of this lower bound.
3. It is not clear how the optimization (4.1) can be done numerically, if x follows absolutely continuous distribution. Some discussion will be helpful.
4. Much of the proofs can be moved to the supplementary materials to make rooms for some numerical studies.

__ Correctness__: The claims seem alright, despite being overstated at places.

__ Clarity__: Yes.

__ Relation to Prior Work__: Yes.

__ Reproducibility__: No

__ Additional Feedback__: