activity
20112021
most citedRandom-field p-spin glass model on regular random graphs

10 citations · 19 across the 2 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

cond-mat.dis-nn2019

Large deviations for the perceptron model and consequences for active learning

Hugo Cui, Luca Saglietti, Lenka Zdeborová

Active learning is a branch of machine learning that deals with problems where unlabeled data is abundant yet obtaining labels is expensive. The learning algorithm has the possibil…

cond-mat.dis-nn2019

Rademacher complexity and spin glasses: A link between the replica and statistical theories of learning

Alia Abbara, Benjamin Aubin, Florent Krzakala +1

Statistical learning theory provides bounds of the generalization gap, using in particular the Vapnik-Chervonenkis dimension and the Rademacher complexity. An alternative approach,…

math.ST2019

Exact asymptotics for phase retrieval and compressed sensing with random generative priors

Benjamin Aubin, Bruno Loureiro, Antoine Baker +2

We consider the problem of compressed sensing and of (real-valued) phase retrieval with random measurement matrix. We derive sharp asymptotics for the information-theoretically opt…

physics.comp-ph2019

Machine learning and the physical sciences

Giuseppe Carleo, Ignacio Cirac, Kyle Cranmer +5

Machine learning encompasses a broad range of algorithms and modeling tools used for a vast array of data processing tasks, which has entered most scientific disciplines in recent…

cond-mat.dis-nn2019

Storage capacity in symmetric binary perceptrons

Benjamin Aubin, Will Perkins, Lenka Zdeborová

We study the problem of determining the capacity of the binary perceptron for two variants of the problem where the corresponding constraint is symmetric. We call these variants th…