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

Sabarish Sainathan

dblp:336/2862 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 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
2 papers
Learning theory · 57% Deep learning architectures and training · 38% Kernel, tree and ensemble methods · 6%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › neural network theory
infinite-width limit
0.712023
Feature-Learning Networks Are Consistent Across Widths At Realistic Scales · NeurIPS 2023
Machine learning › Deep learning architectures and training › training dynamics
lazy training regime
0.712023
The Onset of Variance-Limited Behavior for Networks in the Lazy and Rich Regimes · ICLR 2023
Machine learning › Learning theory
neural network theory
0.712023
The Onset of Variance-Limited Behavior for Networks in the Lazy and Rich Regimes · ICLR 2023
Machine learning › Learning theory › neural network theory › neural network kernels
neural tangent kernel
0.712023
Feature-Learning Networks Are Consistent Across Widths At Realistic Scales · NeurIPS 2023
Machine learning › Deep learning architectures and training
training dynamics
0.712023
Feature-Learning Networks Are Consistent Across Widths At Realistic Scales · NeurIPS 2023
Machine learning › Kernel, tree and ensemble methods
model ensemble
0.212023
Feature-Learning Networks Are Consistent Across Widths At Realistic Scales · NeurIPS 2023

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

spectral analysis · 0.7kernel theory · 0.7
YearPublicationVenuePosition
2023 The Onset of Variance-Limited Behavior for Networks in the Lazy and Rich Regimes
Alexander B. Atanasov, Blake Bordelon, Sabarish Sainathan, Cengiz Pehlevan
ICLR3
2023 Feature-Learning Networks Are Consistent Across Widths At Realistic Scales
abstract
We study the effect of width on the dynamics of feature-learning neural networks across a variety of architectures and datasets. Early in training, wide neural networks trained on online data have not only identical loss curves but also agree in their point-wise test predictions throughout training. For simple tasks such as CIFAR-5m this holds throughout training for networks of realistic widths. We also show that structural properties of the models, including internal representations, preactivation distributions, edge of stability phenomena, and large learning rate effects are consistent across large widths. This motivates the hypothesis that phenomena seen in realistic models can be captured by infinite-width, feature-learning limits. For harder tasks (such as ImageNet and language modeling), and later training times, finite-width deviations grow systematically. Two distinct effects cause these deviations across widths. First, the network output has an initialization-dependent variance scaling inversely with width, which can be removed by ensembling networks. We observe, however, that ensembles of narrower networks perform worse than a single wide network. We call this the bias of narrower width. We conclude with a spectral perspective on the origin of this finite-width bias.
Nikhil Vyas 0001, Alexander B. Atanasov, Blake Bordelon, Depen Morwani, Sabarish Sainathan, Cengiz Pehlevan
NeurIPS5