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

Matthew L. Leavitt

dblp:260/0952 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 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
4 papers
Deep learning architectures and training · 22% Trustworthy machine learning · 19% Efficient and distributed learning · 17%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
1.322024
Sudden Drops in the Loss: Syntax Acquisition, Phase Transitions, and Simplicity Bias in MLMs · ICLR 2024
Selectivity considered harmful: evaluating the causal impact of class selectivity in DNNs · ICLR 2021
Machine learning › Efficient and distributed learning › data selection
data pruning
0.912025
Perplexed by Perplexity: Perplexity-Based Data Pruning With Small Reference Models · ICLR 2025
Natural language and speech › Language models and text generation
masked language modeling
0.812024
Sudden Drops in the Loss: Syntax Acquisition, Phase Transitions, and Simplicity Bias in MLMs · ICLR 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning
syntax acquisition
0.812024
Sudden Drops in the Loss: Syntax Acquisition, Phase Transitions, and Simplicity Bias in MLMs · ICLR 2024
Machine learning › Deep learning architectures and training
training dynamics
0.812024
Sudden Drops in the Loss: Syntax Acquisition, Phase Transitions, and Simplicity Bias in MLMs · ICLR 2024
Computer vision › Image recognition and object detection
image classification
0.512021
ConViT: Improving Vision Transformers with Soft Convolutional Inductive Biases · ICML 2021
Machine learning › Learning theory › neural network theory
neural network analysis
0.512021
Selectivity considered harmful: evaluating the causal impact of class selectivity in DNNs · ICLR 2021
Machine learning › Deep learning architectures and training › transformer
vision transformer
0.512021
ConViT: Improving Vision Transformers with Soft Convolutional Inductive Biases · ICML 2021
Machine learning › Efficient and distributed learning › data-efficient learning
data-efficient pretraining
0.312025
Perplexed by Perplexity: Perplexity-Based Data Pruning With Small Reference Models · ICLR 2025
Machine learning › Learning theory
phase transition
0.212024
Sudden Drops in the Loss: Syntax Acquisition, Phase Transitions, and Simplicity Bias in MLMs · ICLR 2024
Machine learning › Deep learning architectures and training
convolutional neural network
0.112021
ConViT: Improving Vision Transformers with Soft Convolutional Inductive Biases · ICML 2021

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

small reference models · 0.9perplexity-based pruning · 0.9causal manipulation · 0.8attention analysis · 0.8self-attention · 0.5knowledge distillation · 0.5gated positional self-attention · 0.5causal analysis · 0.5
YearPublicationVenuePosition
2025 Perplexed by Perplexity: Perplexity-Based Data Pruning With Small Reference Models
abstract
In this work, we investigate whether small language models can determine high-quality subsets of large-scale text datasets that improve the performance of larger language models. While existing work has shown that pruning based on the perplexity of a larger model can yield high-quality data, we investigate whether smaller models can be used for perplexity-based pruning and how pruning is affected by the domain composition of the data being pruned. We demonstrate that for multiple dataset compositions, perplexity-based pruning of pretraining data can significantly improve downstream task performance: pruning based on perplexities computed with a 125 million parameter model improves the average performance on downstream tasks of a 3 billion parameter model by up to 2.04 and achieves up to a 1.45× reduction in pretraining steps to reach commensurate baseline performance. Furthermore, we demonstrate that such perplexity-based data pruning also yields downstream performance gains in the over-trained and data-constrained regimes.
Zachary Ankner, Cody Blakeney, Kartik Sreenivasan, Max Marion, Matthew L. Leavitt, Mansheej Paul
ICLR5
2024 Sudden Drops in the Loss: Syntax Acquisition, Phase Transitions, and Simplicity Bias in MLMs
abstract
Most interpretability research in NLP focuses on understanding the behavior and features of a fully trained model. However, certain insights into model behavior may only be accessible by observing the trajectory of the training process. We present a case study of syntax acquisition in masked language models (MLMs) that demonstrates how analyzing the evolution of interpretable artifacts throughout training deepens our understanding of emergent behavior. In particular, we study Syntactic Attention Structure (SAS), a naturally emerging property of MLMs wherein specific Transformer heads tend to focus on specific syntactic relations. We identify a brief window in pretraining when models abruptly acquire SAS, concurrent with a steep drop in loss. This breakthrough precipitates the subsequent acquisition of linguistic capabilities. We then examine the causal role of SAS by manipulating SAS during training, and demonstrate that SAS is necessary for the development of grammatical capabilities. We further find that SAS competes with other beneficial traits during training, and that briefly suppressing SAS improves model quality. These findings offer an interpretation of a real-world example of both simplicity bias and breakthrough training dynamics.
Angelica Chen, Ravid Shwartz-Ziv, Kyunghyun Cho, Matthew L. Leavitt, Naomi Saphra
ICLR4
2021 Selectivity considered harmful: evaluating the causal impact of class selectivity in DNNs
Matthew L. Leavitt, Ari S. Morcos
ICLR1
2021 ConViT: Improving Vision Transformers with Soft Convolutional Inductive Biases
abstract
Convolutional architectures have proven extremely successful for vision tasks. Their hard inductive biases enable sample-efficient learning, but come at the cost of a potentially lower performance ceiling. Vision Transformers (ViTs) rely on more flexible self-attention layers, and have recently outperformed CNNs for image classification. However, they require costly pre-training on large external datasets or distillation from pre-trained convolutional networks. In this paper, we ask the following question: is it possible to combine the strengths of these two architectures while avoiding their respective limitations? To this end, we introduce gated positional self-attention (GPSA), a form of positional self-attention which can be equipped with a “soft" convolutional inductive bias. We initialise the GPSA layers to mimic the locality of convolutional layers, then give each attention head the freedom to escape locality by adjusting a gating parameter regulating the attention paid to position versus content information. The resulting convolutional-like ViT architecture, ConViT, outperforms the DeiT on ImageNet, while offering a much improved sample efficiency. We further investigate the role of locality in learning by first quantifying how it is encouraged in vanilla self-attention layers, then analysing how it is escaped in GPSA layers. We conclude by presenting various ablations to better understand the success of the ConViT. Our code and models are released publicly at https://github.com/facebookresearch/convit.
Stéphane d'Ascoli, Hugo Touvron, Matthew L. Leavitt, Ari S. Morcos, Giulio Biroli, Levent Sagun
ICML3