1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CC2024
Some easy optimization problems have the overlap-gap property
Shuangping Li, Tselil Schramm
We show that the shortest - path problem has the overlap-gap property in (i) sparse graphs and (ii) complete graphs with i.i.d. Exponential edge weights. Fu…
cs.LG2024★ 1 cited
Synthetic continued pretraining
Zitong Yang, Neil Band, Shuangping Li +2
Pretraining on large-scale, unstructured internet text enables language models to acquire a significant amount of world knowledge. However, this knowledge acquisition is data-ineff…
cs.DS2024
Discrepancy Algorithms for the Binary Perceptron
Shuangping Li, Tselil Schramm, Kangjie Zhou
The binary perceptron problem asks us to find a sign vector in the intersection of independently chosen random halfspaces with intercept . We analyze the performance of the can…