https://stonybrook.zoom.us/j/91775729097pwd=Qlc5Nks0NmlyKzJwMjR0S0hrdVZ3QT09

Meeting ID: 917 7572 9097
Passcode: 555459


Abstract: As the saying goes, there are many ways to skin a cat.
While we don't want to go around skinning cats, the world of
optimization is rich with different problems, problem formulations,
and methods and approaches, each with different guarantees and
computational benefits. In this talk we will take a tour down the
problem of structured sparsity in sensing to see how one simple
problem can inspire a wide range of analysis and tools. First, I will
present the optimality conditions for a generalized structured sparse
problem, which can be geometrically visualized as alignment of vectors
and matrices. Then I will introduce three approximation methods for
the problem of phase retrieval, which are a twist on stochastic
gradient and coordinate descent methods. These methods leverage
fundamental numerical linear algebra concepts to give fast approximate
solutions to large-scale problems, which then after postprocessing can
produce more reliable sensing results.

Bio: Yifan Sun received her PhD in Electrical Engineering from the
University of California Los Angeles in 2015, with research focusing
on convex optimization and semidefinite programming. She was then
Technicolor Research and Innovation, focusing on machine learning and
data science applications. More recently, she completed two postdocs,
at the University of British Columbia in Vancouver, Canada and
L'Institut National de Recherche en Informatique et Automatique
(INRIA) in Paris, France.

You are cordially invited to attend the biweekly Brookhaven AI Mixer (BAM). BAM includes one short talk on AI research happening at BNL, followed by an open mixer over coffee and snacks for everyone to network and discuss all things AI. The first half hour will consist of presentations that will be available via ZOOM, and the second half hour will be for in person only networking.

Join us every other Tuesday at noon in CDSD's Training Room (building 725, 2nd floor) to learn about interesting AI methods and applications, engage with potential collaborators, prepare for pending FASST funding calls, and build a community of AI for Science at BNL.

Machine Learning for Seismic Low Frequency Extrapolation

Abstract: The cycle skipping problem that plagues seismic inversion can be mitigated by utilizing low-frequency seismic data, which captures the kinematics of wave propagation, in conjunction with a reasonable initial velocity model. However, seismic sources and receivers are band-limited and cannot provide signals down to 0 Hz. To improve solution of the seismic inverse problem one can synthesize the missing low-frequency content by solving a regression problem using machine learning (ML). The recorded high-frequency (HF) seismic data is the input and the ML models are trained to predict the missing low-frequency (LF) seismic data. Deep learning models utilizing convolutional neural networks (CNNs) and generative adversarial networks (GANs) demonstrate important capabilities for LF extrapolation. However, such models require powerful hardware and careful training. We explore the feasibility of using less costly ML models such as a random forest, Gaussian process surrogates, and gradient boosting as alternatives to computationally expensive deep learning models.

Biography: Sue Minkoff is Chair of Applied Mathematics at Brookhaven National Laboratory. From 2012-2024 she was a Professor of Mathematical Sciences and an Affiliated Professor in the Departments of Sustainable Earth Systems Sciences and Science and Mathematics Education at the University of Texas at Dallas. From 2000-2012 she served on the faculty in the Department of Mathematics and Statistics at the University of Maryland, Baltimore County. She received her doctorate in Computational and Applied Mathematics from Rice University. From 1995-1997 she was a National Science Foundation-Industrial postdoc joint with the University of Texas at Austin and British Petroleum, and from 1997-2000 she held the von Neumann Fellowship in the Mathematics Department at Sandia National Labs. In 2000 Minkoff was promoted to Senior Member of the Technical Staff in Sandia's Geophysics Department. Minkoff's research interests include scientific computing, inverse problems, uncertainty quantification and digital twins modeling, Earth science, and photonics.

Location: CDS, Bldg. 725, Training Room

Join ZoomGov Meeting: https://bnl.zoomgov.com/j/1606848158?pwd=miUtq7OkYL5SNkjbgVb19teZPNennd.1

Meeting ID: 160 684 8158
Passcode: 068399

