14 citations · 38 across the 13 of their papers we have counts for
13 papers · 1 filter
Easy, robust approximate message passing for planted spike models
Misha Ivkov, Tselil Schramm
We present a simple and efficient algorithm for robust approximate message passing (AMP) in the spiked matrix setting. In particular, let be a sufficiently small cons…
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…
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…
Semidefinite programs simulate approximate message passing robustly
Misha Ivkov, Tselil Schramm
Approximate message passing (AMP) is a family of iterative algorithms that generalize matrix power iteration. AMP algorithms are known to optimally solve many average-case optimiza…
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…