CSE 600 Seminar Series | Fall 2025


Abstract: Virtual worlds are prevalent in applications ranging from entertainment, healthcare, retail, to workforce training. With the demand for virtual content growing exponentially, the market for such content is valued at over $200 Billion, which is accelerating the need for advanced computational solutions. In this talk, I will focus on a key challenge in virtual content creation: simulating autonomous agents.
I begin by overviewing this problem domain, through the lens of a physics-based dynamics simulation, which enables the simulation of thousands of agents at interactive rates with GPU programming, achieving a level of performance previously unattainable.
Next, I'll present our recent results in Deep Reinforcement Learning for multi-agent navigation, which enable refined, reward-based strategies to control agent movement. We demonstrate how these techniques can simulate realistic crowds, with broad applications in pedestrians, robots, and swarms. Lastly, I conclude my talk by discussing our lab's work-at-large and the wide range of research opportunities in this emerging area.

Speaker: Tomer Weiss is a professor with New Jersey Institute of Technology since 2020. He received the best student, presentation, and best paper awards in various ACM SIGGRAPH conferences for his work on simulating multi-agent crowds. He was also a finalist in both ACM SIGGRAPH Thesis Fast Forward, and the ACM SIGGRAPH Asia Doctoral Symposium in 2018. He received his PhD in computer science from UCLA in 2018. His research interests include multi-agent dynamics, scene understanding, and interactive visual computing.



Abstract: Trustworthy AI deployment in high-stakes domains requires systems that are fair, private, robust, and controllable as they scale. Yet these demands are often pursued through ad-hoc approaches, lacking a systematic understanding of the inherent trade-offs between competing objectives. We add fairness regularizers and hope bias decreases. We train on massive datasets and hope the model learns the underlying logic of how concepts combine, rather than memorizing statistical shortcuts. We encrypt data and hope the resulting computational overhead remains manageable. But hope isnot a science.
In this talk, I argue that what trustworthy AI lacks is not better heuristics but a deeper science of what these properties fundamentally cost and what is achievable. Before we can fix a system, we must map the terrain: what trade-offs are unavoidable, what regions of performance areunreachable, and how far current methods fall from what is actually achievable. My research builds this map across fairness, privacy, robustness, and controllability, following a common methodology: diagnose where models fail, characterize the fundamental limits any method must obey, and design systems that approach those limits. I will present this framework, its extension to scientific applications where we replace statistical constraints with physical laws to ensure AI systems remain grounded in reality, and a vision for scaling these principles to the rapidly expanding ecosystem of composed and interacting AI systems.


Bio: Dr. Vishnu Boddeti is an Associate Professor in the Department of Computer Science and Engineering at Michigan State University, where he leads the Human Analysis Lab (HAL). His research develops mathematical frameworks for trustworthy AI, spanning fairness, privacy, robustness, and physics-informed learning, with an emphasis on characterizing fundamental limits and building systems that achieve them. His work has been supported by NSF, NIST, DARPA, ONR, Ford, and others, and recognized with a Meta Research Award (2021). His research has been featured on the cover of Nature, recognized as an Editor's Highlight in Nature Communications, and received multiple best paper awards, including the 2024 IEEE-CCF Cloud Computing Best Paper Award and the TMLR Outstanding Certification Finalist (2023). He serves as Senior Area Editor for IEEE Transactions on Information Forensics and Security and completed his PhD in ECE from Carnegie Mellon University in 2012.

Location: NCS 120
Join us as we celebrate this year's Brook & Beyond Challenge finalists.
The Office for Research and Innovation invites you to hear about the two-month journey in which the Brook & Beyond team supported eight cohorts in bringing their bold ideas from the lab to the marketplace. It's an energizing evening that highlights the collaboration, creativity, and entrepreneurial spirit driving discovery across the University.
Meet this year's award recipients, hear pitches from the emerging founders, and applaud their achievements.
Connect, celebrate, and be part of the momentum shaping the future of innovation at
Stony Brook University.
Refreshments will be served. Registration is required.
Register Here.
Join us at the Center for Excellence in Learning and Teaching (CELT) for an interactive Zoom workshop on Generative AI designed for faculty and staff interested in enhancing teaching and assessment practices, increasing student engagement, and navigating the rapidly evolving landscape of AI tools. Participants will be introduced to common AI tools, explore potential instructional uses, and discuss key considerations such as academic integrity, transparency, and equity.
Register now: https://stonybrook.zoom.us/meeting/register/6js1eP64T1ys8tyU57EJ7Q#/registration
Discover how U.S. Census Bureau Tools can help you find free data for your research projects, community, and more. See how to access the latest American Community Survey and 2020 Census data for various geographies including New York City and Long Island at data.census.gov. Learn about Community Resilience Estimates and how to navigate My Community Explorer; an interactive map-based tool which highlights demographic and socioeconomic data that measure inequality. This session will involve live demonstrations and hands-on exercises for participants. Registrants will receive the Zoom link one day prior to the event.

Please Register for SBU Libraries' AI Club: Exploring Census Data here.
The overall purpose of this seminar is to bring together people with interests in Computer Vision theory and techniques and to examine current research issues. This course will be appropriate for people who already took a Computer Vision graduate course or already had research experience in Computer Vision. To enroll in this course, you must either: (1) be in the PhD program or (2) receive permission from the instructors.

Each seminar will consist of multiple short talks (around 10 minutes) by multiple people. Students can register for 1 credit for CSE 656. Registered students must attend and present a minimum of 2 or 3 talks. Everyone else is welcome to attend. Fill in https://forms.gle/pCVXovgfMfQwGqG38 to subscribe to our mailing list for further announcement.

