My current research focuses on algorithms for graphs and matrices, especially in the context of large-scale data analysis and machine learning.
I draw on tools from dimensionality reduction, randomized numerical linear algebra, and optimization, with a focus on methods that adapt to modern computational environments, including streaming and distributed frameworks.
Our paper on Recursive Sampling for the Nyström Method has been retitled and updated with simpler proofs and complete experiments. If you want to try out the algorithm for kernel approximation, we also uploaded simpler and faster code (which doesn't require any parameter selection).
Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh. International Conference on Machine Learning (ICML 2017).
Input Sparsity Time Low-Rank Approximation via Ridge Leverage Score Sampling Michael B. Cohen, Cameron Musco, Christopher Musco. Symposium on Discrete Algorithms (SODA 2017). Slides: 60 Minutes.
Determining Tournament Payout Structures for Daily Fantasy Sports Christopher Musco, Maxim Sviridenko, Justin Thaler. Algorithm Engineering and Experiments (ALENEX 2017). Slides: 20 Minutes.
Principal Component Projection Without Principal Component Analysis Roy Frostig, Cameron Musco, Christopher Musco, Aaron Sidford. International Conference on Machine Learning (ICML 2016). Slides: 15 Minutes. MATLAB Code: fpcr.m (standard algorithm), kpcr.m (faster Krylov subspace algorithm)
Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition Cameron Musco, Christopher Musco. Conference on Neural Information Processing Systems (NIPS 2015). Invited for full oral presentation (1 of 15 out of 403 accepted papers). Slides: 20 Minutes. MATLAB Code: bksvd.m
Dimensionality Reduction for k-Means Clustering and Low-Rank Approximation Michael B. Cohen, Samuel Elder, Cameron Musco, Christopher Musco, Madalina Persu. ACM Symposium on Theory of Computing (STOC 2015). Slides: 20 Minutes, 60 Minutes.
Principled Sampling for Anomaly Detection Brendan Juba, Fan Long, Christopher Musco, Stelios Sidiroglou-Douskos, Martin Rinard. Network and Distributed System Security Symposium (NDSS 2015). Slides: 20 Minutes.
Uniform Sampling for Matrix Approximation Michael B. Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, Aaron Sidford. Innovations in Theoretical Computer Science (ITCS 2015).
Single Pass Spectral Sparsification in Dynamic Streams Michael Kapralov, Yin Tat Lee, Cameron Musco, Christopher Musco, Aaron Sidford. IEEE Symposium on Foundations of Computer Science (FOCS 2014). Invited to SICOMP Special Issue for FOCS. Slides: 20 Minutes, 60 Minutes.
If you're an MIT affiliate running into algorithmic problems in your research, check out our ``Algorithms Office Hours''. You can submit a description of your project and we'll set you up to meet with algorithms researchers in CSAIL who may be able to offer some guidance.
I'm an advisor with the EECS Graduate Communication Lab. We offer peer reviewing and coaching for research papers, fellowship and job applications, CVs, talks, and any other writing task or presentation. MIT affiliates can schedule an appointment with me or any other advisor here.
My Master's thesis was titled Dimensionality Reduction for Sparse and Structured Matrices.