activity
20232026
most citedCould ChatGPT get an Engineering Degree? Evaluating Higher Education Vulnerability to AI Assistants

36 citations · 46 across the 24 of their papers we have counts for

collaborators

25 papers

cs.LG2026

In-context Learning of Single-index Targets: Comparing Kernel and Feature Learners

Haotian Gu, Yizhou Xu, Lenka Zdeborová

In-context learning (ICL) enables a pretrained model to infer a task from demonstrations without updating its parameters. While much of the existing theory focuses on linear target…

cs.LG2026

High-Dimensional Learning Dynamics of Attention-Indexed Models

Yizhou Xu, Margarita Sagitova, Lenka Zdeborová +1

Attention mechanisms are central to modern foundation models, yet their training dynamics remain poorly understood, especially when the attention matrices have extensive rank. In t…

cs.LG2026

How Width and Data Shape Generalization Scaling Laws in Quadratic Neural Networks

Julius Girardin, Emanuele Troiani, Yizhou Xu +3

Understanding how performance scales jointly with model size and data is a central problem in modern machine learning. Existing theoretical works on scaling laws typically describe…

cs.LG2026

High-Dimensional Theory of LoRA Fine-Tuning in a Solvable Attention Model

O. Duranthon, F. Boncoraglio, L. Zdeborová

We develop a high-dimensional statistical theory of low-rank adaptation (LoRA) in attention models, capturing the interplay between pre-training and fine-tuning. We introduce a sol…

cs.LG2026

Specialization of softmax attention heads: insights from the high-dimensional single-location model

M. Sagitova, O. Duranthon, L. Zdeborová

Multi-head attention enables transformer models to represent multiple attention patterns simultaneously. Empirically, head specialization emerges in distinct stages during training…

stat.ML2025

Inference in Spreading Processes with Neural-Network Priors

Davide Ghio, Fabrizio Boncoraglio, Lenka Zdeborová

Stochastic processes on graphs are a powerful tool for modelling complex dynamical systems such as epidemics. A recent line of work focused on the inference problem where one aims…

stat.ML2025

Single-Head Attention in High Dimensions: A Theory of Generalization, Weights Spectra, and Scaling Laws

Fabrizio Boncoraglio, Vittorio Erba, Emanuele Troiani +3

Trained attention layers exhibit striking and reproducible spectral structure of the weights, including low-rank collapse, bulk deformation, and isolated spectral outliers, yet the…

cs.LG2025

Scaling Laws and Spectra of Shallow Neural Networks in the Feature Learning Regime

Leonardo Defilippis, Yizhou Xu, Julius Girardin +5

Neural scaling laws underlie many of the recent advances in deep learning, yet their theoretical understanding remains largely confined to linear models. In this work, we present a…

cs.LG2025

Dataset distillation for memorized data: Soft labels can leak held-out teacher knowledge

Freya Behrens, Lenka Zdeborová

Dataset distillation aims to compress training data into fewer examples via a teacher, from which a student can learn effectively. While its success is often attributed to structur…

cond-mat.dis-nn2025

Sequential Dynamics in Ising Spin Glasses

Yatin Dandi, David Gamarnik, Francisco Pernice +1

We present the first exact asymptotic characterization of sequential dynamics for a broad class of local update algorithms on the Sherrington-Kirkpatrick (SK) model with Ising spin…

cond-mat.dis-nn2025

The maximum-average subtensor problem: equilibrium and out-of-equilibrium properties

Vittorio Erba, Nathan Malo Kupferschmid, Rodrigo Pérez Ortiz +1

In this paper we introduce and study the Maximum-Average Subtensor (-MAS) problem, in which one wants to find a subtensor of size of a given random tensor of size , both…

stat.ML2025

On the Existence of Consistent Adversarial Attacks in High-Dimensional Linear Classification

Matteo Vilucchio, Lenka Zdeborová, Bruno Loureiro

