Join the Office of Educational Effectiveness' upcoming workshop on the transformative potential of AI tools to enhance program assessment. Learn how to leverage AI to create targeted learning objectives, detailed rubrics, and precise benchmarks that will elevate the quality and effectiveness of your program assessment process. Join in-person on Oct. 17 at 10:30 am or virtually on Oct. 21 at 12 pm.

Register in advance: https://calendar.stonybrook.edu/site/office-educational-effectiveness/event/leveraging-ai-in-assessment-zoom/
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: The capacity to adapt machine learning models to various contexts, information, and objectives is particularly valuable. In this thesis, I focus on developing Class Conditional Guided Models. These are models that can be adaptively biased towards a class of interest via a conditional input. My primary focus lies in the efficiency of these models. They are constructed to require training only once, with the ability to quickly and conveniently adapt during testing time without necessitating fine-tuning or retraining.
Firstly, I propose RelationVAE, a novel generative model designed for few-shot scenarios, utilizing the prior knowledge of class similarity relationships. RelationVAE is designed to condition on the embeddings of the neighbor classes (i.e. classes with similarity relationships), to generate more reliable samples by making them more similar to the neighbor class. This enables adaptation of the generative model to the provided prior knowledge about class relationships.
As a second focus, I introduce scGAN, a shadow segmentation technique that enables adaptation to varying shadow distributions in different testing environments. scGAN is designed to condition on a sensitivity parameter, a scalar, to control the amount of the shadow detected. In the testing phase, the parameter is set to appropriate values, allowing the model to quickly adapt to specific test environments.
In my third contribution, I propose S-SEG, a methodology for fine-grained counting allowing adaptation to different granularities of fine-grained classes. In fine-grained problems, the distinction between classes is subtle and inconsistent across images, leading to variations in the granularity of the target class from one image to another. S-SEG is designed to be conditioned on an additional input, the sensitivity parameter, to control the granularities of the target class during inference.
My fourth contribution is a text-to-image synthesis method which allows controlling the number of the generated objects of a target class. I propose to generate an intermediate condition, the density map, which reflects the number of objects, together with their layout. This intermediate condition is used to effectively guide the generative model to generate objects with accurate counts.

Speaker: Vu Nguyen

Zoom: https://stonybrook.zoom.us/j/97114455337?pwd=Z4rB9dWcstlahUIs8PRrvQ9b2ZK2Df.1
Meeting ID: 971 1445 5337
Passcode: 272300
Communication-Efficient Heterogeneity-Aware Machine Learning System and Architecture by Xuehai Qian

ABSTRACT: The key success of deep learning is the increasing size of models that can achieve high accuracy. At the same time, it is difficult to train the complex models with large data sets. Therefore, it is crucial to accelerate training with distributed systems and architectures, where communication and heterogeneity are two key challenges. In this talk, I will present two heterogeneity-aware decentralized training protocols without communication bottleneck. Specifically, Hop supports arbitrary iteration gap between workers by novel queue-based synchronization which can tolerate heterogeneity with system techniques. Prague uses randomized communication to tolerate heterogeneity with a new training algorithm based on partial reduce -- an efficient communication primitive. If time permits, I will present the systematic tensor partitioning for training on heterogeneous accelerator arrays (e.g., GPU/TPU). We believe that our principled approaches are crucial for achieving high-performance and efficient distributed training.

BIO: Xuehai Qian is an assistant professor at University of Southern California. His research interests include domain-specific systems and architectures, performance tuning and resource management of cloud systems and parallel computer architectures. He received his PhD from the University of Illinois Urbana Champaign and was a postdoc at UC Berkeley. He is the recipient of W.J Poppelbaum Memorial Award at UIUC, NSF CRII and CAREER Award, and the inaugural ACSIC (American Chinese Scholar In Computing) Rising Star Award.
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

Jerome Liang, PhD 

Professor of Radiology, Biomedical Engineering, Electric and Computer Engineering, and Computer Science 

Co-Director of Research 

Department of Radiology 


Artificial intelligence, machine learning and computer-aided diagnosis in cancer Imaging 

February 11, 2021 

12:00pm - 1:00pm 

Virtual Seminar - Zoom 

https://stonybrook.zoom.us/j/98155629970?pwd=YzRvcnJnTlNTT1E5ak1oZEJvWTZHQT09 

Meeting ID: 981 5562 9970 

Passcode: 950410 

Host: 

Wei Zhao, PhD 

Professor of Radiology and Biomedical Engineering 

Educational Objectives  

Upon completion, participants should be able to:  

(1) Learn different medical image representations of cancer attributes, such as heterogeneity, high tendency to grow, etc.  

(2) Learn how computer (machine) can be trained (or programmed) to recognize the image representations.  

(3) Learn how artificial intelligence can drive the machine learning to maximize the performance of computer-aided diagnosis (CADx).  

Disclosure Statement  

In compliance with the ACCME Standards for Commercial Support, everyone who is in a position to control the content of an educational activity provided by the School of Medicine is expected to disclose to the audience any relevant financial relationships with any commercial interest that relates to the content of his/her presentation.  

 

The speaker, Jerome Liang, PhD, the planners; and the CME provider have no relevant financial relationship with a commercial interest (defined as any entity producing, marketing, re-selling, or distributing health care goods or services consumed by, or used on, patients), that relates to the content that will be discussed in the educational activity.  

 

CONTINUING MEDICAL EDUCATION CREDITS  

The School of Medicine, State University of New York at Stony Brook, is accredited by the Accreditation Council for Continuing Medical Education to provide continuing medical education for physicians.  

 

The School of Medicine, State University of New York at Stony Brook designates this live activity for a maximum of 1.0 AMA PRA Category 1 Credits™. Physicians should only claim credit commensurate with the extent of their participation in the activity.  

 

Should you be logging in Zoom by using your tablet or mobile device, please be sure to add your Full Name and/or Email for CME credit. 

Synthetic Dreams and Ghost Machines

Dr. Steven Skiena will join the Cinema for a presentation exploring the rapidly evolving worlds of artificial intelligence and robotics.

Dr. Skiena is Distinguished Teaching Professor of Computer Science and Associate Director of the AI Innovation Institute at Stony Brook University. A leading researcher in data science and algorithms, he is the author of several influential books on AI and computation, including The Algorithm Design Manual and The Data Science Design Manual.

The presentation will be followed by a screening of Ex Machina, Alex Garland's provocative science-fiction thriller exploring the seductive and unsettling boundaries between human consciousness and artificial intelligence.

AI Institute Seminar Title: A Geometric Understanding of Deep Learning Abstract: This work introduces an optimal transportation (OT) view of generative adversarial networks (GANs). Natural datasets have intrinsic patterns, which can be summarized as the manifold distribution principle: the distribution of a class of data is close to a low-dimensional manifold. GANs mainly accomplish two tasks: manifold learning and probability distribution transformation. The latter can be carried out using the classical OT method. From the OT perspective, the generator computes the OT map, while the discriminator computes the Wasserstein distance between the generated data distribution and the real data distribution; both can be reduced to a convex geometric optimization process. Furthermore, OT theory discovers the intrinsic collaborative--instead of competitive--relation between the generator and the discriminator, and the fundamental reason for mode collapse. We also propose a novel generative model, which uses an autoencoder (AE) for manifold learning and OT map for probability distribution transformation. This AE-OT model improves the theoretical rigor and transparency, as well as the computational stability and efficiency; in particular, it eliminates the mode collapse. The experimental results validate our hypothesis, and demonstrate the advantages of our proposed model.