Talks.cam will close on 1 July 2026, further information is available on the UIS Help Site
 

University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Neural Operators for Scientific Simulation

Neural Operators for Scientific Simulation

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Xianda Sun.

Scientific simulations are central to understanding complex physical systems, informing engineering design, risk assessment, and scientific discovery. However, traditional numerical solvers scale poorly as we increase resolution, consider high-dimensional domains, or attempt to capture multi-scale physics, leading to prohibitive computational cost. Recent data-driven approaches offer a different philosophy: rather than re-solving the governing equations from scratch, we aim to learn the underlying physics directly from data. Physics-informed neural networks (PINNs) were an early step in this direction, embedding soft differential equation constraints into the loss function. However, they face challenges with optimisation, stiffness, and scalability to large domains and long time horizons, and they must be retrained for each new boundary or initial condition. In this talk, I will discuss neural operators as a promising alternative. Neural operators learn mappings between infinite-dimensional function spaces, enabling mesh-free inference, efficient resolution refinement, and amortised solution of many-query simulation tasks. These models have shown strong performance on high-dimensional, non-linear, and multi-scale phenomena, from weather forecasting to single-cell electrophysiology and photonics, and I will highlight both current capabilities and open challenges.

This talk is part of the Machine Learning Reading Group @ CUED series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2026 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity