Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andrea Agazzi

dblp:241/9320 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 3 first-author · 5 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
5 papers
Deep learning architectures and training · 36% Learning theory · 32% Optimization for machine learning · 17%
Theoretical computer science
2 papers
Mathematical optimization · 77% Computational complexity · 23%

Topics — the 12 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › transformer
transformer theory
1.722025
A multiscale analysis of mean-field transformers in the moderate interaction regime · NeurIPS 2025
Emergence of meta-stable clustering in mean-field transformer models · ICLR 2025
Machine learning › Learning theory › statistical learning theory › statistical physics of learning
mean-field analysis
1.222023
Global optimality of Elman-type RNNs in the mean-field regime · ICML 2023
Global optimality of softmax policy gradient with single hidden layer neural networks in the mean-field regime · ICLR 2021
Machine learning › Optimization for machine learning
convergence analysis
0.912025
Quantitative convergence of trained neural networks to Gaussian processes · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
gaussian process approximation
0.912025
Quantitative convergence of trained neural networks to Gaussian processes · NeurIPS 2025
Machine learning › Learning theory › neural network theory
infinite-width limit
0.912025
Quantitative convergence of trained neural networks to Gaussian processes · NeurIPS 2025
Machine learning › Learning theory
neural network theory
0.912025
Quantitative convergence of trained neural networks to Gaussian processes · NeurIPS 2025
Machine learning › Deep learning architectures and training
training dynamics
0.912025
Quantitative convergence of trained neural networks to Gaussian processes · NeurIPS 2025
Mathematical optimization › optimal transport
wasserstein gradient flow
0.912025
Emergence of meta-stable clustering in mean-field transformer models · ICLR 2025
Machine learning › Optimization for machine learning › convergence analysis
global optimality of gradient descent
0.712023
Global optimality of Elman-type RNNs in the mean-field regime · ICML 2023
Machine learning › Deep learning architectures and training
recurrent neural network
0.712023
Global optimality of Elman-type RNNs in the mean-field regime · ICML 2023
Machine learning › Reinforcement learning › policy optimization
policy gradient
0.512021
Global optimality of softmax policy gradient with single hidden layer neural networks in the mean-field regime · ICLR 2021
Computational complexity › proof complexity › algebraic proof systems
ideal proof system
0.312025
A multiscale analysis of mean-field transformers in the moderate interaction regime · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

mean-field analysis · 4.0multiscale analysis · 1.7PDE analysis · 1.7wasserstein distance bound · 0.9interacting particle systems · 0.9interacting particle system · 0.9gradient descent · 0.9mean-field theory · 0.7gradient descent analysis · 0.7neural network analysis · 0.5
YearPublicationVenuePosition
2025 Emergence of meta-stable clustering in mean-field transformer models
abstract
We model the evolution of tokens within a deep stack of Transformer layers as a continuous-time flow on the unit sphere, governed by a mean-field interacting particle system, building on the framework introduced in Geshkovski et al. (2023). Studying the corresponding mean-field Partial Differential Equation (PDE), which can be interpreted as a Wasserstein gradient flow, in this paper we provide a mathematical investigation of the long-term behavior of this system, with a particular focus on the emergence and persistence of meta-stable phases and clustering phenomena, key elements in applications like next-token prediction. More specifically, we perform a perturbative analysis of the mean-field PDE around the iid uniform initialization and prove that, in the limit of large number of tokens, the model remains close to a meta-stable manifold of solutions with a given structure (e.g., periodicity). Further, the structure characterizing the meta-stable manifold is explicitly identified, as a function of the inverse temperature parameter of the model, by the index maximizing a certain rescaling of Gegenbauer polynomials.
Giuseppe Bruno, Federico Pasqualotto, Andrea Agazzi
ICLR3
2025 Quantitative convergence of trained neural networks to Gaussian processes
abstract
In this paper, we study the quantitative convergence of shallow neural networks trained via gradient descent to their associated Gaussian processes in the infinite-width limit. While previous work has established qualitative convergence under broad settings, precise, finite-width estimates remain limited, particularly during training. We provide explicit upper bounds on the quadratic Wasserstein distance between the network output and its Gaussian approximation at any training time $t \ge 0$, demonstrating polynomial decay with network width. Our results quantify how architectural parameters, such as width and input dimension, influence convergence, and how training dynamics affect the approximation error
Andrea Agazzi, Eloy Mósig García, Dario Trevisan
NeurIPS1
2025 A multiscale analysis of mean-field transformers in the moderate interaction regime
abstract
In this paper, we study the evolution of tokens through the depth of encoder-only transformer models at inference time by modeling them as a system of particles interacting in a mean-field way and studying the corresponding dynamics. More specifically, we consider this problem in the moderate interaction regime, where the number $N$ of tokens is large and the inverse temperature parameter $\beta$ of the model scales together with $N$. In this regime, the dynamics of the system displays a multiscale behavior: a fast phase, where the token empirical measure collapses on a low-dimensional space, an intermediate phase, where the measure further collapses into clusters, and a slow one, where such clusters sequentially merge into a single one. We provide a rigorous characterization of the limiting dynamics in each of these phases and prove convergence in the above mentioned limit, exemplifying our results with some simulations.
Giuseppe Bruno, Federico Pasqualotto, Andrea Agazzi
NeurIPS3
2023 Global optimality of Elman-type RNNs in the mean-field regime
abstract
We analyze Elman-type recurrent neural networks (RNNs) and their training in the mean-field regime. Specifically, we show convergence of gradient descent training dynamics of the RNN to the corresponding mean-field formulation in the large width limit. We also show that the fixed points of the limiting infinite-width dynamics are globally optimal, under some assumptions on the initialization of the weights. Our results establish optimality for feature-learning with wide RNNs in the mean-field regime.
Andrea Agazzi, Sayan Mukherjee 0001
ICML1
2021 Global optimality of softmax policy gradient with single hidden layer neural networks in the mean-field regime
Andrea Agazzi
ICLR1