I am excited about the intersection of Deep Learning and Combinatorial Optimization, and have focused on learning to solve the famous Travelling Salesman Probelem (TSP) with Graph Neural Networks. My papers on end-to-end learning for TSP have been presented as invited talks at INFORMS 2019 and CORS 2021, as well as a workshop poster at NeurIPS 2019. I recommend reading my introductory blogposts on neural combinatorial optimization for a high-level overview. My long-term goal is to develop neural networks for tackling previously un-encountered NP-hard problems, especially those that are non-trivial to design heuristics for.
I was also awarded the Best Final Year Project Gold Medal by NTU, Singapore for my Bachelor’s thesis with Prof. Xavier Bresson.