Apoorv Vikram Singh
Ph.D. Candidate
Computer Science
NYU Tandon

I am a fourth year Ph.D. candidate at the department of Computer Science at the NYU Tandon School of Engineering. I am a part of the Algorithms and Foundations Group, where I am being advised by Dr Chris Musco.

Before joining NYU, I was a visiting researcher at the MODAL team in INRIA Lille where I worked with Dr Hemant Tyagi and Dr Mihai Cucuringu (Univ of Oxford). Before that I was a Project Associate in the Dept. of Computer Science and Automation, Indian Institute of Science, where I worked with Dr Anand Louis and Dr Amit Deshpande (Microsoft Research, India). I obtained my undergraduate degree from IIIT Bangalore.

Research Interests: My research interests lie at the intersection of theoretical computer science and statistical machine learning, with a focus on theoretical foundations of big data. Currently, I am working on sublinear time graph problems and clustering problems. I am also interested in probabilistic combinatorics, Sum of Squares Hierarchy, and Discrepancy Theory (see Reading Group).


  • Faster Spectral Density Estimation and Sparsification in the Nuclear Norm
    Yujia Jin, Ishani Karmarkar, Christopher Musco, Aaron Sidford, Apoorv Vikram Singh
    COLT 2024 [ArXiv]
  • Moments, Random Walks, and Limits for Spectrum Approximation
    Yujia Jin, Christopher Musco, Aaron Sidford, Apoorv Vikram Singh
    COLT 2023 [ArXiv]
  • Regularized Spectral Methods for Clustering Signed Networks
    Mihai Cucuringu, Apoorv Vikram Singh, D├ęborah Sulem, Hemant Tyagi
    JMLR 2021 [ArXiv]
  • Approximation Algorithms for Cost-Balanced Clustering
    Amit Deshpande, Anand Louis, Deval Patel, Apoorv Vikram Singh
    Preprint 2019 [Link]
  • On Euclidean $k$-Means Clustering with $\alpha$-Center Proximity
    Amit Deshpande, Anand Louis, Apoorv Vikram Singh
    AISTATS 2019 [ArXiv]