29 citations · 106 across the 19 of their papers we have counts for
22 papers
Estranged facets and -facets of Gaussian random point sets
Brett Leroux, Luis Rademacher
Gaussian random polytopes have received a lot of attention especially in the case where the dimension is fixed and the number of points goes to infinity. Our focus is on the less s…
Expansion of random polytopes
Brett Leroux, Luis Rademacher
A conjecture of Mihail and Vazirani states that the edge expansion of the graph of every polytope is at least one. Any lower bound on the edge expansion gives an upper bound…
Improved bounds for the expected number of -sets
Brett Leroux, Luis Rademacher
Given a finite set of points , a -set of is a subset of size which can be strictly separated from by a hyperplane. S…
The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes
Luis Rademacher, Chang Shu
Frank-Wolfe methods are popular for optimization over a polytope. One of the reasons is because they do not need projection onto the polytope but only linear optimization over it.…
Overcomplete order-3 tensor decomposition, blind deconvolution and Gaussian mixture models
Haolin Chen, Luis Rademacher
We propose a new algorithm for tensor decomposition, based on Jennrich's algorithm, and apply our new algorithmic ideas to blind deconvolution and Gaussian mixture models. Our firs…
Algebraic -sets and generally neighborly embeddings
Brett Leroux, Luis Rademacher
Given a set of points in , a -set is a subset of points of that can be strictly separated by a hyperplane from the remaining points. Similarl…