__ Summary and Contributions__: 1) derived analytic expression (using CGMT) of the generalization error of linear classifiers in learning a single-index model with $\ell_2$ regularization; 2) evaluated various commonly-used losses and compared with the Bayes-optimal baseline; 3) determined the Bayes-optimal loss and regularization strength.

__ Strengths__: The is a solid paper with a number of interesting findings. The theoretical analysis is complete and the results are nicely presented. I find the high-dimensional characterization of different loss functions interesting, and I believe the results will be relevant to the community (since the double descent phenomenon has attracted much attention).

__ Weaknesses__: The setup (unit Gaussian data; binary model) is a bit limited, and the tool (CGMT) is relatively well-known.
For additional comments see the questions section.

__ Correctness__: To my knowledge yes.

__ Clarity__: Yes.

__ Relation to Prior Work__: The original Gordon's comparison theorem is not cited.
In addition, for the double descent literature, I'm not sure why the "Dynamics of Generalization in Linear Perceptrons" paper is cited, instead of the 1992 paper "A Simple Weight Decay Can Improve Generalization".

__ Reproducibility__: Yes

__ Additional Feedback__: I have the following questions for the authors:
1. Is there a general criteria that tells me if a particular loss function achieves the 1/n fast rate for this problem?
2. to what extent does the analysis of generalization error extend beyond isotropic Gaussian data and $\ell_2$ regularization? My impression is that some rotation invariance is required in the current derivation, but previous CGMT-type analysis is also able to handle general covariances.
3. it is known that the SVM objective may also achieve a fast rate of 1/n, for instance:
Sridharan, Karthik, Shai Shalev-Shwartz, and Nathan Srebro. "Fast rates for regularized objectives." Advances in neural information processing systems. 2009.
Can the authors comment on the difference?
4. (minor) out of curiosity, my impression is the system of equations that describes the generalization error can often be derived by both AMP and CGMT. Is there a particular reason that CGMT is used in this work (i.e. limitation of the AMP approach)?
-----------------------------------
Post-rebuttal:
The authors addressed some of my concerns; I'm therefore keeping the positive score.

__ Summary and Contributions__: The paper discusses the performance of regularized empirical risk minimization for the high dimensional perceptron model. Specifically their rigorous results concern the model: for i=1,2,...,n Y_i=sign(<X_i,w^*>) for Gaussian prior on w^* and Gaussian X_i where they live on d dimensions. They assume n/d=\alpha (constant) and n,d grow to infinity. In [10] the Bayes optimal reconstruction error has been studied (verifying a stats physics prediction) and here they discuss about the performance of regularize ERM (potentially convex methods) to achieve it.
Their first set of results is about the performance of any \ell_2 regularized convex loss and showing that their performance can be tracked using a fixed point equation. The result is based on Gordon's minimax theory and is shown then to be verifying also the replica (stats physics) prediction.
Then the authors proceed by numerically checking the performance of the ridge loss, the logistic loss and the hinge loss for various regularization parameters.
For ridge, they see the expected double descent behavior for small \lambda and they see always a gap between ridge and Bayes-optimal. Interestingly for hinge and logistic the difference from the Bayes-optimal error is smaller. Also there is some discussion on how Rademacher complexity fails to reveal the optimal rate of estimation for large \alpha. Finally there is some discussion about how the (poly-time) Approximate Message Passing (AMP) in this regime can give a *non-convex* loss and an appropriate regularization which gives an optimal regularized ERM for the problem.
The authors mention in multiple places that there results should be generalizable to many more settings.

__ Strengths__: The paper is definitely interesting in many ways. This is a regime where there is no computational-statistical gap (AMP reaches the Bayes-optimal performance) and therefore convex ERM could solve the problem to optimality - I think the authors should mention in the introduction. The authors provide very tight rigorous and non-trivial results on their asymptotic performance showing that also they match the replica predictions from statistical physics. The numerical simulation part is also very interesting and its add to the long line of work in ML which tries to understand the generalization performance of convex methods. It is also nice to see the double descent behavior appearing in the analysis of the square loss.

