166 citations · 655 across the 82 of their papers we have counts for
3 papers · 2 filters
Probably certifiably correct k-means clustering
Takayuki Iguchi, Dustin G. Mixon, Jesse Peterson +1
Recently, Bandeira [arXiv:1509.00824] introduced a new type of algorithm (the so-called probably certifiably correct algorithm) that combines fast solvers with the optimality certi…
On the tightness of an SDP relaxation of k-means
Takayuki Iguchi, Dustin G. Mixon, Jesse Peterson +1
Recently, Awasthi et al. introduced an SDP relaxation of the -means problem in . In this work, we consider a random model for the data points in which balls of…
Discrete uncertainty principles and sparse signal processing
Afonso S. Bandeira, Megan E. Lewis, Dustin G. Mixon
We develop new discrete uncertainty principles in terms of numerical sparsity, which is a continuous proxy for the 0-norm. Unlike traditional sparsity, the continuity of numerical…