59 citations · 216 across the 22 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016★ 7 cited
Spectral algorithms for tensor completion
Andrea Montanari, Nike Sun
In the tensor completion problem, one seeks to estimate a low-rank tensor based on a random sample of revealed entries. In terms of the required sample size, earlier work revealed…
math.PR2016★ 3 cited
The number of solutions for random regular NAE-SAT
Allan Sly, Nike Sun, Yumeng Zhang
Recent work has made substantial progress in understanding the transitions of random constraint satisfaction problems. In particular, for several of these models, the exact satisfi…