Abstract: Drawing on group-theoretic and information-theoretic foundations, we propose information lattice learning (ILL) as a general framework to learn rules of a signal (e.g., an image or a probability distribution). In our definition, a rule is a coarsened signal used to help us gain one interpretable insight about the original signal. To make full sense of what might govern the signal's intrinsic structure, we seek multiple disentangled rules arranged in a hierarchy, called a lattice. Compared to representation/rule-learning models optimized for a specific task (e.g., classification), ILL focuses on explainability: it is designed to mimic human experiential learning and discover rules akin to those humans can distill and comprehend. We will detail the mathematical foundations and algorithms of ILL, and illustrate how it addresses the fundamental question what makes X an X by creating rule-based explanations designed to help humans understand. Our focus is on explaining X rather than (re)generating it. We show ILL's efficacy and interpretability on benchmarks and assessments, as well as a demonstration of ILL-enhanced classifiers achieving human-level digit recognition using only one or a few MNIST training examples (1-10 per class). We present applications in knowledge discovery, using ILL to distill music theory from scores and chemical laws from molecules and further revealing connections between them. We close with some early work on understanding the principles that govern scattering amplitudes in Super Yang-Mills theory, rather than just predicting them.

Biography: Lav R. Varshney is the Della Pietra Infinity Professor and inaugural director of the AI Innovation Institute at Stony Brook University. He is co-founder and CEO of Kocree, Inc., a startup company building novel human-controllable AI for discovery and creativity, and chief scientist of Ensaras, Inc., a startup company focused on AI and wastewater treatment. He holds appointments at RAND Corporation and at Brookhaven National Laboratory. He was previously on the faculty of the University of Illinois Urbana-Champaign, a visiting scholar at Northwestern's Kellogg School of Management, a principal research scientist at Salesforce Research AI, and a research staff member at IBM Research. He is a former White House staffer, having served on the National Security Council staff as a White House Fellow, where he contributed to national AI and wireless communications policy. His research interests include information theory and artificial intelligence. He received his B.S. degree from Cornell University and his S.M. and Ph.D. degrees from the Massachusetts Institute of Technology.

Location: Room 102
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.
Research challenges in using computer vision in robotics systems Abstract The past decade has seen a remarkable increase in the level of performance of computer vision techniques, including with the introduction of effective deep learning techniques. Much of this progress is in the form of rapidly increasing performance on standard, curated datasets. However, translating these results into operational vision systems for robotics applications remains a formidable challenge. This talk with explore some of the fundamental questions at the boundary between computer vision and robotics that need to be addressed. This includes introspection/self-awareness of performance, anytime algorithms for computer vision, multi-hypothesis generation, rapid learning and adaptation. The discussion will be illustrated by examples from autonomous air and ground robots.
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 15 minutes) by multiple students. Students can register for 1 credit for CSE656. Registered students must attend and present a minimum of 2 talks. Everyone else is welcome to attend. Fill in https://forms.gle/q6UG9ygauLp2a8Po8 to subscribe to our mailing list for further announcement.
Abstract: Jailbreak attacks circumvent LLMs' built-in safeguards by concealing harmful queries within adversarial prompts. While most existing defenses attempt to mitigate the effects of adversarial prompts, they often prove inadequate as adversarial prompts can take arbitrary, adaptive forms. This paper introduces RobustKV, a novel jailbreak defense that takes a fundamentally different approach by selectively removing critical tokens of harmful queries from key-value (KV) caches. Intuitively, for an adversarial prompt to be effective, its tokens must achieve sufficient `importance' (measured by attention scores), which consequently lowers the importance of tokens in the concealed harmful query. Therefore, by carefully evicting the KVs of low-ranked tokens, RobustKV minimizes the harmful query's presence in the KV cache, thus preventing the LLM from generating informative responses. Extensive evaluation using benchmark datasets and models demonstrates that RobustKV effectively counters state-of-the-art jailbreak attacks while maintaining the LLM's performance on benign queries. Notably, RobustKV creates an interesting effectiveness-evasiveness dilemma for the adversary, leading to its robustness against adaptive attacks.

Speaker: Tanqiu Jiang

Where: NCS 220 and Zoom (https://stonybrook.zoom.us/j/6406956411)