← Search

Stefano Sarao Mannelli

14 accepted papers

2026

Position: the Stochastic Parrot in the Coal Mine. Model Collapse is a Threat to Low-Resource Communities

ICML 2026spotlight

Model collapse, the degradation in performance that arises when generative models are trained on the outputs of prior models, is an increasing concern as artificially generated content proliferates. Related critiques of large language models have highlighted their tendency to reproduce frequent patt…

Cited by 0SourceScholar
2026

Sharp description of local minima in the loss landscape of high-dimensional two-layer ReLU neural networks

ICML 2026poster

We study the population loss landscape of two-layer ReLU networks of the form $\sum_{k=1}^K \mathrm{ReLU}(w_k^\top x)$ in a realisable teacher–student setting with Gaussian covariates. We show that local minima admit an exact low-dimensional representation in terms of \emph{summary statistics}, yiel…

Cited by 0SourceScholar
2025

A Theory of Initialisation's Impact on Specialisation

ICLR 2025poster

Prior work has demonstrated a consistent tendency in neural networks engaged in continual learning tasks, wherein intermediate task similarity results in the highest levels of catastrophic interference. This phenomenon is attributed to the network's tendency to reuse learned features across tasks. H…

Cited by 0SourcePDFScholar
2025

Optimal Protocols for Continual Learning via Statistical Physics and Control Theory

ICLR 2025poster

Artificial neural networks often struggle with _catastrophic forgetting_ when learning multiple tasks sequentially, as training on new tasks degrades the performance on previously learned tasks. Recent theoretical work has addressed this issue by analysing learning curves in synthetic frameworks und…

Cited by 3SourcePDFScholar
2024

Bias in Motion: Theoretical Insights into the Dynamics of Bias in SGD Training

NeurIPS 2024poster

Machine learning systems often acquire biases by leveraging undesired features in the data, impacting accuracy variably across different sub-populations of the data. However, our current understanding of bias formation mostly focuses on the initial and final stages of learning, leaving a gap in know…

Cited by 5SourcePDFScholar
2024

Tilting the Odds at the Lottery: the Interplay of Overparameterisation and Curricula in Neural Networks

ICML 2024poster

A wide range of empirical and theoretical works have shown that overparameterisation can amplify the performance of neural networks. According to the lottery ticket hypothesis, overparameterised networks have an increased chance of containing a sub-network that is well-initialised to solve the task…

Cited by 1SourcePDFScholar
2024

Why Do Animals Need Shaping? A Theory of Task Composition and Curriculum Learning

ICML 2024poster

Diverse studies in systems neuroscience begin with extended periods of curriculum training known as ‘shaping’ procedures. These involve progressively studying component parts of more complex tasks, and can make the difference between learning a task quickly, slowly or not at all. Despite the importa…

Cited by 8SourcePDFScholar
2022

An Analytical Theory of Curriculum Learning in Teacher-Student Networks

NeurIPS 2022accept

In animals and humans, curriculum learning---presenting data in a curated order---is critical to rapid learning and effective pedagogy. A long history of experiments has demonstrated the impact of curricula in a variety of animals but, despite its ubiquitous presence, a theoretical understandin…

Cited by 28SourcePDFScholar
2022

Maslow’s Hammer in Catastrophic Forgetting: Node Re-Use vs. Node Activation

ICML 2022spotlight

Continual learning—learning new tasks in sequence while maintaining performance on old tasks—remains particularly challenging for artificial neural networks. Surprisingly, the amount of forgetting does not increase with the dissimilarity between the learned tasks, but appears to be worst in an inter…

2021

Analytical Study of Momentum-Based Acceleration Methods in Paradigmatic High-Dimensional Non-Convex Problems

NeurIPS 2021poster

The optimization step in many machine learning problems rarely relies on vanilla gradient descent but it is common practice to use momentum-based accelerated methods. Despite these algorithms being widely applied to arbitrary loss functions, their behaviour in generically non-convex, high dimensiona…

Cited by 14SourcePDFScholar
2020

Complex Dynamics in Simple Neural Networks: Understanding Gradient Flow in Phase Retrieval

NeurIPS 2020poster

Despite the widespread use of gradient-based algorithms for optimising high-dimensional non-convex functions, understanding their ability of finding good minima instead of being trapped in spurious ones remains to a large extent an open problem. Here we focus on gradient flow dynamics for phase retr…

Cited by 36SourcePDFScholar
2019

Passed & Spurious: Descent Algorithms and Local Minima in Spiked Matrix-Tensor Models

ICML 2019oral

In this work we analyse quantitatively the interplay between the loss landscape and performance of descent algorithms in a prototypical inference problem, the spiked matrix-tensor model. We study a loss function that is the negative log-likelihood of the model. We analyse the number of local minima…

Cited by 67SourcePDFScholar
2019

Who is Afraid of Big Bad Minima? Analysis of gradient-flow in spiked matrix-tensor models

NeurIPS 2019spotlight

Gradient-based algorithms are effective for many machine learning tasks, but despite ample recent effort and some progress, it often remains unclear why they work in practice in optimising high-dimensional non-convex functions and why they find good minima instead of being trapped in spurious ones.H…