__ Summary and Contributions__: This paper mainly studies the approximation error of random feature model, neural tangent kernel model, and two-layer neural network model, for non-uniform data distribution. Specifically, an "effective dimension" is defined to characterize the informative dimension of the data, which depend on both the dimension used to generate the target (d0) and the noise level on other dimensions. For RF and NT model, the approximation error bounds depends on the effective dimension. While for NN model, the bounds only depends on d0. This difference between two types of models can help understand the performance different between kernel methods and two-layer neural networks. If the effective dimension is much larger than d0, then neural networks work better than kernel methods. Intuitively, in this case kernel methods are harmed by the noise in the input data, but neural networks can choose the features to adapt the data distribution (if I am right). The theoretical results are asymptotic as N and d tend to infinity. Theoretical understandings are supported by numerical experiments, based on the assumption that image data are distributed on a low-dimension manifold. Discussions are made on finite-data case, but no rigorous results are provided in the finite width case.
Thanks to the authors for their response. Though I'm still interested to see a sharper bound for neural networks, I agree with the intuition provided in the rebuttal. I'm not fully convinced about the ReLU issue. Since ReLU is nonsmooth, from the numerical analysis point of view, the approximation error can decay slower than models with smooth activation functions. Although ReLU can be approximated by smooth functions, as the activation functions tends to ReLU, the constant factors in the bounds may tend to infinity (e.g. depends on second-order derivatives), making the argument breaks finally at ReLU. So the results for ReLU may lose some orders on the polynomials. Nevertheless, I think the paper makes enough contribution to be accepted.

__ Strengths__: 1. A concrete example and rigorous theoretical analysis are provided to explain the reason behind the performance difference between RF, NT models and neural network model.
2. Theoretical conclusions are supported by numerical evidence.

__ Weaknesses__: 1. The analysis on neural networks are direct results induced from the kernel method results. It may not be tight, and can even suffer from the curse of dimensionality. Hence, the different between two types of models showed in the theorems may not fully characterize the actual performance difference. Neural networks can possibly perform much better than the bound.
2. While the theorems requires the activation function to be smooth, in the numerical experiments ReLU are used. Maybe it is more illustrative if smooth activation function can be used. Is there a reason for not using tanh, sigmoid, etc?

__ Correctness__: The results seem to be correct.

__ Clarity__: The paper is well organized and well written.

__ Relation to Prior Work__: Yes.

__ Reproducibility__: Yes

__ Additional Feedback__:

__ Summary and Contributions__: - Various relationships between neural networks and kernel methods have been drawing attention in the context of recent literature that aims to better understand the superior performance of neural networks in many empirical tasks. One such line of work constitutes understanding when linear approximations of wide neural networks - Random features models or the Neural tangent models, both of which are also approximations to kernel-based approaches - can (or cannot) be used to replace neural networks without much drops in performance.
- Informally speaking, the paper hypothesizes that in a supervised learning setting, when the target function depends on a low dimensional projection of the input data, then RKHS based approaches can suffer from a curse of dimensionality unless the input features are concentrated on the same low dimensional projection. Neural networks, on the other hand, do not suffer from this curse of dimensionality irrespective of the structure of the input features.
- To support these hypotheses, the paper provides a data model under which the target function depends solely on a low dimensional projection of the data and show that: 1) For a fixed sample size, the test error of the neural tangent kernel and the kernel corresponding to the random features class is lower when the low dimensional structure of the input features matches that of the target function and vice versa. 2) The approximation error of the Neural tangent class and the random features class establish the same behavior for a fixed number of features (or width). 3) The approximation error of Neural networks only depends on the low dimensional projection of the input features on which the target function relies on and is independent of the effective input dimension. Empirical evidence is also provided to support their arguments.
---------------------------------------------------------------------------------------------
---------------------------------------------------------------------------------------------
Thank you, authors, for providing clarification to points raised in the review. I maintain my pre-rebuttal evaluation.

