I am a PhD Candidate at the College of Information and Computer Sciences, University of Massachusetts, advised by Professor Cameron Musco. My work focuses on approximating kernel methods, randomized algorithms and online learning with applications to real world problems. I am especially interested in the overarching goal of finding adaptive kernel functions for large datasets.
Prior to this I worked as Visiting Researcher in Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata with Professor Dipti Prasad Mukherjee. I completed my Masters in Computer Science in the year 2015, from the same institute. My primary research interest was in non-linear learning models for pre-image computation of image datasets.
In my leisure I enjoy playing guitar, badminton and birding. I am an ardent fan of absurdist fiction, philosophical fiction, epic fictions and graphic novels. I am absolute fan of Seinfeld and consider it the pinnacle of observational and conversational comedy.
I am on the job market for Summer/Fall 2023.
- (February 2023) I passed my Thesis Proposal Defense.
- (January 2023) Awarded CICS Dissertation Writing Fellowship for Spring 2023.
- (August 2022) Presented our work on Sublinear Time Eigenvalue Approximation via Random Sampling at FODSI Sublinear Algorithms Workshop 2022. [link to poster]
- (January 2022) Awarded AAAI-22 Student Scholarship.
- (December 2021) Our paper on Sublinear time approximation of text similarity matrices was accepted for publication in AAA1 2022.
- (August 2021) Presented our work on Estimating eigenvalues of symmetric matrices using random submatrices at WALD(O) 2021. [link to poster]
- (June 2021) Presented our work on Kernel approximation in sliding window models at WOLA 2021. [link to poster]
About this website
Powered by Jekyll. Theme by AcademicPages, a fork of Minimal Mistakes, some edits including this acknowledgement were borrowed from Chris Severen and Ian Gemp. Hosted on Github Pages.