The AI Community at Stony Brook University is proud to announce Datathon 2026.

Dive into data analysis and AI/ML, and get ready to build something big. In this year's underwater-themed event, enjoy a weekend of data analysis, hacking, networking, fun activities, and minigames.

Whether you're a seasoned developer, data scientist, designer, or completely new to hacking, this event is your chance to collaborate, learn data science, and create something impactful with data and AI/ML.

What is Datathon?

AI Community's Datathon is the premier data science competition at Stony Brook University, bringing together students of all skill levels for a weekend of data exploration, analysis, and innovation. Just like a typical hackathon, you will be using your skills to build your dream project.

Unlike a regular hackathon, Datathon is focused on data science. You will be given a set of data to work with, analyze, and apply to your project. You can also find your own data to use. Your project will be presented to a panel of judges consisting of professors and industry professionals!

Who Can Participate

  • Students of all skill levels and majors are welcome.
  • Come with a team or find one at the event or on Discord.
  • This event is open to SBU and non-SBU students.

* Non-SBU Undergraduate Students are ineligible to receive prizes
* You must be 18+ or older (Excludes minors who are active SBU students)

Location: SAC Ballroom B

Register here.

Understand Prompting the crucial part to interface with models

Discover how to prompt effectively by exploring the details behind your AI interactions. This isn't just about basic prompting; it's about understanding how to articulate your ideas clearly. We'll showcase a few prompts and how they work. Discover how giving AI the right details can truly boost your productivity and help you reclaim valuable time in your day.

In this session, you will

  1. Utilize AI models effectively
  2. Understanding different prompts
  3. Find out tips that we use with AI

Register: https://stonybrookuniversity.co1.qualtrics.com/jfe/form/SV_dht1o3rNzlZhHka?source=event+manager&session=0805251000ai
CSE 600 Seminar Series | Fall 2025


Abstract: The first part of the presentation focuses on the fundamental role that failures play in the Ph.D. journey, highlighting how they offer invaluable learning experiences to build resilience, critical thinking, and adaptability. Instead of viewing failures as signs of inadequacy, they should be recognized as opportunities to learn, re-evaluate, and develop the persistence needed for success in a high-stakes research environment. In the second part of the presentation, we take a quick look at the evolution of distributed databases research at Stony Brook and then focus on different challenges associated with distributed transaction processing systems functioning in untrustworthy environments. Byzantine Fault-Tolerant (BFT) protocols have recently been extensively used by distributed transaction processing systems to establish consensus on the order of transactions. However, the proliferation of different BFT protocols has made it difficult to navigate the BFT landscape, let alone determine the protocol that best meets application needs. Moreover, as novel applications, modern hardware, and new cloud platforms arise, distributed transaction processing systems need to be designed with full-stack adaptivity in mind. This presentation discusses our vision for a reinforcement learning (RL)-based distributed transaction processing system that adjusts effectively in real time to dynamic fault scenarios and evolving workloads.

Bio: Mohammad Javad Amiri is an Assistant Professor in the Department of Computer Science at Stony Brook University. Before joining Stony Brook, he was a postdoctoral researcher in the Computer and Information Science Department at the University of Pennsylvania. He received his Ph.D. in Computer Science from the University of California, Santa Barbara. His research mainly lies at the intersection of data management and distributed systems, focusing on distributed transaction processing, consensus protocols, and blockchains.
The Division of Educational & Institutional Effectiveness is excited to host International Love Data Week at SBU, February 9-13, 2026!
Join us for a mix of 30-minute virtual sessions, an in-person kickoff on Monday, and a student-focused event on Wednesday celebrating data and data-informed decision-making.
Wrap up the week at the Love Data Week Open House on Friday, 2/13 with light refreshments, data-themed swag, photos with Wolfie, and time to connect with presenters.
Learn more and register on https://www.stonybrook.edu/commcms/oee/recognition/Love%20Data%20Week%202026%20Save%20the%20Date%20Placeholder.php

