AI Innovation Institute

Abstract: Machine learning (ML) systems fueled by neural networks have entered our daily lives and led to scientific breakthroughs, but many open questions remain. After a nod toward the question of rigor with ML and recent progress, I'll turn to the theory of neural networks. I will argue that understanding neural networks inevitably leads to ideas from field theory (FT), which was already realized in the simplest case in the 1990s, and I will review some essential FT-for-NN results. I will then propose that the connection might be more general, an NN-FT correspondence of sorts, with neural networks providing a way to define a field theory. I'll end with comments on known results including the origin of interactions and various symmetries, but I will also list some open questions. The apparent non-sequitur in the title will be used as a rhetorical device to explore where we are and where we'd like to go.

https://scgp.stonybrook.edu/calendar/full-calendar

What AI tools are available to help with the scholarly research process? Are they helpful? What do they do and is it worth the time and energy to try them out? Join librarian Christine Fena to explore and compare established and emerging AI research tools such as Elicit, Scite, Consensus, and Undermind. The online workshop will provide a starting point to understanding what these tools are, the basics of how they work, and how AI research assistants might bring changes to your search process in the future. All are welcome!



Register here via Zoom.

Professor Nanpeng Yu from UC Riverside present Machine Learning and Big Data Analytics in Power Distribution Systems.

Abstract: The electric utility industry is being swamped by petabytes of data coming from various sources such as smart meters, phasor measurement units, SCADA systems, geographical information systems and customer management systems. The primary and secondary value embedded in the complex and heterogeneous data sets from power distribution systems is immense. However, algorithms and applications for unlocking the potential of big data in power systems are at an early stage of development. This talk discusses the recent advancement of machine learning algorithms and big data analytics methods in power distribution systems. In particular, we will explain how to develop hybrid algorithms, which synergistically combine the merits of state-of-the-art machine learning algorithms and physical model-based methods. We will take a deep dive into the following applications: network topology identification, electricity theft detection, estimation of behind-the-meter solar generation and data-driven distribution system controls.

Bio: Dr. Nanpeng Yu received his B.S. in Electrical Engineering from Tsinghua University, Beijing, China, in 2006. Dr. Yu received his M.S. degrees in Electrical Engineering and Economics and Ph.D. degree from Iowa State University in 2010. Before joining University of California, Riverside, Dr. Yu was a senior power system planner and project manager at Southern California Edison from Jan, 2011 to July 2014.

Currently, he is an Associate Professor in the Department of Electrical and Computer Engineering at the University of California, Riverside, CA. Dr. Yu is the recipient of the Regents Faculty Fellowship and Regents Faculty Development award from University of California. He received multiple best paper awards from IEEE Power and Energy Society General Meeting, IEEE Power and Energy Society Grand International Conference and Exposition Asia and the Second International Conference on Green Communications, Computing and Technologies.

Dr. Yu is the director of Smart City Innovation Laboratory at UC Riverside. He currently serves as the vice chair of the distribution system operation and planning subcommittee of IEEE Power and Energy Society and the co-chair for IEEE Big Data Applications in Power Distribution Networks Task Force. Dr. Yu currently serves as the associate editor for IEEE Transactions on Smart Grid and International Transactions on Electrical Energy Systems.

Abstract:
Coarse grained (CG) models alleviate the drawbacks of all-atom simulations. The latter still pose challenges because they are computationally expensive and give access to limited spatiotemporal scales, despite the use of modern high-performance computing clusters. CG models ignore some of the atomistic degrees of freedom, leading to fewer interatomic interactions, hence less computing time. Introducing such models emphasizes the need to properly manage these multiple scales, by carefully deriving potentials and reconstructing conformations from their CG representations, usually with the help of Machine Learning. Following a bottom-up and force matching approach, we train a Physics-Informed Neural Network to extract the CG force field parameters from all-atom simulation data. We verify our approach by applying it to fibrin monomers to study multiple-fibrin polymerization in solution at the microsecond scale, after modifying the force field to incorporate further non-bonded interactions, not present in the training data. Access to these scales will allow us to study the effects of some of the molecules' components. Furthermore, we modify recent solutions in data-driven protein backmapping. Taking advantage of the developments in graph neural networks and variational inference, we introduce an intermediate step in the all-atom reconstruction of a molecule given its CG configuration, in an attempt to more accurately de-coarsen structures whose atom-to-CG-beads ratio is very high. The combined effect of our new forward and inverse coarse graining methodology will enable the in silico study of many phenomena that are highly dynamic and intrinsically multiscale.

Bio:
Georgios Kementzidis is a third year PhD student in the Department of Applied Mathematics and Statistics at Stony Brook University. His advisor is Dr. Yuefan Deng. His research interests lie at the intersection of Computational Science, molecular dynamics (MD) simulations, and Machine Learning (ML) applications to Computational Biophysics. He is particularly interested in coarse-graining and multi-scale simulations.

*Note: this seminar will be held in-person (food provided on a first-come, first serve basis) and online*

Join Zoom Meeting https://stonybrook.zoom.us/j/99510099036?pwd=EyowuLBGvUVLZDBlG6F6chkMICFOZ7.1
Meeting ID: 995 1009 9036
Passcode: 132419

Dates: Friday, April 16, 2021 - 2:40pm to 3:40pm Location: Zoom - contact events@cs.stonybrook.edu for Zoom info.

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.

The Provost's Lecture Series features talks by SUNY Distinguished Academy faculty members at Stony Brook University, showcasing the outstanding research and scholarship that is taking place at our institution.

Joe Mitchell

SUNY Distinguished Professor, Applied Mathematics and Statistics
Chair, Department of Applied Mathematics and Statistics, College of Engineering and Applied Sciences

A Case for Algorithms: A Computational Geometer's Perspective

Algorithms are all around us in every smart device and technology that has consumed our daily lives. As a computational geometer, I study algorithms to solve problems that involve a geometric perspective on data. I have observed that practically every technology and field of study has a need for effective algorithms involving geometric data. I reflect on some favorite algorithmic problems that are easy to visualize, but challenging to solve, and argue that the formal study of algorithms remains essential in the age of AI.

Reception to follow immediately after the talks.

Register here.