Luis Rademacher
Luis Rademacher
Department of Mathematics, UC Davis
Verified email at math.ucdavis.edu - Homepage
TitleCited byYear
Matrix approximation and projective clustering via volume sampling
A Deshpande, L Rademacher, S Vempala, G Wang
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
2892006
Efficient volume sampling for row/column subset selection
A Deshpande, L Rademacher
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 329-338, 2010
1322010
Expanders via random spanning trees
A Frieze, N Goyal, L Rademacher, S Vempala
SIAM Journal on Computing 43 (2), 497-513, 2014
68*2014
The more, the merrier: the blessing of dimensionality for learning large gaussian mixtures
J Anderson, M Belkin, N Goyal, L Rademacher, J Voss
Conference on Learning Theory, 1135-1164, 2014
592014
Approximating the centroid is hard
LA Rademacher
Proceedings of the twenty-third annual symposium on Computational geometry …, 2007
452007
Learning convex bodies is hard
L Rademacher, N Goyal
Proceedings of the 22nd Annual Conference on Learning Theory (COLT 2009 …, 2009
24*2009
Testing geometric convexity
L Rademacher, S Vempala
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer …, 2005
232005
Blind signal separation in the presence of Gaussian noise
M Belkin, L Rademacher, J Voss
Conference on Learning Theory, 270-287, 2013
212013
Partitioning a Planar Graph of Girth 10 into a Forest and a Matching
A Bassa, J Burns, J Campbell, A Deshpande, J Farley, M Halsey, SY Ho, ...
Studies in Applied Mathematics 124 (3), 213-228, 2010
20*2010
Efficient learning of simplices
J Anderson, N Goyal, L Rademacher
Conference on Learning Theory, 1020-1045, 2013
182013
Fast algorithms for Gaussian noise invariant independent component analysis
JR Voss, L Rademacher, M Belkin
Advances in neural information processing systems, 2544-2552, 2013
172013
On the monotonicity of the expected volume of a random simplex
L Rademacher
Mathematika 58 (1), 77-91, 2012
142012
Dispersion of mass and the complexity of randomized geometric algorithms
L Rademacher, S Vempala
Advances in Mathematics 219 (3), 1037-1069, 2008
132008
Lower bounds for the average and smoothed number of pareto-optima
T Brunsch, N Goyal, L Rademacher, H Röglin
Theory of Computing 10 (1), 237-256, 2014
9*2014
The hidden convexity of spectral clustering
M Belkin, L Rademacher, JR Voss
CoRR, abs/1403.0667, 2014
9*2014
Basis learning as an algorithmic primitive
M Belkin, L Rademacher, J Voss
Conference on Learning Theory, 446-487, 2016
5*2016
A pseudo-euclidean iteration for optimal recovery in noisy ICA
JR Voss, M Belkin, L Rademacher
Advances in Neural Information Processing Systems, 2872-2880, 2015
52015
Heavy-tailed independent component analysis
J Anderson, N Goyal, A Nandi, L Rademacher
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 290-309, 2015
42015
On packing and covering polyhedra in infinite dimensions
L Rademacher, A Toriello, JP Vielma
Operations Research Letters 44 (2), 225-230, 2016
32016
A simplicial polytope that maximizes the isotropic constant must be a simplex
L Rademacher
Mathematika 62 (1), 307-320, 2016
32016
The system can't perform the operation now. Try again later.
Articles 1–20