Abstract: Spectroscopy and imaging are two primary tools for probing material structures. However, the discovery of trends that guide the design of improved materials is often hindered by intertwined physical interactions or significant experimental noise. In this talk, I will present machine learning approaches that address both challenges. The first part focuses on the interpretation of X-ray absorption spectroscopy (XAS). We developed a controlled projection algorithm, RankAAE, which disentangles coupled structural descriptors in complex datasets and reveals analysis rules for inferring new structural information visually from spectra. The second part targets transmission electron microscopy (TEM) imaging of material structures. We developed a machine learning model capable of denoising extremely noisy images, while demonstrating strong out-of-distribution generalization. I will describe the construction of these models and demonstrate their effectiveness through representative scientific case studies.

Bio: Dr. Xiaohui Qu is a Staff Scientist in the Theory and Computation Group at the Center for Functional Nanomaterials (CFN), Brookhaven National Laboratory. His research focuses on developing interpretable machine learning and data analytics methods for materials science, with an emphasis on extracting structural insights from X-ray absorption spectroscopy and transmission electron microscopy. Dr. Qu earned his B.S. in Environmental Engineering and Ph.D. in Environmental Science from Shandong University, China, followed by postdoctoral research in Physics at Nanyang Technological University, Singapore, in Chemistry at Universidade Nova de Lisboa, Portugal, and in Materials at Lawrence Berkeley National Laboratory.

Location: IACS Seminar Room


Event Details & Calendar Link (includes zoom info): https://calendar.stonybrook.edu/site/iacs/event/iacs-seminar-speaker--xiaohui-qu-brookhaven-national-lab/
Abstract: Current Chain-of-Thought (CoT) verification methods predict reasoning correctness based on outputs (black-box) or activations (gray-box), but offer limited insight into \textit{why} a computation fails. We introduce a white-box method: \textbf{Circuit-based Reasoning Verification (CRV)}. We hypothesize that attribution graphs of correct CoT steps, viewed as \textit{execution traces} of the model's latent reasoning circuits, possess distinct structural fingerprints from those of incorrect steps. By training a classifier on structural features of these graphs, we show that these traces contain a powerful signal of reasoning errors. Our white-box approach yields novel scientific insights unattainable by other methods. (1) We demonstrate that structural signatures of error are highly predictive, establishing the viability of verifying reasoning directly via its computational graph. (2) We find these signatures to be highly domain-specific, revealing that failures in different reasoning tasks manifest as distinct computational patterns. (3) We provide evidence that these signatures are not merely correlational; by using our analysis to guide targeted interventions on individual transcoder features, we successfully correct the model's faulty reasoning. Our work shows that, by scrutinizing a model's computational process, we can move from simple error detection to a deeper, causal understanding of LLM reasoning.

Speaker: Xianjun Yang

Location: Old Computer Science Building - CS2311

AI is everywhere -- and so are the privacy concerns that come with it. At its core, the most common forms of AI we use today are online digital services -- and thus inherit the usual privacy risks of any internet-based tool. However, AI also introduces a set of unique and evolving risks. We'll take a closer look at one of the newest developments in this area: indirect prompt injection -- a technique that can trick AI tools into revealing or extracting private information. You'll learn how this emerging form of AI manipulation works, why it matters, and how to protect yourself -- as well as how similar techniques are being used in academic contexts to manipulate systems and even mislead researchers.

Register for this Zoom workshop.

The Vedanta Forum is devoted to one of humanity's oldest and most profound pursuits -- thinking. Thinking about who we truly are: the one that remains constant through childhood and old age, through waking, dream, and deep sleep. Thinking about the source and cause of creation, and its relationship to what inheres in us.

Across history, such thinking, both meditative and scientific, has been aimed at these questions. The ancient Upanishads proclaimed, Tat Tvam Asi -- Thou Art That -- revealing the non-dual identity of the individual and the ultimate reality. Centuries later, modern scientists such as Schrödinger and Bohr echoed similar intuitions about the unity of existence.

