research
∙
04/06/2023
Classification of Superstatistical Features in High Dimensions
We characterise the learning of a mixture of two clouds of data points w...
share
research
∙
09/07/2022
Planted matching problems on random hypergraphs
We consider the problem of inferring a matching hidden in a weighted ran...
research
∙
01/31/2022
Fluctuations, Bias, Variance Ensemble of Learners: Exact Asymptotics for Convex Losses in High-Dimension
From the sampling of data to the initialisation of parameters, randomnes...
research
∙
12/24/2021
Aligning random graphs with a sub-tree similarity message-passing algorithm
The problem of aligning Erdös-Rényi random graphs is a noisy, average-ca...
research
∙
06/07/2021
Learning Gaussian Mixtures with Generalised Linear Models: Precise Asymptotics in High-dimensions
Generalised linear models for multi-class classification problems are on...
research
∙
10/26/2020
The planted k-factor problem
We consider the problem of recovering an unknown k-factor, hidden in a w...
research
∙
05/22/2020
Recovery thresholds in the sparse planted matching problem
We consider the statistical inference problem of recovering an unknown p...
research
∙
02/27/2014
