6 citations · 6 across the 5 of their papers we have counts for
5 papers
Maximum-Cost Strategic Facility Location: The Limits of Randomization
Jabari Hastings, Misha Ivkov
We consider strategic facility location in Euclidean space , where a mechanism selects a single facility based on the reported locations of agents and seeks to min…
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…
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…
List-Decodable Covariance Estimation
Misha Ivkov, Pravesh K. Kothari
We give the first polynomial time algorithm for \emph{list-decodable covariance estimation}. For any , our algorithm takes input a sample of size $…