Hello! I'm Amit, a fourth-year PhD student in the Theory group at MIT, where I am fortunate to work with Sam Hopkins and Kuikui Liu. I am spending Fall 2026 visiting the Simons Institute. I am grateful for having had the support of a MathWorks fellowship and an Akamai Presidential Fellowship in the past. I interned at Microsoft Research New England in Summer 2026, under the supervision of Dylan Foster.
I am broadly interested in probability and theoretical computer science.
Recently, I have been thinking about Markov chains.
A list of my publications can be found here.
You can contact me at a[*]_r@[*].edu after replacing [*] with the last three letters of my name, and find me at 32-G578.
Before my PhD, I did my undergrad at IIT Bombay, where I graduated with a BTech with honors in Computer Science and a minor in Mathematics. While at IITB, I had the privilege of working with Niranjan Balachandran, Navin Goyal, Hariharan Narayanan, and Piyush Srivastava.
News
- 13 Oct 2026: Hang, Brice, Sidhanth, and I uploaded a paper on sampling from the Sherrington–Kirkpatrick model at all subcritical temperatures, using weak Poincaré inequalities.
- 27 Sep 2026: I was one of thirty-two people who participated in a workshop at the Simons Institute on how the TCS community can adapt to the ongoing advances in AI. I urge you to read our report!
- 25 Sep 2026: I gave a talk at the Simons Institute on weak Poincaré inequalities.
- 11 Aug 2026: Prashanti, Sam, and I uploaded a paper to arXiv on best separable state, showing that the classical "pinning" algorithm beats prior known guarantees.
- 25 Jun 2026: I spoke about Markov chains and approximate message passing at STOC.
- 12 Feb 2026: I spoke about proving eigenvalue bounds with zerofreeness at SPAMS at MIT.
- 2 Dec 2025: David and I uploaded a paper to arXiv which makes progress towards establishing a long-conjectured relationship between the Glauber dynamics and approximate message passing.
- 16 Nov 2025: Prashanti, Sam, David, and I uploaded a paper to arXiv on faster algorithms for MAX-CUT (and other 2CSPs) on bounded threshold rank graphs.
- 12 Nov 2025: I spoke about proving eigenvalue bounds with zerofreeness at the DACO Seminar at ETH Zürich.