Duality of Generative & Discriminative Recommendation (DRAGON) under Prof. Julian McAuley, UCSD (Oct 23 - Present)
Proposed a novel approach for the task of sequential recommendation which include the benefits of both the generative and discriminative paradigm to achieve SoTA results (increment of ~5% in nDGC@5 in comparison to the current best model) on Amazon’s recommendation dataset of Instruments, Games, Baby and Office products.
Paper on the above submitted to NuerIPS 2024.
MathNet under Prof. Neil Heffernan, Worcester Polytechnic Institute (Aug 22 - Jul 23)
Working on auto-grading of open-ended math problems from student-uploaded image answers using techniques such as document analysis.
One of 2 teams within an application pool of 10 teams to receive a $100K grant from the Jaffe foundation, founded by Laurence Holt and Doug Jaffe, to further pursue research in this area.
Published two papers -
Logistic Innovation Lab under Prof. N.S Narayanaswamy (August 2021 - July 2022)
Lead a team that built products to extract vehicle and driver information from paperwork, detect unsafe driving, dynamically redirect vehicles based on factors like congestion, weather, and estimate ETA using Computer Vision and Machine Learning.
Creativity in AI under Prof. Krishnan Balasubramanian (June 2021 - Dec' 2021)
Built a novel model using a combination of two transformer-based models to encode the style of a professor and generated lecture transcripts on theoretical topics with the style of the professor. Secured the highest grade ‘S’ for my research contributions to the project.
Players Prediction in the IPL Auction under Prof. Rupesh Nasre (January 2020 - April 2020)
Worked on an algorithm with minimal runtime to deterministically predict the best combination of players given budget constraint from a large existing dataset.
Solved the problem and reduced the runtime by 100x using a combination of dynamic programming and Dijkstra’s algorithm.
Link: https://github.com/AbhishekSanthanam/IPL_Auction_Best_Combination_Predictor_DBMS
2. Improvement of an existing algorithm for min-height elimination tree for interval graphs under Prof. C. Pandu Rangan (June 2020 - June 2020)
Improved the time complexity of an algorithm to find the minimum height elimination tree of an interval graph given by Prof.Bengt Aspvall & Pinnar Heggerness from O(n4) to O(n3).
3. Improvement of Algorithm for Minimum Rectilinear Steiner Tree under Prof. B.V. Raghavendra Rao (May 2021 - May 2021)
Improved an existing algorithm for the Minimum Rectilinear Steiner Tree. Using mathematical techniques.
Minimized the runtime and cost of the tree successfully by 10x for large values of input.
Link: https://github.com/AbhishekSanthanam/Improvement-of-the-MRST-Algo