A versatile researcher interested in Algorithms, Complexity Theory and principled approaches to Machine Learning. Curriculum Vitae.
Currently I am working on a couple of projects and participating in an awesome reading group at EPFL.
We are studying the resolution proof complexity of certain problems of interest, also using tools from query complexity. Since state-of-the-art SAT solvers can be simulated by Resolution, this is exactly studying the limits of what any SAT solver can do.
We propose a completely new paradigm for preprocessing data in an unsupervised manner to improve the performance of clustering algorithms, inspired by Error-Correcting Codes and Locality Sensitive Hashing.
Supervisor: Rajiv Raman. Studied various topics related to Algorithms for Big Data (Streaming, Sketching, Communication Complexity, Pseudorandomness) and presented it to my supervisor, peers and other researchers visiting or working at IIIT-Delhi. I wrote some expository notes which can be found here.
Proved a theorem about the inapproximability of a graph compression problem. The paper can be found on ArXiv.
Advisors: Rajiv Raman, Samrith Ram.
GPA: */6
Cumulative GPA: 9.1/10, Major GPA: 9.3/10
When I want to distance myself from math and CS, I take photos, read a book and write sometimes. I also enjoy playing badminton, and am naturally trying to hike and climb in Switzerland.
I have spent considerable time reading fantasy fiction books and have been certifiably obsessed with Brandon Sanderson's Cosmere in the past. I also have an unhealthy obsesion with an unlikely band/artist duo of Radiohead and Hozier.