__ Weaknesses__: The main weakness of the work is that in many ways it remains non-rigorous and many claims are observed through simulations. It would have been great to obtain provable analysis of the fixed point equations and what they imply in terms of success/failure for the various losses to achieve the Bayes-optimal performance. Also, I would *strongly* encourage the authors to be more open about which parts of the papers are rigorous and which are not: e.g. in line 145 the authors say that their results are valid for a wide range of regularizers, yet I am not sure which results they refer to and how do they know it as the statements are only from \ell_2. Please provide more details on this.
Also the discussion with the Rademacher complexity seems puzzling to me. While I agree with it and I think it is interesting, I feel it has a lot of overlap with the work [49] from earlier this uear. I think the authors should mention in the Introduction when they describe their contributions, and recognize the similarities with this work early on.

__ Correctness__: 1. I think some more details on the proof of Theorem 4.1. are needed. Why ERM given by (17) is identical with Bayes-optimal AMP?
2. By skimming through the proof of the important Theorem 2.2. (page 12 in the Appendix) I am puzzled by the following thing: Yes, Gordon's comparison inequality does say that \Phi and \tilde{\Phi} concentrate around the same optimal value, but it seems to me that the authors use that their *argmax* are also converging to each other, to replace completely the optimization problems and derive the desired conclusion. Am I reading this correctly? If yes, can more details be provided to convince me and the reader for the validity of this part?
Gordon argmax also transfers?

__ Clarity__: Yes, the paper is well-written.

__ Relation to Prior Work__: I would suggest a better comparison with [49]. Also I would like to see a more extended literature review of rigorous analysis of ERM with regularization for the perceptron setting.

__ Reproducibility__: Yes

__ Additional Feedback__: In (1) the P_{out} should have been a conditional distribution, right?

__ Summary and Contributions__: In this article, the authors considered the high-dimensional classification problem in a teacher-student setting, and investigated the generalization performance of standard classifiers in the limit of a high (data) dimension d and the number of samples n, with a finite ratio alpha=n/d. Assuming the data x_mu to be i.i.d. standard Gaussian and the labels generated from a sign-teacher: y_mu = sign(x_mu * w^*) (that is a linearly separable model), for some Gaussian ground truth w^*, the classification generalization performances were given for popular convex losses (e.g., square, logistic and hinge loss) with positive l_2 regularization (Theorem 2.2). The proof is based on Gordonâ€™s minimax theory and matches results from replica heuristics. The generalization performance of different classifiers was then compared to the Bayes-optimal performance. An optimal (non-convex) loss and the associated regularization were then proposed to achieve the Bayes-optimal performance (Theorem 4.1).

__ Strengths__: The claims are, as far as I can check, correct, and match empirical evaluations on systems of moderate sizes. The author considered the classification setting and made an in-depth discussion on the impact of loss functions and regularization. The high-dimensional asymptotics was then compared to classical VC dimension and Rademacher statistical bounds, showing that the proposed analysis provides "sharper" results on this particular model.

__ Weaknesses__: The contribution of this work is somehow incremental from a purely technical perspective since, as pointed out in the "Related works" paragraph, the same proof technique is applied to a new but somehow not very different model, i.e., sign-teacher with regularization. And the motivation for this sign-teacher is not very clear. Also, the Gaussian assumptions for both the data and the ground truth vector can be strong, it would be helpful to discuss how the conclusion might be extended beyond this setting, perhaps even empirically.

__ Correctness__: The claims are, as far as I can check, correct.

__ Clarity__: The paper is in general well written.

__ Relation to Prior Work__: Previous efforts are clearly discussed.

__ Reproducibility__: Yes

__ Additional Feedback__: * line 155: "whose Moreau-Yosida regularization eq. (12) ..." bad reference here?
===========================
After rebuttal:
I've read the authors' response and my score remains the same.

