26 citations · 48 across the 5 of their papers we have counts for
4 papers · 1 filter
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…
Equiangular tight frames with centroidal symmetry
Matthew Fickus, John Jasper, Dustin G. Mixon +2
An equiangular tight frame (ETF) is a set of unit vectors whose coherence achieves the Welch bound, and so is as incoherent as possible. Though they arise in many applications, onl…
Learning Boolean functions with concentrated spectra
Dustin G. Mixon, Jesse Peterson
This paper discusses the theory and application of learning Boolean functions that are concentrated in the Fourier domain. We first estimate the VC dimension of this function class…
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…