Optimal Sparsification of Gaussian Processes
Preprint video
An exponential improvement on my STOC’26 paper with Anindya De, Rocco Servedio, and Ryan O’Donnell.
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
I study the power and limits of efficient computation in high dimensions. My work spans learning theory, sublinear algorithms, and statistics, drawing on and contributing to complexity theory (particularly the analysis of Boolean functions), high-dimensional geometry, and probability theory. A recurring theme is understanding how structure—such as convexity, low-dimensionality, or sparsity—can be detected and exploited in theoretical models inspired by practical questions.
You can find my full publication list, as well as my papers on Google Scholar and DBLP.
Preprint video
An exponential improvement on my STOC’26 paper with Anindya De, Rocco Servedio, and Ryan O’Donnell.
SODA 2027
Sharp bounds for recovering high-dimensional distributions from noisy Fourier measurements, without any assumptions on sparsity or separation.
STOC 2026
A precise characterization of when sparsity can be tested from noisy examples using a number of samples independent of dimension.
FOCS 2024 slides
How many halfspaces do you need to approximate a convex set under the Gaussian distribution? Sadly, we still don’t quite know the answer.
STOC 2024 QIP 2024
Progress toward resolving Moore’s 1999 conjecture on the limits of shallow quantum circuits. Recently settled by OpenAI.
Probability Theory and Related Fields 2022
A general approach to quantitative correlation inequalities. Gives a simple proof of (a generalization of) Talagrand’s correlation inequality and a strengthening of Royen’s Gaussian correlation inequality.
I enjoy being outdoors, cooking, and staring at (or being stared at by) my cat.