50 citations · 210 across the 29 of their papers we have counts for
4 papers · 1 filter
Testing thresholds for high-dimensional sparse random geometric graphs
Siqi Liu, Sidhanth Mohanty, Tselil Schramm +1
In the random geometric graph model , we identify each of our vertices with an independently and uniformly sampled vector from the -dimensional unit sph…
The SDP value of random 2CSPs
Amulya Musipatla, Ryan O'Donnell, Tselil Schramm +1
We consider a very wide class of models for sparse random Boolean 2CSPs; equivalently, degree-2 optimization problems over~. For each model , we identify…
Robust Regression Revisited: Acceleration and Improved Estimation Rates
Arun Jambulapati, Jerry Li, Tselil Schramm +1
We study fast algorithms for statistical regression problems under the strong contamination model, where the goal is to approximately optimize a generalized linear model (GLM) give…
Non-asymptotic approximations of neural networks by Gaussian processes
Ronen Eldan, Dan Mikulincer, Tselil Schramm
We study the extent to which wide neural networks may be approximated by Gaussian processes when initialized with random weights. It is a well-established fact that as the width of…