__ Summary and Contributions__: This paper investigates the perceptron problem in a teacher-student scenario in which the output is generated from the teacher with i.i.d. Gaussian random inputs. Several learning rules, based on arbitrary convex losses with $\ell_2$ regularization and the Bayesian framework, are systematically compared in terms of the generalization error $\epsilon_g$. The contributions of the paper is three-fold. The first is to analytically rigorously derive the generalization error in generic convex losses. This resultantly justifies several known results derived by using the heuristic replica method from statistical physics. The second contribution is the detailed analysis of three convex losses: square, hinge, and logistic losses. This shows that the near Bayes-optimal error can be achieved by hinge and logistic losses with optimized regularization, including the learning rate scaling $\epsilon_g=O(\alpha^{-1})$ where $\alpha=n/d$ is the ratio between the dataset size $n$ and the dimensionality of the input $d$. It is also pointed out that bounds based on Rademacher complexity and Vapnik-Chervonenkis (VC) dimension lead to the scaling $O(\alpha^{-1/2})$ and thus are much looser. The third contribution is a systematic construction of a loss and an estimator achieving the Bayes-optimal error.

__ Strengths__: I think the first contribution, the rigorous derivation of the generalization error, is appealing to people in NeurIPS community whose background is mathematics or physics. Especially for physicists, the replica method is a powerful utility but it is longly criticized due to the lack of rigorousness. The present method seems to be applied to a rather wide range of problems and thus can be a good alternative to the replica method.
The second contribution is also considered to be important. The Bayes optimality is a nice theoretical baseline because it is considered that no better algorithm exist. The present result showing the near optimality of the hinge and logistic losses with optimized regularization provides a good support for using those losses. It is also interesting that the max-margin classifier also exhibits comparable performance with those cases. Comparing these results with the bounds based on the Rademacher complexity and the VC dimension in terms of the learning rate, the author(s) additionally discussed about the usefulness of the bounds based on the uniform convergence. Those bounds inevitably lead to looser scaling in the learning rate, implying the insufficiency of the uniform convergence framework for understanding generalization. I think this discussion would be useful for theoreticians interested in generalization issues in modern machine learning models.

__ Weaknesses__: A weak point of the paper is the lack of direct consequence to practitioners. If any algorithm or theoretical knowledge relevant for practitioners are shown, it is really welcome.
Another minor point is about the third contribution of the paper: the construction of the loss and estimator reaching the Bayes optimality. For me, it seems that the construction requires some information in the Bayesian framework such as $Z_{out^*}$, but if such information is available one seems to be able to directly work on the Bayesian framework. Is this incorrect? Is there any situation that the Bayesian cannot be used but the presented estimator can be? An explanation about this point is desired.

__ Correctness__: I have checked several points in the theoretical computations and found they are correctly conducted. The numerical experiments well support the theoretical computations, and hence the results are considered to be correct.

__ Clarity__: The paper is well organized and equipped with nice appendices well summarizing the very detailed computations. No big flaw is found. I only give the list of typos which I found:
Line 72: technics -> techniques
In references: Some references have typos:
[27]: cdma -> CDMA
[28]: bp -> BP, bayesian -> Bayesian
[38]: & -> &
[50]: vapnic-chervonenkis -> Vapnic-Chervonenkis
[52]: bayesian -> Bayesian
In appendix:
Line 123: must defined -> must define
Line 199: $=$ is missed.
Eq. (V.27): 1/\sqrt{d}Xw^* -> |1/\sqrt{d}Xw^*| (absolute value seems to be missed)
Line 577: 1.10^(-2) -> 0.01 or 10^(-2)
Line 615: need to used -> need to use
# Comments after rebuttal
The author rebuttal is satisfactory. I would like to keep my positive score.

__ Relation to Prior Work__: The paper cites a broad range of references and its relevance is well explained in the light of them. The difference from previous contributions is clear.

__ Reproducibility__: Yes

__ Additional Feedback__: