AI Innovation Institute

As generative AI (GenAI) continues to reshape the educational landscape, educators must critically examine its implications for course design. How can we adapt our courses to ensure meaningful learning in a post-GenAI world? How can we harness its potential while mitigating risks to student learning? This seminar explores the evolving role of GenAI in higher education, emphasizing learner-centered teaching practices--such as backward design, transparency, and active learning--as essential strategies for navigating both the opportunities and challenges posed by GenAI. We will examine how GenAI disrupts traditional models of teaching and assessment, highlighting course design choices that intentionally promote deep learning and critical thinking in this new era.

Speaker Bio: Dr. Lourdes Alemán is an Associate Director at MIT's Teaching and Learning Lab (TLL). She earned her Ph.D. in Biology from MIT, studying RNA interference (RNAi) with Professor Phil Sharp. She later completed a postdoc in curriculum innovation with Professor Graham Walker's HHMI MIT Education Group. As a postdoc and research scientist, she helped develop software tools for teaching experimental design and data analysis, including collaborations with the MIT-Haiti Initiative. Before joining TLL, she worked at MIT's Open Learning, supporting MIT faculty in blended and online education. At TLL, Lourdes trains graduate students and postdocs in college-level teaching, advises faculty on classroom innovation, and previously designed and taught a hands-on biology module on novel antibiotic discovery for first-year students. She has served on university committees focused on mentoring and advising. Drawing from her experiences as a Cuban immigrant student, she developed MIT's first curriculum on growth mindset and co-founded Flipping Failure, a campus-wide initiative for students to share their stories of academic challenges and the strategies they have used to overcome them.

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.

Abstract: Designing custom proteins could revolutionize medicine and materials, but it remains an immense scientific challenge. Our work uses large-scale AI foundation models to generate novel proteins tailored to bind specific small molecules. Each AI-generated design is passed through a rigorous, multi-stage validation pipeline to ensure it is biophysically realistic. A key innovation is fine-tuning our model with data from molecular dynamics (MD) simulations, exposing it to the conformational dynamics and energetics of protein-ligand binding. This physics-aware training results in novel protein designs with enhanced stability and more effective binding capabilities.

Bio: Xin Dai is an Assistant Computational Scientist in the Artificial Intelligence Department of the CDS. His work centers on AI for Science with a strong focus on computational biology. He earned his PhD in Physics from Tsinghua University.

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.

Location: CDS, Bldg. 725, Training Room

Join Zoom Meeting: https://bnl.zoomgov.com/j/1604383624?pwd=ffQ5cUPNxTI7nzClKQO6cnsNbhF9Vf.1

Meeting ID: 160 438 3624
Passcode: 558449

Abstract:

It is known that models like large language models (LLMs) can often suggest colloquial plans given verbal descriptions of tasks, yet they are unable to reliably provide executable and verifiable plans given formally specified environments. In this talk, I will discuss a strand of efforts to have LLMs generate accurate and explainable plans in textual simulations. Instead of directly generating the plan or actions, LLMs are prompted to generate Planning Domain Definition Language (PDDL) that specifies the environment (domain file) and the task (problem file), which can then be deterministically solved with an off-the-shelf planner. In a 3-phase study, my collaborators and I first observed that it is possible but very challenging for LLMs to generate long-form code such as PDDL domain and problem files given textual specifications. Next, we devise methodologies for LLMs to iteratively generate and refine problem files while exploring a partially-observed, simulated, textual environment. Finally, we show that domain files are even more difficult to generate correctly, even on well-established planning tasks such as BlocksWorld. Finally, I will discuss ongoing efforts to improve said ability of structured generation and promising frontiers to explore.

Bio:
Li Harry Zhang is an assistant professor at Drexel University, focusing on Natural Language Processing (NLP) and artificial intelligence (AI). He obtained his PhD degree from the University of Pennsylvania advised by Prof. Chris Callison-Burch. Prior, he obtained his Bachelor's degree at the University of Michigan mentored by Prof. Rada Mihalcea and Prof. Dragomir Radev. His current research uses large language models (LLMs) to reason and plan via symbolic and structured representations. He has published more than 20 peer-reviewed papers in NLP and AI conferences, such as ACL, EMNLP, and AACL, that have been cited more than 1,000 times. He also consistently serves as Area Chair, Session Chair, and reviewer in those venues. Being a musician, producer, and content creator having over 50,000 subscribers, he is also passionate in the research of AI music and creativity.

Over the past decade, larger datasets, hardware accelerations, and network architecture improvements have contributed to phenomenal achievements in many tasks of computer

vision. However, in the absence of large datasets, computer vision models struggle to learn

general representations which results in poor performance. Few-shot learning tries to address 

this problem by proposing models which learn from a few examples.

I first give an overall review of few-shot learning methods. I particularly focus on generative Few Shot Learning(FSL) methods, which augment the scarce categories in a dataset by generating samples for those rare categories. As the actual class distribution can be complex and lie very close to each other, the sample generated for one class can be noisy or lie close to another class.  However, none of the current FS generative methods perform any form of quality control of the generated samples.

In this work, I propose to identify and remove the generated samples that are less likely to be in the distribution of the few-shot class. Here I particularly deal with few-shot scenarios where the

prior information of the relationship between the classes based on visual  similarity is available. The main idea is to exploit these priors to better identify the unreliable generated samples.

Particularly, I have proposed two methods based on class relationship to detect noisy generated samples. In the first method, we assume that the embedding space of each class follows a Gaussian distribution.  From this assumption, I propose Gaussian Neighborhood (GN), a method to estimate how likely a generated sample is drawn from the estimated distribution of a few-shot class.  We evaluate this method on the Hematopoiesis dataset.  By simply eliminating samples based on thresholding our proposed GN scores, the few-shot  classification  performance  is  improved by 5% and 2% in five shot and one shot respectively, compared to the model trained on all generated images. 

The GN scores represent the similarity distances from the generated samples to their classes, based on the assumption that each class is a Gaussian distribution.  However, this assumption might be strict in many scenarios since the real distributions of data can be arbitrarily complex.  Thus in my second proposed method, I aim to learn such similarity distances directly from data via metric learning. I propose to train a deep-network to regress the similarity distance between a pair of samples.  This network is trained using both the class-level  visual  similarity  information  and  the  class  labels.   This method improves the 1-shot and 5-shot classification performances by 0.5% and 1% respectively, compared to GN.