Projects / Work Experience

Projects

Single Use Restless Multi-arm Bandits: Models and Efficient Algorithms
Fall 2023
Venue: Google Research, AI for Social Good
Supervisor: Prof. Milind Tambe, Harvard University
Collaboration: Assistant Prof. Niclas Boehmer, HPI, Germany

Description: Worked on a real-world dataset designed to model the intervention effects of health workers across India, developing efficient algorithms for sequential decision-making under scarce resources. Contributed to the modeling of a general Restless Bandit framework suitable for the intervention dataset at Google Research, India, and characterized the assumptions necessary for the asymptotic optimality of various computationally efficient policies.

It has been accepted for publication as a full paper at International Conference on Autonomous Agents and Multiagent Systems (AAMAS) 2025.

arxiv paper link.

A Theoretical Analysis of Soft-Label vs Hard-Label Training in Neural Networks
2023 - 2024
Venue: UIUC
Supervisor: Prof. R. Srikant, UIUC
Collaboration: Prof. Lin Xiaojun, Purdue University

Description: Theoretical insights for a few widely known phenomena of Knowledge Distillation including Model Compression (using traditional labels vs. soft labels for training in Supervised Classification task) using the tools of Neural Tangent Kernel.

arxiv paper link.

It has been accepted for publication at Learning for Dynamics and Control (L4DC) 2025.

Presented the work at CSL Student Conference 2025.

Inferring Labels from Multi-type Crowdsourced Data
2021 - 2022
Venue: UIUC
Supervisor: Prof. R. Srikant, UIUC
Collaboration: Seo Taek Kong, Dimitris Katselis UIUC

Description: Extended the Dawid-Skene (DS) model to multi-type cases and analyzed the error bounds of existing algorithms. Focusing on the case where there are two types of tasks, we propose a spectral method to partition tasks into two groups that cluster tasks by type. Our analysis reveals that task types can be perfectly recovered if the number of workers n scales logarithmically with the number of tasks d.

arxiv paper link.

Accepted for a talk at INFORMS Applied Probability Society Conference 2025 to be held in July.

Under review at TMLR.

An Online Delay-reliable Efficient Algorithm for Multi-resource Allocation
2020 - 2021
Venue: IIT Kharagpur
Supervisor: Prof. Goutam Das, IIT Kharagpur

Description: Proposed a polynomial-time, delay-reliable scheduling strategy for multi-resource allocation in wired media, optimal in the presence of adversarial packet arrival. Developed an approximate solution for handling multiple packet types under the same framework.

Under preparation for GLOBECOM 2025.

Parameter Calibration for EESM and TIESNR for 5G NR
Summer 2020
Venue: IISc
Supervisor: Prof. Neelesh B. Mehta, IISc

Description: Calibrated the parameters of two widely-used Effective SNR mappings (link quality metrics) - EESM (Exponential Effective SNR Mapping) and TIESNR (Time-Invariant Effective SNR) for 5G radio through link-level simulations in MATLAB's 5G Toolbox.

Work Experience

NVIDIA, Bangalore
Summer 2019
Project Intern: Digital Profile

Description: Automated the fault aggregation component of error collation from the IP metadata of the upcoming Orin SoC architecture. This involved accessing the Google Drive API using a Perl script and efficiently parsing IP metadata. Developed a comprehensive latency calculator using the maps between IPs within the same SoC architecture. Achieved exponential reductions in latency calculation time by applying shortest path algorithms and recursion in Python.