## Luis Rademacher Office: Phone: (614) 292-3083 E-mail : lrademac [at] cse [dot] ohio-state [dot] edu |

I am an Assistant Professor at the School of Computer Science and Engineering, Ohio State University. I am a member of the Theory and Algorithms group. I am a member of the core committee of The STEAM Factory.

I received the NSF Early CAREER award in March 2014 for the proposal "CAREER: Transforming data analysis via new algorithms for feature extraction".

March 2014: I received the NSF Early CAREER award in March 2014 for the proposal "CAREER: Transforming data analysis via new algorithms for feature extraction".

February-March 2012: Visiting Microsoft Research India in Bangalore.

March-May 2011: Visiting the Isaac Newton Institute for Mathematical Sciences, Cambridge, UK.

January 2011: Teaching "Randomized algorithms and matrix decompositions" for the VI Summer School in Discrete Mathematics at the Institute of Complex Systems, Valparaíso, Chile.

- The more the merrier: the blessing of dimensionality for learning
large Gaussian mixtures

Banff International Research Station. Banff, Canada, 2014. PDF - Sections of convex bodies, statistical estimation and (in)stability.

American Institute of Mathematics, Palo Alto CA, 2013: PDF - Simplicial polytopes that maximize the isotropic constant are highly
symmetric.

AMS Sectional Meeting, Akron OH, 2012: PDF - Randomized algorithms for the approximation of matrices

FoCM 2011, Learning theory workshop: PDF

IMA, High dimensional phenomena: PDF

- Anupama Nandi (PhD)
- James Voss (PhD,
jointly advised with Mikhail Belkin)

- Joseph Anderson
(PhD)

- Abhisek Kundu (MS, now a PhD student at RPI)
- Jie Cui (MS)

- A simplicial polytope that maximizes the
isotropic constant must be a simplex.

In preparation, 2014. - Gaussian noise invariant blind signal separation. (Mikhail Belkin,
James Voss)

Submitted, 2014. - Efficient volume sampling for row/column subset selection. (Amit
Deshpande, Abhisek Kundu)

In preparation, 2014. - Expanders via random spanning trees.
(Alan Frieze, Navin Goyal, Santosh Vempala)

SIAM Journal on Computing, 2014. - Lower bounds for the average and smoothed number of Pareto-optima.
(Tobias Brunsch, Navin Goyal, Heiko Röglin)

To appear in Theory of Computing, 2014. - The hidden convexity of
spectral clustering. (Mikhail Belkin, James Voss)

Submitted, 2014. - On
blocking and anti-blocking polyhedra in infinite dimensions.
(Alejandro Toriello, Juan Pablo Vielma)

Submitted, 2014. - The more, the merrier: the
blessing of dimensionality for learning large Gaussian mixtures.
(Joseph Anderson, Mikhail Belkin, Navin Goyal, James Voss)

COLT 2014.

- Fast
algorithms for Gaussian noise invariant Independent Component Analysis.
(Mikhail Belkin, James Voss)

NIPS 2013. MATLAB implementation of GI-ICA. - Efficient learning of
simplices. (Joseph Anderson, Navin Goyal)

COLT 2013. Video and slides of talk. - Blind signal separation in the presence of Gaussian noise. (Mikhail
Belkin, James Voss)

COLT 2013. Arxiv. Video and slides of talk (by J. Voss). - Lower bounds for the smoothed number of Pareto optima. (Navin Goyal)

FSTTCS 2012. Arxiv. - On the Monotonicity of the Expected Volume of a Random Simplex.

Mathematika, 2012. Arxiv. Presentation at Oberwolfach: PPTX, PDF.

Computational experiments for the 3-dimensional case. - Lower bounds on partitions and applications to query complexity.
(Navin Goyal, Santosh Vempala)

To appear in Combinatorics, Probability and Computing. - Efficient volume sampling for
row/column subset selection. (Amit Deshpande)

FOCS 2010. Video of talk. - 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, S.-Y.
Ho, D. Kleitman, S. Michalakis, P.-O. Persson, P. Pylyavskyy, A. Riehl,
M. Rios, J. Samuel, B. E. Tenner, A. Vijayasarathy, L. Zhao)

Studies in Applied Mathematics, 2010. - Optimization of a convex program with a
polynomial perturbation. (Ravi Kannan)

OR Letters, 2009. - Learning convex bodies is hard. (Navin
Goyal)

COLT 2009. Video of workshop talk (by N. Goyal). - Expanders via Random Spanning Trees. (Navin
Goyal, Santosh Vempala)

SODA 2009. Video of workshop talk. - Minimal Partitioning into Product Sets. (Xuancheng Shao) In preparation.
- Approximating the Centroid is Hard. PDF
presentation.

SOCG 2007. - Dispersion of Mass and the Complexity of
Geometric Problems.

PhD thesis, Department of Mathematics, MIT, 2007. - Dispersion of Mass and the Complexity of
Randomized Geometric Algorithms. (Santosh Vempala)

Advances in Mathematics and FOCS 2006.

PDF presentation of the volume lower bound. - Computing Equilibrium Prices in Exchange
Economies with Tax Distortions. (Bruno Codenotti, Kasturi
Varadarajan)

ICALP 2006. - Matrix
Approximation
and Projective Clustering via Volume Sampling. (Amit Deshpande,
Santosh Vempala, Grant Wang)

Theory of Computing and SODA 2006. Short PDF presentation. - Testing geometric convexity. (Santosh
Vempala)

FSTTCS 2004. Short PDF presentation.

The Cross-Polytope with Peaks (java applet). - Computation and Stability of Nash Equilibria and
Applications to the Modeling of the Electrical Energy Generation
Market (in Spanish).

Math. Eng. Thesis, Department of Mathematical Engineering, University of Chile, Santiago, Chile, August 2002.

- Wi10 CSE 725 - Computability and Unsolvability
- Sp10 CSE 725 - Computability and Unsolvability
- Sp10 CSE 788.01 - Topics in Randomized Algorithms
- Au10 CSE 680 - Introduction to Analysis of Algorithms and Data Structures
- Jan 2011 - Summer School on Discrete Mathematics. Randomized algorithms and matrix decompositions.
- Wi11 CSE 725 - Computability and Unsolvability
- Au11 CSE 680 - Introduction to Analysis of Algorithms and Data Structures
- Sp12 CSE 788.01 - Sparse Representations and Compressed Sensing
- Sp12 CSE 725 - Computability and Unsolvability
- Sp13 CSE 6321 - Computability and Complexity
- Sp13 CSE 5339 - Randomness and Geometry in the Design of Algorithms
- Au13 CSE 2331 - Foundations II: Data Structures and Algorithms
- Sp14 CSE 6321 - Computability and Complexity

- Joseph Anderson, Mikhail Belkin, David Cash, Bruno Codenotti, Jie Cui, Amit Deshpande, Alan Frieze, Navin Goyal, Alejandro Jofré, Ravi Kannan, Abhisek Kundu, Nelson Morales, Patricio Ramírez, Roberto Rondanelli, Marcos Sotomayor, Alejandro Toriello, Kasturi Varadarajan, Santosh Vempala, Juan Pablo Vielma, Grant Wang, Xuancheng Shao, James Voss.