Abstract: Millions of individuals living in disadvantaged communities are burdened by poverty, illegal drug activities, health concerns, and the lack of reliable and affordable access to facilities (e.g., schools, hospitals, and transit stations). To address these societal problems efficiently with broad support, initiatives have called to engage agents (e.g., residents, community leaders, or stakeholders) and consider their preferences on community improvement decisions to make collective community decisions. In this talk, we will focus on our ongoing AI-empowered collective decision-making approaches to improve the accessibility of individuals to facilities by (a) locating facilities to provide essential services and (b) strengthening existing infrastructures via structural modifications (e.g., constructing new roads, bridges, multi-use paths, or shuttle services) subject to individuals' preferences on the locations of the facilities and which communities to improve access, respectively. In particular, we will discuss our (theoretical and algorithmic) studies on modeling these approaches under several settings (e.g., accounting for fairness and agent preferences) and designing fair, transparent, strategy proof, and (approximately) optimal mechanisms to elicit (true) individual preferences and determine collective community decisions in order to improve facility accessibility. Finally, we will discuss other ongoing and future collective decision-making efforts in urban planning and public health (i.e., our recent studies on substance use research) to improve communities.

Bio: Hau Chan is an assistant professor in the School of Computing at the University of Nebraska-Lincoln. He received his Ph.D. in Computer Science from Stony Brook University in 2015 and completed three years of Postdoctoral Fellowships, including at the Laboratory for Innovation Science at Harvard University in 2018. His main research lies in multi-agent aspects of AI for Society and Social Good, focusing on developing modeling and algorithmic foundations for tackling societal problems involving agents and predicting agent behavior in societal contexts, leveraging AI, game theory, mechanism design, and machine learning to better inform policymaking and (collective) decision-making. His team has been addressing societal challenges and fairness issues in various domains, including security (e.g., reducing vulnerability), public health (e.g., reducing substance use and homelessness), and urban planning (e.g., improving accessibility to public facilities), collaborating with domain experts. His research has been supported by NSF, NIH, and USCYBERCOM. He has received several Best Paper Awards at SDM and AAMAS and distinguished/outstanding SPC/PC member recognitions at IJCAI and WSDM. He has given tutorials and talks on computational game theory and mechanism design at venues such as AAMAS and IJCAI, including an Early Career Spotlight at IJCAI 2022. He has served as co-chairs for the AI and Social Good Track, Demonstration Track, Student Activities, Doctoral Consortium, Job Fair, Scholarships, Finance, and Diversity & Inclusion Activities at AAAI, AAMAS, and IJCAI.

Location: Old Computer Science, room 1310

Abstract : Humans reason about everyday situations by making commonsense-based inferences, derived both from explicitly stated information and implicit, unstated knowledge. In this thesis, I investigate whether NLP models have different aspects of causal knowledge about events and how to improve their understanding of narratives and plans.
Answering questions about why people perform actions in a narrative can test whether NLP systems contain and can effectively apply causal knowledge about events. I introduce TellMeWhy, a dataset concerning why characters in short narratives perform the actions described. An evaluation of then SOTA finetuned models show that they are far worse than humans. To improve models, it is important to understand what aspects of causal knowledge they need and how to best use external sources to inject this knowledge. In KnowWhy, I analyze different ways of injecting knowledge into models, which is difficult since we do not know apriori what type of knowledge will be needed to answer a question, hence requiring a ranking model to pick the most important inference. Results show that this retrieved knowledge helps models of all sizes, thereby improving their understanding of narratives.
Next, I study whether models can reason about causal aspects of plans. I focus on testing whether they understand the underlying causal dependencies reflected in the temporal order of a plan's steps. I introduce CAT-Bench, and find that SOTA models are underwhelming, and that model answers are not consistent across questions about the same step pairs. In their current state, these models cannot yet reliably be used for complex user-facing tasks. I then measure contemporary models' ability to perform user-facing and user-centric plan customization. I introduce the use of semi-symbolic edits in large language model (LLM) based agents and test several multi-LLM-agent architectures for plan customization. While LLMs still lack the ability to understand complex customization hints, my results suggest that LLM-based architectures may be worth exploring further for other customization applications. Finally, I distill complex reasoning capabilities into small language models (SLMs) using synthetic data that reflects a decomposition-then-editing process for plan customization. I demonstrate that explicitly teaching this latent causal reasoning significantly improves the quality of SLM-generated customizations. Overall, my work has improved how well NLP models understand complex reasoning associated with events in different contexts.

Speaker: Yash Kumar Lal

Location: NCS 220 or Zoom https://stonybrook.zoom.us/j/95849648243?pwd=dgPpZtDpgwQrK9z1SaPpNbBifaorzk.1
Abstract: DeepSeek-R1-Zero has shown that reinforcement learning (RL) at scale can directly enhance the reasoning capabilities of LLMs without supervised fine-tuning. In this work, we critically examine R1-Zero-like training by analyzing its two core components: base models and RL. We investigate a wide range of base models, including DeepSeek-V3-Base, to understand how pretraining characteristics influence RL performance. Our analysis reveals that DeepSeek-V3-Base already exhibit ''Aha moment'', while Qwen2.5 base models demonstrate strong reasoning capabilities even without prompt templates, suggesting potential pretraining biases. Additionally, we identify an optimization bias in Group Relative Policy Optimization (GRPO), which artificially increases response length (especially for incorrect outputs) during training. To address this, we introduce Dr. GRPO, an unbiased optimization method that improves token efficiency while maintaining reasoning performance. Leveraging these insights, we present a minimalist R1-Zero recipe that achieves 43.3% accuracy on AIME 2024 with a 7B base model, establishing a new state-of-the-art.

Speaker: Md. Saqib Hasan

Location: CS2311