Skip to content
View sreejeetm1729's full-sized avatar
πŸ˜„
πŸ˜„

Block or report sreejeetm1729

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Content in all repositories owned by your account will be closed.
Maximum 250 characters. Please don’t include any personal information such as legal names or email addresses. Markdown is supported. This note will only be visible to you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
sreejeetm1729/README.md

Hello! 🍁 I am a 4th year Ph.D. student at the Department of ECE, North Carolina State University advised by Dr. Aritra Mitra. My research focuses on the theoretical foundations of reinforcement learning, statistical learning, and control under uncertainty. In particular, I am interested in understanding how learning and decision-making systems behave when the information available to them is imperfect. This could be due to adversarial corruption, heavy-tailed noise, quantization, communication delays, asynchronous updates, temporal dependence, non-stationarity, or unreliable agents. As a part of my research work, I also have relevant background in Probability Theory, Linear Algebra, Stochastic Optimization, Randomized Algorithms, and Robust Statistics. Previously, I have completed my M.Tech in Robotics and Autonomous Systems from Indian Institute of Science, Bangalore in 2023 and B.E in Electrical Engineering from Jadavpur University, Kolkata in 2021.

A central goal of my work is to design provably reliable reinforcement learning algorithms and develop sharp finite-sample rates, together with matching lower bounds that characterize the fundamental limits imposed by these imperfections. More broadly, I am interested in the statistical and information-theoretic limits of learning under imperfect feedback and constrained information. My work has appeared in major AI venues, including ICML 2026 and AISTATS 2025, as well as major control venues such as IEEE CDC 2024, CDC 2026, and IEEE ACC 2026. Beyond these contributions, several of my recent works are currently under review at leading journals, including IEEE TAC, IEEE TSP, Automatica, and TMLR.

Aside from my passion for mathematics, I also enjoy cooking, reading, writing poetry, and reflecting deeply.
Also, I love cats, and elephants. A lot. 🐘❀️😸

Pinned Loading

  1. Corruption-Tolerant-Asynchronous-Q-Learning-with-Near-Optimal-Rates Corruption-Tolerant-Asynchronous-Q-Learning-with-Near-Optimal-Rates Public

    Accepted at ICML 2026πŸŽ‰. πšπš˜πš‹πšžπšœπš π™°πšœπš’πš—πšŒ-πš€/π™°πšœπš’πš—πšŒ-πšπ™°πš€/𝙼: The first provably robust variants of asynchronous Q-learning that tolerates adversarially corrupted rewards. Our algorithm is distribution-agnos…

    1

  2. Adversarially-Robust-TD-Learning-with-Markovian-Data Adversarially-Robust-TD-Learning-with-Markovian-Data Public

    Accepted at AISTATS 25πŸŽ‰. Policy evaluation estimates long-term returns in RL. Temporal Difference (TD) learning, a classic method with finite-time guarantees, assumes well-behaved rewards. But what…

    MATLAB

  3. Robust-Asynchronous-Q-Learning-under-Reward-and-State-Corruption-via-Batching Robust-Asynchronous-Q-Learning-under-Reward-and-State-Corruption-via-Batching Public

    Accepted at CDC 2026, Automatica (Review)πŸŽ‰. π™±πš-π™°πšœπš’πš—πšŒπš€ : The work provides the first robust asynchronous Q-Learning algorithm under joint reward and state corruption, with minimax-optimal corruption…

    Jupyter Notebook

  4. Robust-Federated-Q-Learning-with-Almost-No-communication Robust-Federated-Q-Learning-with-Almost-No-communication Public

    Accepted at ACC 26, IEEE TAC (Review) πŸŽ‰. πšπš˜πš‹πšžπšœπš π™΅πšŽπš-πš€ : A federated Q-learning algorithm that stays reliable under adversarial agents. It blends model-based/free updates to ensure (i) high-probabil…

    Jupyter Notebook

  5. Q-Learning-over-Static-and-Time-Varying-Networks Q-Learning-over-Static-and-Time-Varying-Networks Public

    Accepted at ACC 2026 , IEEE TSP (Review) πŸŽ‰. πš…πšπ™³πš€ : We propose and analyze a new algorithm that achieves collaborative speedups in sample complexity for Q-learning over static and time-varying netwo…

    Jupyter Notebook 2

  6. Robust-Q-Learning-under-Corrupted-Rewards Robust-Q-Learning-under-Corrupted-Rewards Public

    Accepted at IEEE CDC 24 πŸŽ‰. We analyze Q-learning's robustness against strong-contamination attacks that disrupt reward signals. Our robust Q-learning algorithm employs historical data to create res…

    Jupyter Notebook 1 1