__ Strengths__: - The paper does a very good job of thoroughly investigating the validity of the two hypotheses presented in the overview. Even though the model is relatively simple, the theoretical results provided in the paper are quite instructive and provide some insightful results. The theory is rigorous and is well supported by empirical results.
- The conceptual clarity of the work is high. The ideas are certainly relevant in the context of explaining some of the performance gaps between neural networks and kernel methods.

__ Weaknesses__: - The main weakness of the paper is that of clarity and readability. The paper is quite dense and it appears that there is not enough emphasis on the clarity of the paper. As an example, in the overview of the paper (section 1.1), the authors discuss that adding high-frequency noise to images makes the distribution of the images more "isotropic" without clarifying what exactly this means. The discussion around anisotropy extends into the Model section (where it becomes a bit clearer). A simple, intuitive explanation could have helped improve the readability of the paper.
- Certain, important, aspects of the Theorems are intuitively described. However, it would be helpful to explain the statement of the Theorems a bit further. For instance, the importance of some of the technical assumptions (the $$k^{\text{th}}$$ Hermite coefficient being non-zero or upper bounds on the derivatives) in the paper is not very clear.
- Also, clarifying certain notation (e.g., $$\omega_d(\cdot)$$ or $$O_d(\cdot))$$ would also be helpful in improving the accessibility of the paper.

__ Correctness__: To the extent that I could verify, the theoretical as well as the empirical analysis seems to be correct.

__ Clarity__: Conceptually, the paper has very good clarity but it is a bit dense and is also a bit difficult to read if one is not very familiar with the notation and some of the technical language.

__ Relation to Prior Work__: Yes

__ Reproducibility__: Yes

__ Additional Feedback__: - In Theorem 1, could the authors clarify the dependence of the test error on the regularization parameter $$\lambda$$? It could be interesting to see if the prediction error is minimised for a certain regimes in the space of the regularization parameter (of particular interest would be the case where $$\lambda$$ vanishes.)
- In the section titled "Discussion", the authors mention "we provide a sharp characterization of the test error in the high-dimensional regime where both $$d$$ and $$n$$ diverge while being polynomially related." As far as I can tell, there are two regimes in which the various results of the paper are presented: 1) when $$ N \rightarrow \infty$$ while $$n$$ and $$d$$ are finite and polynomially related (Theorem 1) and 2) $$n \rightarrow \infty$$ while $$N$$ and $$d$$ are finite and polynomially related(Theorems 2, 3 ). Unless I am missing something here, it is unclear how the test error is characterized in the high-dimensional regime as claimed in the discussion.
- In Figure 3, it is quite surprising to see that, at finite samples, the test error corresponding to the Neural network appears to be more sensitive to $$\kappa$$. Although, in the text, the authors explicitly state that it the other way around: kindly clarify. It would be insightful to consider the dependence of the estimation error of NN on $$\kappa.$$ Do the authors have some intuition for an explanation of this phenomenon?

__ Summary and Contributions__: The paper studies the approximations of two-layer neural networks (NN) and random feature (RF) models for target functions in the form g(Wx) with W be a d_0 x d matrix. It is shown that the learning with NN is only determined by the dimension d_0 (this part was already proved in previous works). However, for RF, the performance is determined by d, the dimension of the ambient space when x is distributed roughly uniformly. (This was also proved in the previous works. ) Combining them, we can see a clear separation of approximation abilities between NN and RF.
The new observation of this paper is that when the input data x is concentrated in a low d_1-dimensional space. The learning of RF is only determined by max{d_0, d_1}. So when d_1 \approx d_0, the learning with RF is as efficient as NN, while when d_1 >> d_0, the separation of RF and NN becomes significant.

__ Strengths__: From my understanding, this work is technically very sound and the claim that the performance of RF is determined by the intrinsic dimension of the input data is correct and intuitive.

__ Weaknesses__: The contribution seems very incremental to me. I do not see any new insights from this paper. The theorems are sound but are also too complicated for understanding. I do not see any benefits to use the general setting to do theoretical analysis. Why don't the authors use the simplest setting that the target function is a single neuron g(w^Tx) and discuss how the distribution of x affects the approximability with random feature models. Moreover, compared to the simple case, the general setting does not bring any new insights, except making the analysis much involved and non-intuitive.
Please correct me if I misunderstood something.

