Feb 2022 – Apr 2023 · 1 yr 2 mos · Noida, Uttar Pradesh, India

• 1. Designed and developed the initial data model for supporting different personas (candidate, hiring companies, career supporter and exchange sponsor) of Career Exchange.
• 2. Developed a pipeline to support recurring ingestion of 2M+ jobs daily from National Labour Exchange; extended the pipeline to support recurring ingestion of courses. Added support for large files by introducing multi thread download from sftp server reducing time by 50%, added monitoring and alerting for better observability.
• 3. Improved retrieval pipelines for jobs for exchange, primarily focused on blue collar jobs, resulting in 10% jump in CTR.
• 4. Enhanced analytics pipeline to power dashboards for exchange use-cases.

Jun 2021 – Jan 2022 · 7 mos · Noida, Uttar Pradesh, India

May 2020 – Aug 2020 · 3 mos · Washington, District of Columbia, United States

• Content discovery using Knowledge graph embeddings.

Aug 2019 – May 2021 · 1 yr 9 mos · College Park

• CMSC828U Machine Learning with Guarantees and Analyses
• CMSC216 Introduction to Computer Systems
• CMSC250 Discrete Structures

Jan 2019 – Aug 2019 · 7 mos · Noida Area, India

• Worked on developing a vector image editing IOS app based on Adobe Illustrator, in particular working with the pen, direct selection, selection and the snapping tool.
• Worked on developing the Adobe's text shaping library for IOS, Win and Mac.

Jun 2017 – Jan 2019 · 1 yr 7 mos · Noida Area, India

• Working on enhancing WRServices, Adobe's text shaping library used by most of the Adobe products like Photoshop, Illustrator and InDesign to handle the text shaping of complex scripts, by integrating it with Harfbuzz, the popular open-source text shaping engine, allowing for shaping of more than 40 scripts.

Jan 2017 – Apr 2017 · 3 mos

• Advisor: Prof Venkatesh Raman
• Worked on designing an efficient Fixed Parameter Tractable Algorithm for finding the Partial Vertex Cover in Bipartite Graphs and proving the lower bounds for the algorithm. Also explored the vertex cover and the feedback vertex set in tournaments and the state-of-the-art FPT algorithms available for them. Gained experience in the different standard reduction techniques to prove the fixed-parameter tractability of the various graph-theoretic problems.

May 2016 – Jul 2016 · 2 mos · Bengaluru Area, India

• The project involved study of Computational Linguistics to build a system that assigns semantic labels to edits between versions of a document. The built system encompasses algorithms to align the sentences between the versions; identify and classify them into Paraphrasing and Factual changes, and their subcategories. The algorithm also provides a ranking module that, based on user feedback and using Extractive Summarization Techniques, learns a regression model that is used for ranking the various types of edits for easier reviewing.
• The work was accepted at EMNLP 2017 as a short paper, and a patent titled "Classifying and ranking changes between document versions" was accepted by the US Patent office, Publication No: US2018/0285326 A1, Issued on Oct 4, 2018.

May 2015 – Jul 2015 · 2 mos · Mumbai, Maharashtra, India

• Worked on Algebraic Number Theory problems under the guidance of Prof Dipendra Prasad

May 2014 – Aug 2014 · 3 mos

• Studied the works of Brandes et. al. and Chehreghani on techniques to compute Betweenness Centrality and designed a non-uniform sampling technique of nodes in a graph to compute it. Implemented the Brandes algorithm in C++ along with the proposed technique and ran experiments on Erdos Renyi graphs, Barabasi Albert graphs and Stanford SNAP dataset. The proposed technique significantly outperformed the existing techniques in most of the experiments.
• The work was accepted as a short paper "An efficient estimation of a nodes betweenness" In Complex Networks VI (pp. 111-121), Springer, Cham, 2015 and as a journal paper in Social Network Analysis and Mining, 2018.