Location: SAC Room 304
Location: SAC Room 304
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.
AI Department, Brookhaven National Laboratory
Abstract: Artificial intelligence is rapidly changing how we approach scientific discovery and engineering design. However, realizing the potential of modern AI in scientific domains requires going beyond simply applying models developed for natural language: scientific data have distinct structures, and scientific workflows often require tight integration among learned representations, domain knowledge, simulation, and numerical optimization.
In this talk, I will present two recent efforts that explore complementary directions for building AI systems for science and engineering. First, FM4NPP investigates whether the foundation-model paradigm can scale to experimental nuclear and particle physics. Using more than 11 million particle-collision events, we develop a self-supervised learning framework for sparse detector data and demonstrate scaling up to 188 million parameters. The resulting representations generalize across diverse downstream tasks and enable data-efficient adaptation with lightweight task-specific components.
Second, I will present AutoSizer, an LLM-driven framework for automatic sizing of analog and mixed-signal circuits. Rather than asking an LLM to perform numerical optimization directly, AutoSizer uses the LLM as a reasoning and orchestration layer that interprets circuit behavior, analyzes simulation feedback, and adaptively refines the optimization process.
Together, these studies illustrate two complementary roles for modern AI in scientific workflows: learning reusable representations from complex scientific data and reasoning over computational tools to guide challenging design and optimization problems. I will discuss the lessons from these efforts and opportunities toward more general, scalable, and reusable AI systems for science and engineering.
Short bio: Dr. Yihui (Ray) Ren is a Senior Computational Scientist in AI/ML and the AI-Codesign Group Lead in the Artificial Intelligence Department within Brookhaven National Laboratory's Computing and Data Sciences Directorate. His research focuses on AI for Science, AI-hardware codesign, real-time AI systems, and the evaluation of emerging AI hardware architectures. He also develops advanced AI methodologies for nuclear safeguards applications. Dr. Ren's key contributions include unpaired domain mapping techniques to mitigate domain shift, generative surrogate modeling, object detection and video synthesis using event-based cameras, and the development of AI foundation models such as the Foundation Model for Nuclear and Particle Physics (FM4NPP). Prior to joining Brookhaven National Laboratory in 2018, he was a postdoctoral researcher at Virginia Tech. He received his Ph.D. in Physics from the University of Notre Dame in 2015.
Location: NCS 120
Zoom: https://stonybrook.zoom.us/j/92507585369?pwd=9bw2hsQmLbladVpPRiaWK94gYlwCGQ.1&jst=2
The Pittsburgh Supercomputing Center is pleased to present a Machine Learning and Big Data workshop.
This workshop will focus on topics including big data analytics and machine learning with Spark, as well as deep learning.
This will be an IN PERSON event hosted by various satellite sites, there WILL NOT be a direct to desktop option for this event. SBU's Institute for Advanced Computational Science (IACS) is one of those satellite sites!
Location: IACS Conference Room #2
Interested applicants must first have an ACCESS ID. If you don't have the ID, please visit this page to create one: ACCESS USER REGISTRATION.