1 citations · 1 across the 3 of their papers we have counts for
4 papers
Sketch-and-solve approaches to k-means clustering by semidefinite programming
Charles Clum, Dustin G. Mixon, Soledad Villar +1
We introduce a sketch-and-solve approach to speed up the Peng-Wei semidefinite relaxation of k-means clustering. When the data is appropriately separated we identify the k-means op…
Parameter estimation in the SIR model from early infections
Charles Clum, Dustin G. Mixon
A standard model for epidemics is the SIR model on a graph. We introduce a simple algorithm that uses the early infection times from a sample path of the SIR model to estimate the…
Derandomized compressed sensing with nonuniform guarantees for recovery
Charles Clum, Dustin G. Mixon
We extend the techniques of Hügel, Rauhut and Strohmer (Found. Comput. Math., 2014) to show that for every , there exists an explicit random partial Fourier…
Matching Component Analysis for Transfer Learning
Charles Clum, Dustin G. Mixon, Theresa Scarnati
We introduce a new Procrustes-type method called matching component analysis to isolate components in data for transfer learning. Our theoretical results describe the sample comple…