Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Amartya Mitra

dblp:277/5378 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › over-parameterization
double descent
0.612022
Multi-scale Feature Learning Dynamics: Insights for Double Descent · ICML 2022
Machine learning › Learning theory › neural network theory › feature learning theory
feature learning dynamics
0.612022
Multi-scale Feature Learning Dynamics: Insights for Double Descent · ICML 2022
Machine learning › Learning theory
generalization
0.612022
Multi-scale Feature Learning Dynamics: Insights for Double Descent · ICML 2022

Methods — techniques the papers use, named apart from their topics

teacher-student setup · 0.6linear model analysis · 0.6
YearPublicationVenuePosition
2022 Multi-scale Feature Learning Dynamics: Insights for Double Descent
abstract
An intriguing phenomenon that arises from the high-dimensional learning dynamics of neural networks is the phenomenon of “double descent”. The more commonly studied aspect of this phenomenon corresponds to model-wise double descent where the test error exhibits a second descent with increasing model complexity, beyond the classical U-shaped error curve. In this work, we investigate the origins of the less studied epoch-wise double descent in which the test error undergoes two non-monotonous transitions, or descents as the training time increases. We study a linear teacher-student setup exhibiting epoch-wise double descent similar to that in deep neural networks. In this setting, we derive closed-form analytical expressions describing the generalization error in terms of low-dimensional scalar macroscopic variables. We find that double descent can be attributed to distinct features being learned at different scales: as fast-learning features overfit, slower-learning features start to fit, resulting in a second descent in test error. We validate our findings through numerical simulations where our theory accurately predicts empirical findings and remains consistent with observations in deep neural networks.
Mohammad Pezeshki, Amartya Mitra, Yoshua Bengio, Guillaume Lajoie
ICML2