Hello! I am a C.L.E. Moore Instructor of Mathematics (≈ departmental postdoc) at MIT.
I completed my PhD in the theory group at Columbia, where I was extremely fortunate to be advised by Rocco Servedio and Mihalis Yannakakis.
Email: shivamn@mit.edu Office: 2-376
Research
My research lies broadly at the interface of complexity theory and high-dimensional geometry, probability, and statistics. Some questions that motivate my work include:
- Which forms of structure (such as convexity, low-dimensionality, or sparsity) can we efficiently recognize and exploit in high-dimensional settings?
- When can complex high-dimensional objects be usefully approximated by simpler, sparse, or lower-dimensional ones?
- When do these tasks admit efficient algorithms, and when are they computationally intractable?
You can find my all my papers here. Here are links to my Google Scholar and DBLP pages.
Selected Papers
Sparsifying Suprema of Gaussian Processes v2STOC 2026
Gaussian Approximation of Convex Sets by Intersections of HalfspacesFOCS 2024
Optimal Non-Adaptive Tolerant Junta Testing via Local EstimatorsSTOC 2024
Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and JuntasSODA 2024
Quantitative Correlation Inequalities via Semigroup InterpolationProbab. Theory Related Fields 2022
Service
- I co-organize TCS+, an online seminar series in theoretical computer science. Suggest a talk here!
- I'm co-organizing a workshop at STOC 2026 on Testing in the Modern World.