Over time, many philosophical approaches, traditions, and interpretive schools have arisen from such inquiry, each offering unique perspectives. The Forum will:

  • Focus on universal approaches and traditions and examine their teachings,

  • Foster comparative studies, and

  • Explore the practical benefits to society from such thinking,

through scholarly studies, dialogue, and debate also promoting accessibility to all qualified seekers. Additionally, the Forum will explore how these reflections can enrich life, education, and even technology.

Location: NCS 120 (New Computer Science), Engineering Dr, Stony Brook, NY 11794.

The program is available at: https://www.vedantaforum.org/events/program

Postmortem Program Analysis from a Conventional Program Analysis Method to an AI-assisted Approach

Abstract: Despite the best efforts of developers, software inevitably contains flaws that may be leveraged as security vulnerabilities. Modern operating systems integrate various security mechanisms to prevent software faults from being exploited. To bypass these defenses and hijack program execution, an attacker needs to constantly mutate an exploit and make many attempts. While in their attempts, the exploit triggers a security vulnerability and makes the running process abnormally terminate.

After a program has crashed and abnormally terminated, it typically leaves behind a snapshot of its crashing state in the form of a core dump. While a core dump carries a large amount of information, which has long been used for software debugging, it barely serves as informative debugging aids in locating software faults, particularly memory corruption vulnerabilities. As such, previous research mainly seeks fully reproducible execution tracing to identify software vulnerabilities in crashes. However, such techniques are usually impractical for complex programs. Even for simple programs, the overhead of fully reproducible tracing may only be acceptable at the time of in-house testing.

In this talk, I will discuss how we tackle this issue by bridging program analysis with artificial intelligence (AI). More specifically, I will first talk about the history of postmortem program analysis, characterizing and disclosing their limitations. Second, I will introduce how we design a new reverse-execution approach for postmortem program analysis. Third, I will discuss how we integrate AI into our reverse-execution method to escalate its analysis efficiency and accuracy. Last but not least, as part of this talk, I will demonstrate the effectiveness of this AI-assisted postmortem program analysis framework by using massive amounts of real-world programs.

Bio: Dr. Xinyu Xing is an Assistant Professor at Pennsylvania State University. His research interests include exploring, designing and developing new program analysis and AI techniques to automate vulnerability discovery, failure reproduction, vulnerability diagnosis (and triage), exploit and security patch generation. His past research has been featured by many mainstream media and received the best paper awards from ACM CCS and ACSAC. Going beyond academic research, he also actively participates and hosts many world-class cybersecurity competitions (such as HITB and XCTF). As the founder of JD-OMEGA, his team has been selected for DEFCON/GeekPwn AI challenge grand final at Las Vegas. Currently, his research is mainly supported by NSF, ONR, NSA and industry partners.
Defending Software Systems from Cyber Attack Campaigns Presented by R. Sekar The DNC hack of 2016, the Equifax breach of 2017, and the spate of ransomware campaigns in 2019 demonstrate the formidable challenges we face in securing our network and software systems against highly stealthy and sophisticated adversaries. In this talk, I will describe two avenues of research we have been pursuing to help tilt the table against such powerful adversaries. The first is software hardening techniques that make software vulnerabilities harder to exploit. To maximize their applicability and ease of use, our techniques are implemented into compilers, or they directly transform binary code. I will outline some of the exciting new developments we have had in this area over the years, including randomization, memory safety, information-flow tracking, control-flow integrity, and code-pointer integrity. We complement this first line of defense with techniques for analyzing and understanding attack campaigns that manage to slip past all deployed defenses. Our techniques can sift through logs consisting of hundreds of millions of events to zoom in on attack activity that may span just a few hundred events. I will describe our experience in mapping out several DARPA-sponsored red team attack campaigns.