Demo Data from VLDB 2026 / reviewers in the wild / expert
Pietro Lesci
dblp:348/6871
· DBLP profile ↗
4ranked-venue papers
3as 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 · 3 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
3 papers |
Language models and text generation · 85% Deep learning architectures and training · 15% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation › language modeling
scaling behavior |
0.9 | 1 | 2025 | PolyPythias: Stability and Outliers across Fifty Language Model Pre-Training Runs · ICLR 2025 |
Natural language and speech › Language models and text generation
tokenization |
0.9 | 1 | 2025 | Causal Estimation of Tokenisation Bias · ACL (1) 2025 |
Natural language and speech › Language models and text generation › large language model › knowledge in language models
memorization |
0.8 | 1 | 2024 | Causal Estimation of Memorisation Profiles · ACL (1) 2024 |
Machine learning › Deep learning architectures and training
training dynamics |
0.8 | 1 | 2024 | Causal Estimation of Memorisation Profiles · ACL (1) 2024 |
Methods — techniques the papers use, named apart from their topics
causal inference · 1.6seed variation analysis · 0.9regression discontinuity design · 0.9checkpoint analysis · 0.9difference-in-differences · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Causal Estimation of Tokenisation BiasabstractModern language models are typically trained over subword sequences, but ultimately define probabilities over character-strings.Ideally, the choice of the tokeniser-which maps characterstrings to subwords-should not affect the probability assigned to the underlying characterstring; in practice, it does.We define this mismatch as tokenisation bias.In this work, we quantify one particular type of tokenisation bias: the effect of including or not a subword (e.g., ⟨hello⟩) in a tokeniser's vocabulary on the probability a trained model assigns to the corresponding characters (i.e., "hello").Estimating this effect is challenging because each model is trained with only one tokeniser.We address this by framing tokenisation bias as a causal effect and estimating it using the regression discontinuity design.Specifically, we exploit the fact that tokenisation algorithms rank subwords and add the first K to a tokeniser's vocabulary, where K is an arbitrary cutoff point.As such, we can estimate a causal effect by comparing similar subwords around this cutoff.Experimentally, we find that tokenisation consistently affects models' outputs across scales, vocabularies, and tokenisers.Notably, a subword's presence in a small model's vocabulary may increase its characters' probability by up to 17 times, highlighting tokenisation as a key design choice in language modelling. Pietro Lesci, Clara Meister, Thomas Hofmann 0001, Andreas Vlachos 0001, Tiago Pimentel |
ACL (1) | 1 |
| 2025 | PolyPythias: Stability and Outliers across Fifty Language Model Pre-Training RunsabstractThe stability of language model pre-training and its effects on downstream performance are still understudied. Prior work shows that the training process can yield significantly different results in response to slight variations in initial conditions, e.g., the random seed.
Crucially, the research community still lacks sufficient resources and tools to systematically investigate pre-training stability, particularly for decoder-only language models. We introduce the PolyPythias, a set of 45 new training runs for the Pythia model suite: 9 new seeds across 5 model sizes, from 14M to 410M parameters, resulting in about 7k new checkpoints that we release. Using these new 45 training runs, in addition to the 5 already available, we study the effects of different initial conditions determined by the seed---i.e., parameters' initialisation and data order---on (i) downstream performance, (ii) learned linguistic representations, and (iii) emergence of training phases. In addition to common scaling behaviours, our analyses generally reveal highly consistent training dynamics across both model sizes and initial conditions. Further, the new seeds for each model allow us to identify outlier training runs and delineate their characteristics.
Our findings show the potential of using these methods to predict training stability. Oskar van der Wal, Pietro Lesci, Max Müller-Eberstein, Naomi Saphra, Hailey Schoelkopf, Willem H. Zuidema, Stella Biderman |
ICLR | 2 |
| 2024 | Causal Estimation of Memorisation ProfilesabstractUnderstanding memorisation in language models has practical and societal implications, e.g., studying models' training dynamics or preventing copyright infringements.Prior work defines memorisation as the causal effect of training with an instance on the model's ability to predict that instance.This definition relies on a counterfactual: the ability to observe what would have happened had the model not seen that instance.Existing methods struggle to provide computationally efficient and accurate estimates of this counterfactual.Further, they often estimate memorisation for a model architecture rather than for a specific model instance.This paper fills an important gap in the literature, proposing a new, principled, and efficient method to estimate memorisation based on the difference-in-differences design from econometrics.Using this method, we characterise a model's memorisation profile-its memorisation trends across training-by only observing its behaviour on a small set of instances throughout training.In experiments with the Pythia model suite, we find that memorisation (i) is stronger and more persistent in larger models, (ii) is determined by data order and learning rate, and (iii) has stable trends across model sizes, thus making memorisation in larger models predictable from smaller ones. pietrolesci/memorisation-profiles Pietro Lesci, Clara Meister, Thomas Hofmann 0001, Andreas Vlachos 0001, Tiago Pimentel |
ACL (1) | 1 |
| 2024 | AnchorAL: Computationally Efficient Active Learning for Large and Imbalanced DatasetsabstractPietro Lesci, Andreas Vlachos. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024. Pietro Lesci, Andreas Vlachos 0001 |
NAACL-HLT | 1 |