Demo Data from VLDB 2026 / reviewers in the wild / expert
Giulia Lanzillotta
dblp:350/4552
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 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
2 papers |
Learning paradigms · 65% Representation and self-supervised learning · 25% Deep learning architectures and training · 10% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning paradigms › continual learning
catastrophic forgetting |
0.9 | 1 | 2025 | The Importance of Being Lazy: Scaling Limits of Continual Learning · ICML 2025 |
Machine learning › Learning paradigms
continual learning |
0.9 | 1 | 2025 | The Importance of Being Lazy: Scaling Limits of Continual Learning · ICML 2025 |
Machine learning › Representation and self-supervised learning › representation learning
structured representation learning |
0.7 | 1 | 2023 | Structure by Architecture: Structured Representations without Regularization · ICLR 2023 |
Machine learning › Deep learning architectures and training › training dynamics
lazy training regime |
0.3 | 1 | 2025 | The Importance of Being Lazy: Scaling Limits of Continual Learning · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
dynamical mean field theory · 0.9architectural inductive bias · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | The Importance of Being Lazy: Scaling Limits of Continual LearningabstractDespite recent efforts, neural networks still struggle to learn in non-stationary environments, and our understanding of catastrophic forgetting (CF) is far from complete.
In this work, we perform a systematic study on the impact of model scale and the degree of feature learning in continual learning. We reconcile existing contradictory observations on scale in the literature, by differentiating between *lazy* and *rich* training regimes through a variable parameterization of the architecture. We show that increasing model width is only beneficial when it reduces the amount of *feature learning*, yielding more laziness. Using the framework of dynamical mean field theory, we then study the infinite width dynamics of the model in the feature learning regime and characterize CF, extending prior theoretical results limited to the lazy regime. We study the intricate relationship between feature learning, task non-stationarity, and forgetting, finding that high feature learning is only beneficial with highly similar tasks. We identify a transition modulated by task similarity where the model exits an effectively lazy regime with low forgetting to enter a rich regime with significant forgetting. Finally, our findings reveal that neural networks achieve optimal performance at a critical level of feature learning, which depends on task non-stationarity and *transfers across model scales*. This work provides a unified perspective on the role of scale and feature learning in continual learning. Jacopo Graldi, Alessandro Breccia, Giulia Lanzillotta, Thomas Hofmann 0001, Lorenzo Noci |
ICML | 3 |
| 2023 | Structure by Architecture: Structured Representations without Regularization
Felix Leeb, Giulia Lanzillotta, Yashas Annadani, Michel Besserve, Stefan Bauer, Bernhard Schölkopf |
ICLR | 2 |