What fundamentally distinguishes an adversarial attack from a misclassification due to limited model expressivity or finite data? In this work, we investigate this question in the…

cs.LG2025

Bayes optimal learning of attention-indexed models

Fabrizio Boncoraglio, Emanuele Troiani, Vittorio Erba +1

We introduce the attention-indexed model (AIM), a theoretical framework for analyzing learning in deep attention layers. Inspired by multi-index models, AIM captures how token-leve…

cs.LG2025

Learning with Restricted Boltzmann Machines: Asymptotics of AMP and GD in High Dimensions

Yizhou Xu, Florent Krzakala, Lenka Zdeborová

The Restricted Boltzmann Machine (RBM) is one of the simplest generative neural networks capable of learning input distributions. Despite its simplicity, the analysis of its perfor…

stat.ML2025

The Nuclear Route: Sharp Asymptotics of ERM in Overparameterized Quadratic Networks

Vittorio Erba, Emanuele Troiani, Lenka Zdeborová +1

We study the high-dimensional asymptotics of empirical risk minimization (ERM) in over-parametrized two-layer neural networks with quadratic activations trained on synthetic data.…

stat.ML2025

Fundamental Limits of Matrix Sensing: Exact Asymptotics, Universality, and Applications

Yizhou Xu, Antoine Maillard, Lenka Zdeborová +1

In the matrix sensing problem, one wishes to reconstruct a matrix from (possibly noisy) observations of its linear projections along given directions. We consider this model in the…

cs.LG2025

Fundamental limits of learning in sequence multi-index models and deep attention networks: High-dimensional asymptotics and sharp thresholds

Emanuele Troiani, Hugo Cui, Yatin Dandi +2

In this manuscript, we study the learning of deep attention neural networks, defined as the composition of multiple self-attention layers, with tied and low-rank weights. We first…

cond-mat.dis-nn2024

Dynamical Cavity Method for Hypergraphs and its Application to Quenches in the k-XOR-SAT Problem

Aude Maier, Freya Behrens, Lenka Zdeborová

The dynamical cavity method and its backtracking version provide a powerful approach to studying the properties of dynamical processes on large random graphs. This paper extends th…

cs.CY2024★ 36 cited

Could ChatGPT get an Engineering Degree? Evaluating Higher Education Vulnerability to AI Assistants

Beatriz Borges, Negar Foroutan, Deniz Bayazit +87

AI assistants are being increasingly used by students enrolled in higher education institutions. While these tools provide opportunities for improved teaching and education, they a…

cs.LG2024

Counting in Small Transformers: The Delicate Interplay between Attention and Feed-Forward Layers

Freya Behrens, Luca Biggio, Lenka Zdeborová

Next to scaling considerations, architectural design choices profoundly shape the solution space of transformers. In this work, we analyze the solutions simple transformer blocks i…

stat.ML2024

Optimal thresholds and algorithms for a model of multi-modal learning in high dimensions

Christian Keup, Lenka Zdeborová

This work explores multi-modal inference in a high-dimensional simplified model, analytically quantifying the performance gain of multi-modal inference over that of analyzing modal…

cond-mat.dis-nn2024★ 5 cited

Counting and Hardness-of-Finding Fixed Points in Cellular Automata on Random Graphs

Cédric Koller, Freya Behrens, Lenka Zdeborová

We study the fixed points of outer-totalistic cellular automata on sparse random regular graphs. These can be seen as constraint satisfaction problems, where each variable must adh…

cs.LG2024

Asymptotic generalization error of a single-layer graph convolutional network

O. Duranthon, L. Zdeborová

While graph convolutional networks show great practical promises, the theoretical understanding of their generalization properties as a function of the number of samples is still i…

cs.SI2023★ 2 cited

Optimal Inference in Contextual Stochastic Block Models

O. Duranthon, L. Zdeborová

The contextual stochastic block model (cSBM) was proposed for unsupervised community detection on attributed graphs where both the graph and the high-dimensional node information c…