Demo Data from EDBT 2026 / reviewers in the wild / expert
Riccardo Rende
dblp:344/7892
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 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 |
Learning theory · 61% Deep learning architectures and training · 30% Language models and text generation · 9% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory
learning dynamics |
0.8 | 1 | 2024 | A distributional simplicity bias in the learning dynamics of transformers · NeurIPS 2024 |
Machine learning › Learning theory › inductive bias
simplicity bias |
0.8 | 1 | 2024 | A distributional simplicity bias in the learning dynamics of transformers · NeurIPS 2024 |
Machine learning › Deep learning architectures and training
transformer |
0.8 | 1 | 2024 | A distributional simplicity bias in the learning dynamics of transformers · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
interaction order analysis · 0.8clone dataset generation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | A distributional simplicity bias in the learning dynamics of transformersabstractThe remarkable capability of over-parameterised neural networks to generalise effectively has been explained by invoking a ``simplicity bias'': neural networks prevent overfitting by initially learning simple classifiers before progressing to more complex, non-linear functions. While simplicity biases have been described theoretically and experimentally in feed-forward networks for supervised learning, the extent to which they also explain the remarkable success of transformers trained with self-supervised techniques remains unclear. In our study, we demonstrate that transformers, trained on natural language data, also display a simplicity bias. Specifically, they sequentially learn many-body interactions among input tokens, reaching a saturation point in the prediction error for low-degree interactions while continuing to learn high-degree interactions. To conduct this analysis, we develop a procedure to generate \textit{clones} of a given natural language data set, which rigorously capture the interactions between tokens up to a specified order. This approach opens up the possibilities of studying how interactions of different orders in the data affect learning, in natural language processing and beyond. Riccardo Rende, Federica Gerace, Alessandro Laio, Sebastian Goldt |
NeurIPS | 1 |