50 citations · 210 across the 29 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DS2024
Fast, robust approximate message passing
Misha Ivkov, Tselil Schramm
We give a fast, spectral procedure for implementing approximate-message passing (AMP) algorithms robustly. For any quadratic optimization problem over symmetric matrices with i…
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.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…