Luis Rademacher

发表

Query Complexity of Sampling and Small Geometric Partitions

Santosh S. Vempala, Navin Goyal, Luis Rademacher, 2014, Combinatorics, Probability and Computing.

Dispersion of Mass and the Complexity of Randomized Geometric Algorithms

Santosh S. Vempala, Luis Rademacher, S. Vempala, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

Matrix approximation and projective clustering via volume sampling

Santosh S. Vempala, Luis Rademacher, Grant Wang, 2006, SODA '06.

Optimal Recovery in Noisy ICA pdf

Mikhail Belkin, Luis Rademacher, James R. Voss, 2015, ArXiv.

Testing Geometric Convexity

Santosh S. Vempala, Luis Rademacher, 2004, FSTTCS.

Optimization of a convex program with a polynomial perturbation

Luis Rademacher, Ravi Kannan, R. Kannan, 2009, Operations Research Letters.

Computing Equilibrium Prices in Exchange Economies with Tax Distortions

Bruno Codenotti, Kasturi R. Varadarajan, Luis Rademacher, 2006, ICALP.

Basis Learning as an Algorithmic Primitive

Mikhail Belkin, Luis Rademacher, James R. Voss, 2014, COLT.

The Hidden Convexity of Spectral Clustering pdf

Mikhail Belkin, Luis Rademacher, James R. Voss, 2014, AAAI.

Lower Bounds for the Average and Smoothed Number of Pareto Optima

Navin Goyal, Luis Rademacher, 2012, FSTTCS.

Learning a Hidden Basis Through Imperfect Measurements: An Algorithmic Primitive pdf

Mikhail Belkin, Luis Rademacher, James R. Voss, 2014, ArXiv.

A Pseudo-Euclidean Iteration for Optimal Recovery in Noisy ICA

Mikhail Belkin, Luis Rademacher, James R. Voss, 2015, NIPS.

Algebraic k-sets and generally neighborly embeddings pdf

Luis Rademacher, Brett Leroux, 2019, ArXiv.

The More, the Merrier: the Blessing of Dimensionality for Learning Large Gaussian Mixtures pdf

Mikhail Belkin, Joseph Anderson, Navin Goyal, 2013, COLT.

Efficient Learning of Simplices pdf

Navin Goyal, Luis Rademacher, Joseph Anderson, 2012, COLT.

Eigenvectors of Orthogonally Decomposable Functions

Mikhail Belkin, Luis Rademacher, James R. Voss, 2014, SIAM J. Comput..

Matrix Approximation and Projective Clustering via Iterative Sampling

Luis Rademacher, Grant Wang, Santosh Vempala, 2005 .

Blind Signal Separation in the Presence of Gaussian Noise

Mikhail Belkin, Luis Rademacher, James R. Voss, 2012, COLT.

Efficient Volume Sampling for Row/Column Subset Selection

Luis Rademacher, Amit Deshpande, A. Deshpande, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

Approximating the centroid is hard

Luis Rademacher, Luis Rademacher, 2007, SCG '07.

Efficiency of the floating body as a robust measure of dispersion

Luis Rademacher, Joseph Anderson, Luis Rademacher, 2020, SODA.

The minimum Euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponential

Jesús A. De Loera, Jamie Haddock, Luis Rademacher, 2018, STOC.

Fast Algorithms for Gaussian Noise Invariant Independent Component Analysis

Mikhail Belkin, Luis Rademacher, James R. Voss, 2013, NIPS.

Lower Bounds for the Average and Smoothed Number of Pareto Optima pdf

Navin Goyal, Luis Rademacher, Heiko Röglin, 2011, FSTTCS.

Heavy-Tailed Independent Component Analysis

Joseph Anderson, Navin Goyal, Luis Rademacher, 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential

Jesús A. De Loera, Jamie Haddock, Luis Rademacher, 2020, SIAM J. Comput..

Expanders via random spanning trees

Navin Goyal, Luis Rademacher, Santosh Vempala, 2008, SODA.

The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes pdf

Luis Rademacher, Chang Shu, 2020, ArXiv.

Overcomplete order-3 tensor decomposition, blind deconvolution and Gaussian mixture models pdf

Luis Rademacher, Haolin Chen, Luis Rademacher, 2020, SIAM J. Math. Data Sci..

Learning Convex Bodies is Hard pdf

Navin Goyal, Luis Rademacher, 2009, COLT.

Heavy-Tailed Analogues of the Covariance Matrix for ICA pdf

Joseph Anderson, Navin Goyal, Luis Rademacher, 2017, AAAI.

On packing and covering polyhedra in infinite dimensions

Alejandro Toriello, Juan Pablo Vielma, Luis Rademacher, 2016, Oper. Res. Lett..

Improved bounds for the expected number of $k$-sets

Luis Rademacher, Brett Leroux, 2021 .

Algebraic k-Sets and Generally Neighborly Embeddings pdf

Luis Rademacher, Brett Leroux, Luis Rademacher, 2019, Discret. Comput. Geom..

Partitioning a Planar Graph of Girth 10 into a Forest and a Matching

Daniel J. Kleitman, Bridget Eileen Tenner, Luis Rademacher, 2010 .