scispace - formally typeset
G

George E. Dahl

Researcher at Google

Publications -  66
Citations -  36393

George E. Dahl is an academic researcher from Google. The author has contributed to research in topics: Artificial neural network & Hidden Markov model. The author has an hindex of 36, co-authored 56 publications receiving 29759 citations. Previous affiliations of George E. Dahl include Microsoft & University of Toronto.

Papers
More filters
Posted Content

What Will it Take to Fix Benchmarking in Natural Language Understanding

TL;DR: The authors argue that the recent trend to abandon IID benchmarks in favor of adversarially-constructed, out-of-distribution test sets ensures that current models will perform poorly, but ultimately only obscures the abilities that we want our benchmarks to measure.
Journal ArticleDOI

Unifying Grokking and Double Descent

TL;DR: The authors proposed a framework for model-wise Grokking and double descent, which can be seen as instances of the same learning dynamics within a framework of pattern learning speeds, and demonstrate that this framework also applies when varying model capacity instead of optimization steps.
Posted ContentDOI

Protocol to generate DNA aptamer coated particles and utilization for affinity-based screening with particle display

TL;DR: Qin Yang Aptitude Medical Systems Inc Ali Bashir Google Research Jinpeng Wang Stephan Hoyer Google Research Wenchuan Chou Cory McLean Google Research Geoff Davis Google Research Qiang Gong Zan Armstrong Google Research Junghoon Jang Hui Kang Annalisa Pawlosky Google Research Alexander Scott George E. Dahl Google Research Marc Berndl Google Research Michelle Dimon (  mdimon@google.com ) Google Research B. Scott Ferguson ( scott.ferguson@aptitudemedical.com
Journal ArticleDOI

Leave Graphs Alone: Addressing Over-Squashing without Rewiring

TL;DR: In this article , a graph echo state network (GESN) is proposed to solve the problem of over-squashing in message-passing graph neural networks, where node embeddings are recursively computed by an untrained message passing function.