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 \))-
Adaptive and Robust Watermark for Generative Tabular Data
Conference on Uncertainty in Artificial Intelligence (UAI) 2026.
-
MetaTT: A Global Tensor-Train Adapter for Parameter-Efficient Fine-Tuning
Transactions on Machine Learning Research (TMLR) 2026
-
GPU-Parallelizable Randomized Sketch-and-Precondition for Linear Regression using Sparse Sign Sketches\( ^\star \)
International Workshop on Parallel and Distributed Scientific and Engineering Computing 2026 (PDSEC 2026). Best Paper Award
-
A Unified Framework for Provably Efficient Algorithms to Estimate Shapley Values
Annual Conference on Neural Information Processing Systems (NeurIPS) 2025.
-
Improved Spectral Density Estimation via Explicit and Implicit Deflation\( ^\star \)
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2025.
-
Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra\( ^\star \)
Innovations in Theoretical Computer Science (ITCS) 2024.
-
Sublinear Time Eigenvalue Approximation via Random Sampling\( ^\star \)
extended abstract in International Colloquium on Automata, Languages, and Programming (ICALP) 2023, full paper in Algorithmica 2024.
-
Sublinear Time Approximation of Text Similarity Matrices
AAAI Conference on Artificial Intelligence (AAAI) 2022.
-
Tight Coupling of Character, Word, and Place Recognition for End-to-End Text Recognition in Maps
Technical Report, College of Information and Computer Sciences, University of Massachusetts, Amherst, MA, 2019.
-
Historical Map Annotations for Text Detection and Recognition
Grinnell College, Technical Report, 2018.
-
U-PC: Unsupervised Planogram Compliance
European Conference on Computer Vision (ECCV) 2018.
Theses/Dissertations
-
Sublinear Algorithms for Matrices: Theory and Applications
PhD Dissertation, UMass Amherst, 2024.
-
Estimation of image features representing facial emotions for emotion synthesis
M. Tech Dissertation Series, Indian Statistical Institute, Kolkata, 2015.
Patents
-
System and method for object recognition based estimation of planogram compliance
U.S. Patent 10,748,030, 2020.