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

Department of Writing and Rhetoric Lecture

Escaping Human Judgment? The Politics of AI under Authoritarianism

Much of the recent debate around AI-decision making assumes that human involvement is a safeguard: humans bring context, accountability, and fairness to otherwise impersonal algorithmic systems. But whether human or algorithmic judgment is preferred depends on the complex interaction between an individual's social position and the configuration of power in which that judgment takes place.

Speaker: Zheng Fu, PRODIG+ Fellow

Location: Humanities 1008
Abstract: Self-supervised representation learning (SRL) has emerged as a pivotal advancement in machine learning, offering high-quality data representations without the need for labeled datasets. While SRL has demonstrated enhanced adversarial robustness compared to supervised learning, its resilience against other attack types, particularly backdoor attacks, remains an open question. Recent studies have revealed potential vulnerabilities in SRL, underscoring the necessity for a comprehensive security analysis. However, existing research often extrapolates attacks from supervised learning paradigms, neglecting the unique challenges and opportunities inherent to self-supervised mechanisms.

This thesis proposal aims to address three critical objectives in the realm of self-supervised learning: (1) exploring novel attack vectors, (2) implementing and evaluating practical attacks, and (3) developing robust countermeasures. We focus on two key SRL paradigms: Contrastive Learning and Diffusion Models. For Contrastive Learning, we synthesize existing security vulnerabilities and introduce innovative attack vectors, such as CTRL, to uncover distinctive risks. We conduct a comparative analysis of contrastive and supervised learning approaches in their defense against these threats, exploring potential safeguards and highlighting the limitations of current protective measures in self-supervised contexts. Regarding Diffusion Models, we demonstrate inherent vulnerabilities in their application to adversarial purification.

Our research aims to illuminate the unique challenges posed by emerging attack vectors in self-supervised learning, fostering technical advancements to address underlying security risks in real-world applications. By contributing to the development of more resilient and secure self-supervised representation learning systems, we seek to enhance their reliability and trustworthiness in practical scenarios. This comprehensive examination of SRL's security landscape will provide valuable insights for the broader machine-learning community and pave the way for more robust AI systems.

Join here.

Abstract: The remarkable success of large foundational models, such as LLMs and diffusion models, is built on their learning over vast amounts of static data from the Internet. However, human learning and problem-solving are fundamentally interactive processes--humans learn by engaging with their environment, tools, search engine, and feedback loops, iteratively refining their understanding and decisions. This gap between the interactivity of human learning and the static nature of model training raises a critical question: how can we imbue foundational models with the capacity for meaningful interaction?

In this talk, I will explore methods to enhance foundational models by incorporating interaction with the external environment. I will discuss strategies such as leveraging external tools, compilers, function calls to provide dynamic feedback to enhance foundation models. By drawing inspiration from human's interactive learning processes, I demonstrate how interaction-driven learning can lead to models that are not only more accurate but also more adaptable to real-world applications.

This work bridges the gap between static training paradigms and the dynamic, iterative nature of human intelligence, paving the way for a new generation of interactive AI systems.

Bio: Wenhu Chen has been an assistant professor at the Computer Science Department in University of Waterloo and Vector Institute since 2022. He obtained the Canada CIFAR AI Chair Award in 2022 and CIFAR Catalyst Award in 2024. He has worked for Google Deepmind as a part-time research scientist since 2021. Before that, he obtained his PhD from the University of California, Santa Barbara under the supervision of William Wang and Xifeng Yan. His research interest lies in natural language processing, deep learning and multimodal learning. He aims to design models to handle complex reasoning scenarios like math problem-solving, structure knowledge grounding, etc. He is also interested in building more powerful multimodal models to bridge different modalities. He received the Area Chair Award in AACL 2023, the Best Paper Honorable Mention in WACV 2021, the Best Paper Finalist in CVPR 2024, and the UCSB CS Outstanding Dissertation Award in 2021.
This symposium will highlight how artificial intelligence (AI) can assist in dementia detection, research and clinical care. For example, the use of robotics to assist with dementia care therapy is truly inspirational and cutting-edge for clinicians, trainees and the community at large, including assisted living facilities. The symposium will also focus on the role of AI in early detection of dementia and in identifying characteristics associated with future cognitive decline.

Learn more and register at https://cme.stonybrookmedicine.edu/continuing-medical-education/conferences/233/alzheimers-symposium-ai-the-future-of-dementia-care-2024/11/15/2024
Abstract: AI agents are increasingly deployed in complex, interactive environments, yet their runtime remains a major bottleneck for training, evaluation, and real-world use. Typical agent behavior unfolds sequentially, where each action requires an API call that can incur substantial latency. For example, a game of chess between two state-of-the-art agents can take hours. We introduce speculative actions, a lossless acceleration framework for general agentic systems. Inspired by speculative execution in microprocessors and speculative decoding in LLM inference, our method uses faster models to predict likely future actions and executes them in parallel, committing only when predictions match. We evaluate speculative actions across gaming, e-commerce, and web search environments, and additionally study a lossy extension in an operating systems setting. Across domains, we achieve up to 55% next-action prediction accuracy, translating into substantial latency reductions. Finally, we present a cost-latency analysis that formalizes the tradeoff between speculative breadth and time savings. This analysis enables principled tuning and selective branch launching, to ensure multi-branch speculation delivers practical speedups without prohibitive cost growth.

Speaker: Kehan Qi

Location: Old Computer Science Building - CS2311
Climate Uncertainty, Decision Making, and AI for Earth System Predictability Dr. Nathan Urban, Brookhaven National Laboratory

Bio: Nathan Urban is the group leader of the Optimal Experimental Design & Uncertainty Quantification group in the Applied Mathematics Department at Brookhaven National Laboratory's Computing & Data Sciences directorate (CDS). He holds a Ph.D. in theoretical condensed matter physics from Penn State, and has previously held research positions at Los Alamos National Laboratory, Princeton, and Penn State. His research interests include Bayesian inference and spatiotemporal statistics, probabilistic prediction and forecasting, multi-model / model-form / model structural uncertainty quantification, reduced order modeling, scientific machine learning and hybrid physical-data driven modeling, in-situ/streaming data analysis at scale, information fusion, decision making under uncertainty and optimal experimental design, and integrated multiscale computational frameworks for decision support.

Location: IACS Seminar Room

Lunch will be provided
Abstract: Machine learning (ML) systems fueled by neural networks have entered our daily lives and led to scientific breakthroughs, but many open questions remain. After a nod toward the question of rigor with ML and recent progress, I'll turn to the theory of neural networks. I will argue that understanding neural networks inevitably leads to ideas from field theory (FT), which was already realized in the simplest case in the 1990s, and I will review some essential FT-for-NN results. I will then propose that the connection might be more general, an NN-FT correspondence of sorts, with neural networks providing a way to define a field theory. I'll end with comments on known results including the origin of interactions and various symmetries, but I will also list some open questions. The apparent non-sequitur in the title will be used as a rhetorical device to explore where we are and where we'd like to go.

https://scgp.stonybrook.edu/calendar/full-calendar