George Em Karniadakis received his SM and PhD from Massachusetts Institute of Technology. He was appointed lecturer in the Department of Mechanical Engineering at MIT in 1987 and subsequently he joined the Center for Turbulence Research at Stanford/Nasa Ames. He joined Princeton University as assistant professor in the Department of Mechanical and Aerospace Engineering and as associate faculty in the program of applied and computational mathematics. He was a visiting professor at Caltech in 1993 in the Aeronautics Department and joined Brown University as associate professor of applied mathematics in the Center for Fluid Mechanics in 1994. After becoming a full professor in 1996, he continues to be a visiting professor and senior lecturer of Ocean/Mechanical Engineering at MIT. He is an AAAS fellow (2018), fellow of the Society for Industrial and Applied Mathematics (2010), fellow of the American Physical Society (2004), fellow of the American Society of Mechanical Engineers (2003) and associate fellow of the American Institute of Aeronautics and Astronautics (2006). He received the Alexander von Humboldt award in 2017, the Ralf E Kleinman award (2015), the J. Tinsley Oden Medal (2013), and the CFD award (2007) from the US Association in Computational Mechanics. His h-index is 103, and he has been cited over 52,000 times.


Abstract:
Karniadakis will present a new approach to develop a data-driven, learning-based framework for predicting outcomes of physical and biological systems, governed by PDEs, and for discovering hidden physics from noisy data. He will introduce a deep learning approach based on neural networks (NNs) and generative adversarial networks (GANs). He will also introduce new NNs that learn functionals and nonlinear operators from functions and corresponding responses for system identification. Unlike other approaches that rely on big data, here we learn from small data by exploiting the information provided by the physical conservation laws, which are used to obtain informative priors or regularize the neural networks. He will demonstrate the power of PINNs for several inverse problems in fluid mechanics, solid mechanics and biomedicine including wake flows, shock tube problems, material characterization, brain aneurysms, etc., where traditional methods fail due to lack of boundary and initial conditions or material properties. He will also present a new NN, DeepM&Mnet, which uses DeepOnets as building blocks for multiphysics problems, and he will demonstrate its unique capability in a 7-field hypersonics application.  

To register and for more information, click here 
The Stony Brook Computing Society presents an exciting event featuring experts from Google (Danny Rosen - Technical Program Manager) and NVIDIA (Veer Mehta - Senior Solutions Architect), diving into the latest developments in generative AI. Learn how these industry leaders are shaping the future of technology and explore new ideas in a relaxed, engaging setting.

📍 Location: Frey 102
📅 Date: Monday, Nov 11
⏰ Time: 12 PM - 1:50 PM

Scan the QR code or register in the link.
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: In this talk, we take a step back and argue that many varied and seemingly unrelated attacks on the web are actually symptoms of one deeper problem that has existed since the web's inception. Whether it is attacks due to expired domain names, cloaking done by malicious websites, malvertising, or even our growing distrust of the news can be largely attributed back to the issue of stateless linking. Stateless linking refers to the absence of any integrity guarantees between the time that a link for a remote resource was created, to a future time when this link is resolved by web clients. We draw on 10+ years of research to demonstrate how stateless linking and the resulting lack of content integrity is the true culprit for many of our past, current, and likely future web problems. Successfully tackling this one really challenging problem, has the potential of solving many of our web woes.

Bio: Nick Nikiforakis is affiliated with the National Security Institute. He received his PhD in Computer Science from KU Leuven in Belgium. He received his MSc, in Parallel and Distributed Systems and BSc in Computer Science from the University of Crete, Greece. His research focuses on web security and privacy, software security, and intrusion detection.

Location: NCS 120
Join the Center of Excellence in Wireless and Information Technology (CEWIT) and their co-host IEEE-USA for a livestream panel discussion on Generative Artificial Intelligence (Gen AI). In this engaging livestream, we will dive into the technologies that continue to transform what is possible and explore the dynamic intersection of innovation, creativity, ethics, and Gen AI.

CEWIT is joined by Stony Brook University experts who will provide their insights and perspectives on this rapidly changing technology.

Meet the Panel

Laura Lindenfeld, PhD

Executive Director
Alan Alda Center for Communicating Science®
Dean
School of Communication & Journalism
BIO

Margaret Schedel, PhD
Associate Professor
Composition and Computer Music
Co-Founder
Lyrai
BIO

Steven Skiena, PhD

Interim Director
AI Innovation Institute
Distinguished Professor
Computer Science
BIO

Vivian Zhang
CTO/School Director
NYC Data Science Academy
Chief Data Officer
GoDental.ai
BIO


Register here.
TITLE: Towards a Theory of Encode/Decoder Architectures by Andrej Risteski of CMU

ABSTRACT: A common choice of architecture in representation learning (i.e., learning a good embedding of the data) is an encoder/decoder architecture, which tries to map a part of the input into a good latent representation (via an encoder), and predict the remaining part of the input (via a decoder). Two common examples are universal machine translation: where one tries to learn to translate between any pair of a set of languages via a common latent language, given paired up corpora for only a part of the pairs; and contextual encoders -- where one tries to predict a part of the image, given the rest of the image.
 
We will give a framework for analyzing the sample complexity of such architectures -- i.e., how many pairs of languages do we need to have paired up corpora for? How many image prediction tasks do we have to solve to get a good representation?


Abstract: In high-dimensional data spaces, vast empty regions often exist where no known data points are present. These empty spaces are not merely gaps but hold untapped potential for discovering novel configurations, optimizing parameters, and improving decision-making processes. However, traditional exploration techniques struggle to identify and leverage these regions due to the curse of dimensionality. To address this, we introduce the Empty Space Search Algorithm (ESA), a scalable, physics-inspired method that systematically identifies and explores these uncharted voids. ESA operates by modeling the data space as a dynamic system, using a repulsion-attraction mechanism to locate optimal empty space configurations (ESCs) without requiring exhaustive search. Building upon ESA, we present GapMiner, a visual analytics system that integrates human-in-the-loop AI to iteratively refine and validate ESCs. GapMiner combines parallel coordinate visualization, interactive optimization, and deep learning-based predictive modeling to enhance the efficiency of empty space exploration. This methodology has broad applications, including accelerating convergence in evolutionary algorithms through a more diverse initial population, optimizing adversarial learning strategies, and discovering novel parameter configurations in reinforcement learning. Our approach demonstrates that empty space is not just an absence of data but a frontier for new possibilities in high-dimensional problem-solving.
Bio: Xinyu Zhang received his B.E. in Computer Science from Shandong University, Taishan College, in 2019. He is currently a final-year Ph.D. candidate in the Department of Computer Science at Stony Brook University, advised by Prof. Klaus Mueller. His research focuses on multivariate data analysis, scientific visualization, and reinforcement learning. He has published multiple papers in top-tier journals and conferences, including IEEE TVCG and NeurIPS.
*this seminar will be held in person (food provided on a first come, first serve basis), and online (zoom link below)!
Topic: IACS Student Seminar Speaker: Xinyu Zhang
Time: Feb 26, 2025 12:00 PM Eastern Time (US and Canada)
Join Zoom Meeting
https://stonybrook.zoom.us/j/91848218975?pwd=lfITFa61GaXZ2Wsa1B1OnbLQMmXvOE.1

Meeting ID: 918 4821 8975
Passcode: 027337
AI + Music Seminar - The meeting will consist of introductions and organizational discussions, aimed at understanding participants' interests. We'll discuss what the seminars can focus on going forward.