2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.PR2021★ 1 cited
Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster
Emmanuel Abbe, Shuangping Li, Allan Sly
It was recently shown that almost all solutions in the symmetric binary perceptron are isolated, even at low constraint densities, suggesting that finding typical solutions is hard…
math.ST2020★ 2 cited
Learning Sparse Graphons and the Generalized Kesten-Stigum Threshold
Emmanuel Abbe, Shuangping Li, Allan Sly
The problem of learning graphons has attracted considerable attention across several scientific communities, with significant progress over the recent years in sparser regimes. Yet…
math.CA2019
A Trace Theorem For Sobolev Spaces On The Sierpinski Gasket
Shiping Cao, Shuangping Li, Robert S. Strichartz +1
We give a discrete characterization of the trace of a class of Sobolev spaces on the Sierpinski gasket to the bottom line. This includes the L2 domain of the Laplacian as a special…