Research

Honors and Awards

• The Patrick and Valentine Firmenich Fellow for Business and Society at INSEAD.

• One of three finalists for the 2021 Tucker Award, given every three years to the best PhD Thesis in Optimization worldwide.

• Recipient of the 2020 Information Theory Society Paper Award for our paper "Exact recovery in the stochastic block model"

• Recipient of the 2018 INFORMS Optimization Society Young Researchers' Prize for our paper "On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity ".

• Recipient of the 2017 School of Engineering and Applied Science Award for excellence.

• Selected to attend the Young Researchers Workshop organized by Cornell University in October 2017

• Selected to attend the EE/CS Rising Stars Workshop at Stanford University in November 2017

• Recipient of the 2016 INFORMS Computing Society Best Student Paper Award  for our paper "DC Decompositions of Nonconvex Polynomials using Algebraic Techniques".

• Gordon Wu Fellow (September 2012-May 2016)

Press coverage

• I am featured in this article on "MBA Professors to look out for in 2020".

• This article in Quanta magazine does a great job of explaining some aspects of DSOS and SDSOS (introduced by Amir Ali and Ani) and its follow-ups that we have worked on with Amir Ali.

Research Interests

My interests lie at the interface of optimization, computational complexity, and algorithm design. A lot of my work relates to analyzing relaxations of NP-hard problems, particularly those that arise in polynomial optimization, and algorithm design for large-scale semidefinite programs. For more details, please see my publications page.