HackerPapers

arXiv:1903.07571cs.LG

Two models of double descent for weak features

Mikhail Belkin, Daniel Hsu, Ji Xu

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

The "double descent" risk curve was proposed to qualitatively describe the out-of-sample prediction accuracy of variably-parameterized machine learning models. This article provides a precise mathematical analysis for the shape of this curve in two simple data models with the least squares/least norm predictor. Specifically, it is shown that the risk peaks when the number of features $p$ is close to the sample size $n$, but also that the risk decreases towards its minimum as $p$ increases beyond $n$. This behavior is contrasted with that of "prescient" models that select features in an a priori optimal order.

arXiv comments
Journal reference
SIAM Journal on Mathematics of Data Science, 2(4):1167-1180, 2020
DOI
doi:10.1137/20M1336072
Subjects
cs.LGMachine Learning stat.MLMachine Learning (Statistics)

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jul 2020 to Jul 2020.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Most of the DL models we use are already above the "interpolation threshold" because they use millions of parameters which implies that they are already being trained in the "double descent" regime. Those papers and more [0] argue to explain why using millions of parameters…

      seesawtronView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.