Demo Data from EDBT 2026 / reviewers in the wild / expert
Max Marion
dblp:356/7158
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—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 |
Efficient and distributed learning · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › data selection
data pruning |
0.9 | 1 | 2025 | Perplexed by Perplexity: Perplexity-Based Data Pruning With Small Reference Models · ICLR 2025 |
Machine learning › Efficient and distributed learning › data-efficient learning
data-efficient pretraining |
0.3 | 1 | 2025 | Perplexed by Perplexity: Perplexity-Based Data Pruning With Small Reference Models · ICLR 2025 |
Methods — techniques the papers use, named apart from their topics
small reference models · 0.9perplexity-based pruning · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Perplexed by Perplexity: Perplexity-Based Data Pruning With Small Reference ModelsabstractIn 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 |
ICLR | 4 |