
Passed & Spurious: analysing descent algorithms and local minima in spiked matrixtensor model
In this work we analyse quantitatively the interplay between the loss la...
read it

Thresholds of descending algorithms in inference problems
We review recent works on analyzing the dynamics of gradientbased algor...
read it

Marvels and Pitfalls of the Langevin Algorithm in Noisy Highdimensional Inference
Gradientdescentbased algorithms and their stochastic versions have wid...
read it

Approximate Survey Propagation for Statistical Inference
Approximate message passing algorithm enjoyed considerable attention in ...
read it

Generalisation dynamics of online learning in overparameterised neural networks
Deep neural networks achieve stellar generalisation on a variety of prob...
read it

Rademacher complexity and spin glasses: A link between the replica and statistical theories of learning
Statistical learning theory provides bounds of the generalization gap, u...
read it

Dynamics of stochastic gradient descent for twolayer neural networks in the teacherstudent setup
Deep neural networks achieve stellar generalisation even when they have ...
read it

Approximate messagepassing for convex optimization with nonseparable penalties
We introduce an iterative optimization scheme for convex objectives cons...
read it

Modelling the influence of data structure on learning in neural networks
The lack of crisp mathematical models that capture the structure of real...
read it

The committee machine: Computational to statistical gaps in learning a twolayers neural network
Heuristic tools from statistical physics have been used in the past to l...
read it

Exact asymptotics for phase retrieval and compressed sensing with random generative priors
We consider the problem of compressed sensing and of (realvalued) phase...
read it

Entropy and mutual information in models of deep neural networks
We examine a class of deep learning models with a tractable method to co...
read it

Who is Afraid of Big Bad Minima? Analysis of GradientFlow in a Spiked MatrixTensor Model
Gradientbased algorithms are effective for many machine learning tasks,...
read it

On the Universality of Noiseless Linear Estimation with Respect to the Measurement Matrix
In a noiseless linear estimation problem, one aims to reconstruct a vect...
read it

Phase Transitions, Optimal Errors and Optimality of MessagePassing in Generalized Linear Models
We consider generalized linear models (GLMs) where an unknown ndimensio...
read it

Streaming Bayesian inference: theoretical limits and minibatch approximate messagepassing
In statistical learning for realworld largescale data problems, one mu...
read it

MultiLayer Generalized Linear Estimation
We consider the problem of reconstructing a signal from multilayered (p...
read it

Phase transitions and optimal algorithms in highdimensional Gaussian mixture clustering
We consider the problem of Gaussian mixture clustering in the highdimen...
read it

Fast Randomized SemiSupervised Clustering
We consider the problem of clustering partially labeled data from a mini...
read it

Statistical physics of inference: Thresholds and algorithms
Many questions of fundamental interest in todays science can be formulat...
read it

Matrix Completion from Fewer Entries: Spectral Detectability and Rank Estimation
The completion of low rank matrices from few entries is a task with many...
read it

Phase Transitions in Sparse PCA
We study optimal estimation for sparse principal component analysis when...
read it

Phase transitions in semisupervised clustering of sparse networks
Predicting labels of nodes in a network, such as community memberships o...
read it

Message passing for quantified Boolean formulas
We introduce two types of message passing algorithms for quantified Bool...
read it

Phase transitions and sample complexity in Bayesoptimal matrix factorization
We analyse the matrix factorization problem. Given a noisy measurement o...
read it

Spectral redemption: clustering sparse networks
Spectral algorithms are classic approaches to clustering and community d...
read it

Model Selection for Degreecorrected Block Models
The proliferation of models for networks raises challenging problems of ...
read it

Comparative Study for Inference of Hidden Classes in Stochastic Block Models
Inference of hidden classes in stochastic block model is a classical pro...
read it

Dense Limit of the DawidSkene Model for Crowdsourcing and Regions of Suboptimality of Message Passing Algorithms
Crowdsourcing is a strategy to categorize data through the contribution ...
read it

On the glassy nature of the hard phase in inference problems
An algorithmically hard phase was described in a range of inference prob...
read it

Typology of phase transitions in Bayesian inference problems
Many inference problems, notably the stochastic block model (SBM) that g...
read it

Rankone matrix estimation: analysis of algorithmic and information theoretic limits by the spatial coupling method
Factorizing lowrank matrices is a problem with many applications in mac...
read it

The spiked matrix model with generative priors
Using a lowdimensional parametrization of signals is a generic and powe...
read it

Hightemperature Expansions and Message Passing Algorithms
Improved meanfield technics are a central theme of statistical physics ...
read it

Large deviations for the perceptron model and consequences for active learning
Active learning is a branch of machine learning that deals with problems...
read it
Lenka Zdeborová
is this you? claim profile
Researcher at CNRS (Centre national de la recherche scientifique)