papers
Publications (17)
cs.CC2014
Query complexity of sampling and small geometric partitions
Navin Goyal, Luis Rademacher, Santosh Vempala
cs.CC2008
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
Luis Rademacher, Santosh Vempala
cs.DS2011
Lower Bounds for the Average and Smoothed Number of Pareto Optima
Navin Goyal, Luis Rademacher
cs.LG2015
A Pseudo-Euclidean Iteration for Optimal Recovery in Noisy ICA
James Voss, Mikhail Belkin, Luis Rademacher
math.OC2017
The Minimum Euclidean-Norm Point on a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
Jesus De Loera, Jamie Haddock, Luis Rademacher
cs.LG2014
The More, the Merrier: the Blessing of Dimensionality for Learning Large Gaussian Mixtures
Joseph Anderson, Mikhail Belkin, Navin Goyal +2
cs.LG2013
Blind Signal Separation in the Presence of Gaussian Noise
Mikhail Belkin, Luis Rademacher, James Voss
cs.DS2010
Efficient volume sampling for row/column subset selection
Amit Deshpande, Luis Rademacher
cs.DM2008
Expanders via Random Spanning Trees
Navin Goyal, Luis Rademacher, Santosh Vempala
cs.LG2016
The Hidden Convexity of Spectral Clustering
James Voss, Mikhail Belkin, Luis Rademacher
cs.LG2015
Heavy-tailed Independent Component Analysis
Joseph Anderson, Navin Goyal, Anupama Nandi +1
math.FA2014
A simplicial polytope that maximizes the isotropic constant must be a simplex
Luis Rademacher
cs.LG2013
Efficient learning of simplices
Joseph Anderson, Navin Goyal, Luis Rademacher
cs.LG2017
Heavy-Tailed Analogues of the Covariance Matrix for ICA
Joseph Anderson, Navin Goyal, Anupama Nandi +1
cs.LG2009
Learning convex bodies is hard
Navin Goyal, Luis Rademacher
cs.LG2018
Eigenvectors of Orthogonally Decomposable Functions
Mikhail Belkin, Luis Rademacher, James Voss
math.PR2010
On the monotonicity of the expected volume of a random simplex
Luis Rademacher