On the Variance, Admissibility, and Stability of Empirical Risk Minimization

It is well known that Empirical Risk Minimization (ERM) may attain minimax suboptimal rates in terms of the mean squared error (Birg\'e and Massart, 1993). In this paper, we prove that, under relatively mild assumptions, the suboptimality of ERM must be due to its large bias. Namely, the variance error term of ERM is bounded by the minimax rate. In the fixed design setting, we provide an elementary proof of this result using the probabilistic method. Then, we extend our proof to the random design setting for various models. In addition, we provide a simple proof of Chatterjee's admissibility theorem (Chatterjee, 2014, Theorem 1.4), which states that in the fixed design setting, ERM cannot be ruled out as an optimal method, and then we extend this result to the random design setting. We also show that our estimates imply the stability of ERM, complementing the main result of Caponnetto and Rakhlin (2006) for non-Donsker classes. Finally, we highlight the somewhat irregular nature of the loss landscape of ERM in the non-Donsker regime, by showing that functions can be close to ERM, in terms of $L_2$ distance, while still being far from almost-minimizers of the empirical loss.

Paper

References (60)

Scroll for more · 38 remaining

Similar papers

Peer review

Reviewer hXZP7/10 · confidence 3/52023-07-06

Summary

This paper proves that variance for ERM enjoys a a minimax rate. The findings indicate that in scenarios where ERM is not optimal, the source of suboptimality lies within the bias component. Furthermore, these insights are extended to encompass an admissibility-type theorem for both fixed and random design, as well as a stability result for ERM. The paper's contributions can be summarized as follows: 1)Demonstrating the optimality of the variance term in both fixed and random design situations. 2)The obtained results automatically yield a stability result for ERM. 3)Presenting a simpler proof for the admissibility theorem in the fixed and random design setting. 4)Highlighting a counterintuitive outcome concerning the ERM estimator $\widehat{f}_n$: when $f'$ is close to $\widehat{f}_n$, it can lead to a large squared error.

Strengths

The paper studies an important problem, provides convincing conclusion. The problem is not only intellectually interesting, it also advances our understanding of ERM, which is arguably the most important estimator for modern machine learning.

Weaknesses

Typo: above Equation 1 $f^* \in f^*$. Remark should be referred to in the appendix.

Questions

Given dense results here, it would help reader to better understand the paper if the theorems could be summarized in a table.

Rating

7: Accept: Technically solid paper, with high impact on at least one sub-area, or moderate-to-high impact on more than one areas, with good-to-excellent evaluation, resources, reproducibility, and no unaddressed ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

3 good

Contribution

4 excellent

Limitations

NA

Reviewer ZyPC7/10 · confidence 3/52023-07-06

Summary

This paper explores the minimax optimality of ERM in terms of the bias and variance of the ERM method. They find in some settings that the variance is always at the minimax rate, implying that suboptimality can only occur due to bias. This paper also explores stability of ERM, finding that almost-minimizers are close to the ERM w.r.t the population distribution, but not necessarily the empirical distribution.

Strengths

* Cool results and proofs in the fixed design setting * The random design setting results are very interesting as well, albeit harder to digest all the quantities.

Weaknesses

* The independence relations should be clarified in the preliminaries. I assume that $\mathbf{\xi}$ is independent from $\mathbf{X}$ in the random design case, but I don't think that's mentioned. Minor Typos: * In the proof of Theorem 2, $\mathcal{G}$ and $\mathcal{G}_\star$ seem to be used interchangeably. * The statement of Lemma 2 in the proof of Theorem 2 seems to have a typo? I think it should be $f$ instead of $f^\star$.

Questions

* Given that assumption 8 is necessary to get from a $\epsilon_V^2$ to an $\epsilon_\star^2$ bound, how restrictive is this assumption?

Rating

7: Accept: Technically solid paper, with high impact on at least one sub-area, or moderate-to-high impact on more than one areas, with good-to-excellent evaluation, resources, reproducibility, and no unaddressed ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

3 good

Contribution

3 good

Limitations

The authors have adequately addressed the limitations.

Reviewer DCZr7/10 · confidence 3/52023-07-08

Summary

This paper studies the suboptimality of Empirical Risk minimization (ERM) of the squared loss, or equivalently, Least Squares (LS), for convex function classes, in both fixed and random design settings. In the context of non-parametric statistics, necessary and sufficient conditions for the optimality of LS are not known (though sufficient conditions were given by Birge and Massart, '93). Roughly speaking, the main message of this paper is showing in both settings that the suboptimality is due to the bias term, where the variance term enjoys minimax rates, under some reasonable assumptions.

Strengths

This paper studies a classic and fundamental question in statistics, understanding the suboptimality of Least Squares. This paper makes nice progress in this direction. Besides the main result (mentioned in the summary), there are several other contributions, such as the (weak) admissibility property of the ERM in the random design setting; sometimes ERM can be optimal. Moreover, one of the results shows that ERM is stable; all approximate minimizers of the squared loss are close to each other in the functions space, and on the other end, the converse doesn't hold, sometimes the ERM is an optimal estimate and there exist close functions to it with high empirical error. Also, the proof techniques (the isoperimetry approach for example) look interesting and elegant.

Weaknesses

I don't see any. There is a chance that I didn't understand some details, this is not my main research field and some proof techniques were new to me.

Questions

Typos: line 69: should be $f*\in F$. line 16: should be "in detail".

Rating

7: Accept: Technically solid paper, with high impact on at least one sub-area, or moderate-to-high impact on more than one areas, with good-to-excellent evaluation, resources, reproducibility, and no unaddressed ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

3 good

Contribution

3 good

Limitations

I don't see any.

Reviewer vswn6/10 · confidence 2/52023-07-09

Summary

The paper considers the Empirical Risk Minimization (ERM) problem with squared loss and shows that the suboptimality of ERM is due to the bias rather than variance.

Strengths

This paper is quite theoretical and technical. The paper provides useful insights in different aspects. The paper finds that (1) the variance term of ERM agrees with the minimax rate of estimation in both fixed and random design, (2) ERM is stable, (3) the landscape of near-solution for non-Donsker class is irregular, (4) the relation between isoperimetry and variance of ERM.

Weaknesses

The main weakness is organization. Too many results wrapped in nine pages makes reader feel the paper is very crowded. Some definitions and results could be explained more detailedly. For example, what does it mean by the minimax rate of ERM and variance, respectively? What is local optimality? Donsker and non-donsker classes. Any specific application of current results? Technical differences between fixed and random design could be explained on a very high level.

Questions

I found that this paper is more suitable for conference like COLT instead of NIPS. Audience from learning theory filed might be more interested in this topic.

Rating

6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.

Confidence

2: You are willing to defend your assessment, but it is quite likely that you did not understand the central parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

2 fair

Contribution

2 fair

Limitations

More examples and applications should be included. Otherwise, it is a merely technical paper with no practical usage.

Reviewer XB3R6/10 · confidence 3/52023-07-19

Summary

This paper studies the classic problem of regression under noisy observations, with a convex and closed function class $\mathcal{F}$. In particular, the paper considers the performance of the Empirical Risk Minimizer (ERM) under the mean squared error, in both the fixed design and random design settings. At a high level, the author(s) show that: 1. The variance of the ERM is comparable to the minimax rate of regression, implying that when ERM is not minimax-optimal, it must be due to large bias 2. ERM is admissible up to constant factors, via a simpler proof using fixed point theorems 3. ERM enjoys stability, in the sense that all almost-empirical-loss-minimizers also have similar expected loss as the actual empirical loss minimizer. 4. For "non-Donsker" function classes, the converse of 3 is false, that there is always some ground truth function $f^* \in \mathcal{F}$ such that, with high probability over the samples and noise, there is a function $f_{\mathrm{bad}}$ whose expected loss close to the ERM, but that its empirical loss is much larger than the ERM's. I did the following review as an emergency review, so I did not check the details/appendices carefully.

Strengths

The ERM is perhaps the most commonly used regression estimator. This paper furthers our understanding of its behavior, particularly for function classes where ERM isn't minimax-optimal. I found the introduction well-written, describing each result at a high level. I also find the observation that "non-minimax-optimality must be due to bias" to be an interesting result.

Weaknesses

While I liked the paper, and recommend a weak accept, I think there are the following writing/presentational issues that can be improved. Overall, my comment is that the paper currently perhaps reads better for experts who have worked on ERM (or at least, in empirical process theory), but not that easy to read for a more general learning theory audience. - The paper reads a bit like a collection of related results, but without a "main point", and could maybe be strung together better as a story. For example, the "variance <= minimax-rate" result and the stability result seem somewhat disjoint in the introduction, even though later on in Theorem 1, they are shown together as one big result. I was also a bit confused about the writing in Section 2, in terms of the narrative. For example, I don't quite understand how Theorem 2 "complements" Theorem 1 (cf. Line 150), though Theorem 2 is a cool result itself with the local minimax optimality and is used to prove Corollary 1 (the admissibility result). Moreover, Theorem 3 also "complements" Theorem 1 (cf. Line 185), but there's a quadratic gap. Is the gap necessary? - I also found that the technical Section 2 is a bit too heavy on definitions and assumptions and not enough interpretation. When I was reading, I felt that the author(s) tried hard to succinctly give the most general results that are shown, but in my opinion, for readability, it might be better to start with simpler cases (and perhaps even informal versions) of statements (particularly the assumptions), and provide more interpretation. - Related to the above point, some of the assumptions/quantities in the results are stated without much interpretation or intuition (in the main body). There are also a few comments along the lines of "this assumption is considered mild in the literature/by some other authors" without much additional interpretation. This makes the paper not quite as self-contained as it could be. This issue is particularly prevalent in Section 2.2 (especially the isoperimetry assumptions), and it became quite hard to interpret the results. I can see that there are some remarks in the appendices, but I think a lot of them really should be in the main body for readability. - The term non-Donsker was never defined in the main body, even though it is a key element in a main result. While Donsker classes are a basic object in empirical process theory, I don't think it should be assumed knowledge for the general theory reader. There is also a lack of discussion on whether Theorem 4 only hold for non-Donsker classes, or more generally what's the significance of the assumption: whether it's a necessary condition for the result, or just that this is the result that can be proved.

Questions

Minor questions and comments: 1. Please consider using the same number-counter across all of definitions/theorems/assumptions. It was hard to scroll through the paper looking at backward references when reading. 2. (Line 164) The author(s) mention that $\mathcal{G}_\ast$ in Theorem 2 can replace 2 with any other absolute constant. How does the replacement propagate to Theorem 2? Does it change the constants in the $\asymp$? 3. Theorem 6, the assumptions 1,2,4,6 have nothing to do with the instantiation of $\mathbf{X}$?

Rating

6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

4 excellent

Presentation

2 fair

Contribution

3 good

Limitations

N/A

Reviewer XB3R2023-08-10

I thank the authors for their response. I hope the authors will actually implement the changes described, since they all will make the paper a lot more readable and self-contained. My final comment is that the sentence "Beyond mere intellectual curiosity, our results demonstrate the salience of finding computationally efficient methods to debias ERM" from the overall response is useful to emphasize further in the final paper. I will maintain my current score.

Reviewer hXZP2023-08-17

The rebuttal solves all my concerns

The rebuttal solves all my concerns

Program Chairsdecision2023-09-21

Decision

Accept (spotlight)

© 2026 NYSGPT2525 LLC