Research Interests

Broadly, I am interested in developing computationally efficient algorithms for large-scale data analysis, numerical linear algebra, and machine learning. Much of my work focuses on randomized and sublinear algorithms for matrix problems, including sketching, sampling, spectral approximation, low-rank approximation, and fast solvers.

More recently, I have worked on efficient algorithms for modern AI systems, including randomized sketch-and-precondition methods, quantum-inspired algorithms, parameter-efficient finetuning, data subsampling, and watermarking. A recurring theme in my work is to design algorithms that are theoretically principled, computationally scalable, and useful in practice.

Publications

(author ordering for the papers below is alphabetical if marked \( ^\star \)) (equal contribution authors marked with \( ^\dagger \))

Theses/Dissertations

Patents