__ Correctness__: Yes

__ Clarity__: The paper is not easy to follow. The theorems are given in a form that is not easy to understand at least to me. Many notations are also used without definition, which seriously hurts the readability. For example, what are omega_d, O_d, o_{d,P}, tau^2 in the line 143-145? I know that some of them are defined in the different places of the appendix. One needs to waste a lot of time to dig out the real meaning of those notation. This is really annoying.
In Theorem 1, the regularization parameter lambda is chosen in the order of O(1). Shouldn't we decrease the regularization parameter when we have more samples?

__ Relation to Prior Work__: Yes

__ Reproducibility__: Yes

__ Additional Feedback__: === After rebuttal ===
Thanks authors for the response. Different from the trival situation that the data completely lie in a low dimensiontal space, the authors identify an effective dimension to consider the contribution of the extent of the concentration. From the understanding aspect, I still feel these results do not bring us any new insights. But the techniques developed here are nontrivial, and they may be helpful for studying the similar problems. So I raise my score to 6.

__ Summary and Contributions__: The paper proposes a theoretical study of the comparison of the representation capabilities of two-layer fully connected neural networks (NN), RKHS models, and random features (RF) (Rahimi and Recht, 2008) and neural tangent (NT) (Jacot et al. 2018) approximations of two-layer networks. The learning problem is studied in an infinite-sample setting, where the models are compared with respect to their approximation errors. The main conclusion of the work is that NN models have higher representation accuracy than the other models in comparison, when the geometric structure of the data deviates from a low-dimensional one, which is captured through the “effective dimension” concept defined in the paper.

__ Strengths__: The presented bounds are mainly revisited versions of those in the previous work (Ghorbani et al. 2019), the main difference being that the learning problem in the current work is studied under the assumption that the input data is approximately low-dimensional and the function to be learnt depends only on the low-dimensional projection of the data. While the proposed results bear resemblance to those in (Ghorbani et al. 2019), the increment is justifiable in the sense that the particular attention given to the low-dimensional setting is of practical interest for many machine learning problems.

__ Weaknesses__: The paper is well-written, and the presented results are discussed clearly with relevant experimentation. While the amount of contribution with respect to (Ghorbani et al. 2019) may be put into question, overall, I enjoyed reading this paper and found it useful. Some comments and questions for the authors:
1. The proposed results are obtained for a two-layer fully connected network architecture. I understand that this simplified model makes the theoretical analysis more tractable, but could the authors comment on to what extent they expect their results to be valid for deeper network topologies with more than two layers?
2. The proposed study assumes that the function to be learnt is of the form f_*(x) = phi(U^T x). Then, in this setting the NN models are shown to outperform, RKHS models and linear NN approximations in terms of representation power. I am wondering whether the particular function model “phi(U^T x)” assumed in the paper would tend to trivially favor NN models (in comparison to e.g. RKHS models), as it consists of a “linear projection followed by a nonlinear scalar function”, just like in neural network hypothesis classes. This being said, I also understand that the form f_*(x) = phi(U^T x) is the way that authors characterize the “low-dimensionality” of the function class to be learnt, to which I have no objection. Some further comments on these issues would be useful.
3. I guess an important future direction of this study would be the incorporation of finite sample effects into the bounds. I would encourage the authors to pursue their efforts in this direction towards a more mature extension of their work.
4. The current experimental results only compare the NN methods. How would the performance of RKHS methods be in these experiments?
Minor comments:
1. The difference between the problem formulations (1) and (2) is not clear. Please explain their difference clearly, by modifying the notation if necessary. Are the coefficients (a, b) and the network weights W variable in both problems? Are some of them fixed in (2)?
2. In Theorem 1, please define what the notation “omega_d(.)” means.

__ Correctness__: Seem to be so.

__ Clarity__: Yes.

__ Relation to Prior Work__: Yes.

__ Reproducibility__: Yes

__ Additional Feedback__: I have read the feedback from the authors. I would like to thank the authors for their answers to my questions.